Efficient scheduling of task graphs to multiprocessors using a combination of modified simulated annealing and list based scheduling

3rd International Symposium on Intelligent Information Technology and Security Informatics, IITSI 2010

Volumn , Issue , 2010, Pages 350-354

  Houshmand, Mahboobeh ^a   Soleymanpour, Elaheh ^a   Salami, Hossein ^a   Amerian, Mahya ^b   Deldari, Hossein ^a  

^a FERDOWSI UNIVERSITY OF MASHHAD   (Iran)

^b UNIVERSITY OF MAZANDARAN   (Iran)

Author keywords

List based scheduling algorithms; Modified simulated annealing; NP hard problems; Task scheduling problem

Indexed keywords

EFFICIENT SCHEDULING; INITIAL SOLUTION; LIST BASED SCHEDULING ALGORITHMS; LIST-SCHEDULING; MAKESPAN MINIMIZATION; MULTIPROCESSOR TASK SCHEDULING; NON-LINEAR OPTIMIZATION PROBLEMS; NP-HARD PROBLEM; SIMULATION RESULT; TASK GRAPH; TASK SCHEDULING PROBLEM;

ANNEALING; INFORMATION SCIENCE; INFORMATION TECHNOLOGY; MACHINE SHOPS; MULTIPROCESSING SYSTEMS; MULTITASKING; SCHEDULING ALGORITHMS;

SIMULATED ANNEALING;

EID: 77952707343     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IITSI.2010.137     Document Type: Conference Paper

References (25)

1. D. Applegate and W. Cook, "A computational study of the Job-shop Scheduling problem," ORSA Journal on Computing, vol. 3, pp. 149-156, 1991.
2. S. Sutar, J. Sawant, and J. Jadhav, "Task scheduling for multiprocessor systems using memetic algorithms," in 4th International Working Conference Performance Modeling and Evaluation of Heterogeneous Networks (HET-NETs '06), 2006.
3. S. Kirkpatrick, G. J. C. D., and M. P. Vecchi, "Optimization by Simulated Annealing," vol. 220, pp. 671-680, 1983.
4. E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing Wiley, 1989.
5. H. Orsila, T. Kangas, E. Salminen, and T. D. Ḧam̈al̈ainen, "Parameterizing Simulated Annealing for Distributing Task Graphs on Multiprocessor SoCs," in Symposium on System-on-Chip, Tampere, Finland, 2006, pp. 73-76.
6. S. Wanneng and Z. Shijue, "A parallel genetic simulated annealing hybrid algorithm for task scheduling " Wuhan University Journal of Natural Sciences, pp. 1378-1382, 2008.
7. G. E. Nasr, A. Harb, and G. Meghabghab, "Enhanced Simulated Annealing Techniques for Multiprocessor Scheduling," in Proceedings of the Twelfth International FLAIRS Conference, 1999.
8. A. K. Nanda, D. DeGroot, and D. L. Stenger, "Scheduling directed task graphs on multiprocessors using simulatedannealing," in Proceedings of the 12th International Conference on Distributed Computing Systems, 1992., Yokohama, Japan.
9. M. E. Aydin and T. C. Fogarty, "A simulated annealing algorithm for multi-agent systems: a job-shop scheduling application " Journal of Intelligent Manufacturing, pp. 805-814, 2005.
10. M. König and U. Beißert, "Construction Scheduling Optimization by Simulated Annealing," 26th International Symposium on Automation and Robotics in Construction (ISARC 2009), 2009.
11. M. Miki, T. Hiroyasu, M. Kasai, K. Ono, and T. Jitta, "Temperature parallel simulated annealing with adaptive neighborhood for continuous optimization problem," The International computational Intelligence and applications, pp. 149-154, 2002.
12. H. Orsila, E. Salminen, and T. D. Hämäläinen, "Best Practices for Simulated Annealing in Multiprocessor Task Distribution Problems (book chapter)," in Simulated Annealing: I-Tech Education and Publishing KG, 2008, pp. 321-342.
13. Y.-C. Chung and S. Ranka, "Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors," in Supercomputing '92: Proceedings of the 1992 ACM/IEEE Conference on Supercomputing, 1992, pp. 512-521.
14. A. Gerasoulis and T. Yang, "A comparison of clustering heuristics for scheduling dags on multiprocessors," Journal of Parallel and Distributed Computing, pp. 276-291, 1992.
15. J.-C. Liou and M. A. Palis, "A comparison of general approaches to multiprocessor scheduling," in Proc. International Parallel Processing Symposium, 1997, pp. 152-156.
16. D. J. RAM, T. H. SREENIVAS, and K. G. SUBRAMANIAM, "Parallel Simulated Annealing Algorithms," Journal of Parallel and Distributed Computing, vol. 37, pp. 207-212, 1996.
17. M. K. Dhodhi, I. Ahmad, and I. Ahmad, "A Multiprocessor Scheduling Scheme Using Problem-Space Genetic Algorithms," in IEEE International Conference on Evolutionary Computation, 1996.
18. S. Benedict and V. Vasudevan, "Scheduling of scientific workflows using simluated anealing algorithm for computional grids," International journal of soft computing, vol. 2, pp. 606-611, 2007.
19. L. Ingber, "Simulated Annealing: Practice versus Theory," Mathl. Comput. and Modelling, vol. 18, pp. 29-57, 1993.
20. K. R. Pattipati, R. T. Kurien, T. Lee, and P. B. Luh, "On Mapping a Tracking Algorithm Onto Parallel Processors," IEEE Transactions on Aerospace and Electronic Systems, vol. 26, pp. 774-791, 1990.
21. T. Pop, P. Eles, and Z. Peng, "Holistic Scheduling and Analysis of Mixed Time/Event-Triggered Distributed Embedded Systems," in Proceedings of the tenth International Symposium on Hardware/software Codesign, 2002, pp. 187-192.
22. Y. Shin and K. Choi, "Enforcing schedulability of multitask systems by hardware-software codesign," in Proceedings of the Fifth International Workshop on Hardware/Software Codesign, 1997, pp. 3-7.
23. T. Hagras and J. Janecek, "A high performance, low complexity algorithm for compile-time job scheduling in homogeneous computing environments.," in Proc. International Conf. on Parallel Processing Workshops, 2003, pp. 149-155.
24. H. Topcuoglu, S. Hariri, and M.-Y. Wu, "Performanceeffective and low-complexity task scheduling for heterogeneous computing," IEEE Trans. Parallel Distributed Syst, vol. 13, pp. 260-274, 2002.
25. T. Hagras and J. Janecek., "An approach to compile-time task scheduling in heterogeneous computing systems," in Proc. International Conf. on Parallel Processing Workshops, 2004, pp. 182-189.