Abstract
Task scheduling is an essential aspect of parallel processing system. This problem assumes fully connected processors and ignores contention on the communication links. However, as arbitrary processor network (APN), communication contention has a strong influence on the execution time of a parallel application. In this paper, we propose multi-objective genetic algorithm to solve task scheduling problem with time constraints in unstructured heterogeneous processors to find the scheduling with minimum makespan and total tardiness. To optimize objectives, we use Pareto front based technique, vector based method. In this problem, just like tasks, we schedule messages on suitable links during the minimization of the makespan and total tardiness. To find a path for transferring a message between processors we use classic routing algorithm. We compare our method with BSA method that is a well known algorithm. Experimental results show our method is better than BSA and yield better makespan and total tardiness.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Tang, X.Y., Li, K.L., Padua, D.: Communication contention in APN list scheduling algorithm. Science in China Series F: Information Sciences 52, 59–69 (2009)
Kwok, Y., Ahmad, I.: Link Contention-Constrained Scheduling and Mapping of Tasks and Messages to a Network of Heterogeneous Processors. Cluster Computing, 113–124 (2000)
Yoo, M., Gen, M.: Scheduling algorithm for real-time tasks using multiobjective hybrid genetic algorithm in heterogeneous multiprocessors system. The Journal of Computers & Operations Research 34, 3084–3098 (2007)
Wang, X.-J., Zhang, C.-Y., Gao, L., Li, P.-G.: A survey and future trend of study on multi-objective scheduling. In: IEEE Fourth International Conference on Natural Computation (2008)
Sinnen, O.: Task scheduling for parallel systems. JohnWiley & Sons-Interscience, Hoboken (2007)
Sinnen, O., Sousa, L.A., Sandnes, F.E.: Toward a realistic task scheduling model. IEEE Trans. Parallel and Distributed Systems 17, 263–275 (2006)
Cheng, S.-C., Shiau, D.-F., Huang, Y.-M., Lin, Y.-T.: Dynamic hard-real-time scheduling using genetic algorithm for multiprocessor task with resource and timing constraints. Expert Systems with Applications 36, 852–860 (2009)
Yoo, M.: Real-time task scheduling by multiobjective genetic algorithm. Systems & Software 82, 619–628 (2009)
Shin, K., Cha, M., Jang, M., Jung, J., Yoon, W., Choi, S.: Task scheduling algorithm using minimized duplications in homogeneous systems. Parallel and Distributed Computing 68, 1146–1156 (2008)
Kwok, Y.K., Ahmad, I.: Benchmarking and comparison of the task graph scheduling algorithms. Parallel and Distributed Computing 59, 381–422 (1999)
Alkaya, A.F., Topcuoglu, H.R.: A task scheduling algorithm for arbitrarily-connected processors with awareness of link contention. Cluster Computing 9, 417–431 (2006)
Page, A.J., Naughton, T.J.: Dynamic task scheduling using genetic algorithms for heterogeneous distributed computing. In: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005 (2005)
Guliashki, V., Toshev, H., Korsemov, C.: Survey of Evolutionary Algorithms Used in Multiobjective Optimization. Bulgarian Academy of Sciences (2009)
Oliver, I.M., Smith, D.J., Holland, J.: A study of permutation crossover operators on the traveling salesman problem. In: Second International Conference on Genetic Algorithms on Genetic algorithms and their application, pp. 224–230. Lawrence Erlbaum Associates, inc., Mahwah (1987)
Zomaya, A.Y., Teh, Y.-H.: Observations on Using Genetic Algorithms for Dynamic Load-Balancing. IEEE Trans. Parallel and Distributed Systems 12, 899–911 (2001)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)
Al-Sharaeh, S., Wells, B.E.: A Comparison of Heuristics for List Schedules using The Box-method and P-method for Random Digraph Generation. In: Proceedings of the 28th Southeastern Symposium on System Theory, pp. 467–471 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sedaghat, N., Tabatabaee-Yazdi, H., Akbarzadeh-T, MR. (2010). Pareto Front Based Realistic Soft Real-Time Task Scheduling with Multi-objective Genetic Algorithm in Unstructured Heterogeneous Distributed System. In: Bellavista, P., Chang, RS., Chao, HC., Lin, SF., Sloot, P.M.A. (eds) Advances in Grid and Pervasive Computing. GPC 2010. Lecture Notes in Computer Science, vol 6104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13067-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-13067-0_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13066-3
Online ISBN: 978-3-642-13067-0
eBook Packages: Computer ScienceComputer Science (R0)