An extention of edge zeroing heuristic for scheduling precedence constrained task graphs on parallel systems using cluster dependent priority scheme

2010 International Conference on Computer and Communication Technology, ICCCT-2010

Volumn , Issue , 2010, Pages 647-651

  Mishra, Abhishek ^a   Tripathi, Anil Kumar ^a  

^a BANARAS HINDU UNIVERSITY   (India)

Author keywords

Clustering; Homogeneous systems; Parallel processing; Scheduling; Task allocation

Indexed keywords

CLUSTERING; CONSTRAINED TASKS; DEPENDENT FUNCTIONS; EDGE WEIGHTS; HOMOGENEOUS SYSTEMS; PARALLEL PROCESSING; PARALLEL SYSTEM; PRIORITY SCHEMES; PRIORITY-BASED; TASK ALLOCATION;

ALGORITHMS;

PARALLEL PROCESSING SYSTEMS;

EID: 78650526289     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCT.2010.5640450     Document Type: Conference Paper

References (30)

1. T.L. Adam, K.M. Chandy, and J.R. Dickson, "A comparison of list schedules for parallel processing systems," Communications of the ACM, vol. 17, 1974, pp. 685-689.
2. U. Banerjee, R. Eigenmann, A. Nicolau, and D.A. Padua, "Automatic program parallelization," Proceedings of the IEEE, vol. 81, 1993, pp. 211-243.
3. E.G. Coffman, and R.L. Graham, "Optimal scheduling for two-processor systems," Acta Informatica, vol. 1, 1972, pp. 200-213.
4. T. Davidovic, and T.G. Crainic, "Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems," Computers & Operations Research, vol. 33, 2006, pp. 2155-2177.
5. T. Davidovic, Benchmark task graphs available online at http://www.mi.sanu.ac.yu/~tanjad/sched-results.htm.
6. M.D. Dikaiakos, A. Rogers, and K. Steiglitz, "A Comparison of Techniques Used for Mapping Parallel Algorithms to Message-Passing Multiprocessors," Technical Report, Princeton Univ, 1994.
7. A. Gerasoulis, and T. Yang, "A Comparison of Clustering Heuristics for Scheduling Directed Acyclic Graphs on Multiprocessors," J. Parallel and Distributed Computing, vol. 16, 1992, pp. 276-291.
8. R.L. Graham, "Bounds for multiprocessing timing anomalies," SIAM Journal of Applied Mathematics, vol. 17, 1969, pp. 416-419.
9. A. Grama, A. Gupta, G. Karypis, and V. Kumar, "Introduction to Parallel Computing," 2nd edition, Pearson Addison Wesley, London, UK, 2003.
10. C. Hanen, and A. Munier, "An approximation algorithm for scheduling dependent tasks on m processsors with small communication delays," ETFA 95 (INRIA/IEEE Symposium on Emerging Technology and Factory Animation), IEEE Press, 1995, pp. 167-189.
11. T. Hu, "Parallel sequencing and assembly line problems," Operations Research, vol. 9, 1961, pp. 841-848.
12. D. Kadamuddi, and J.J.P. Tsai, "Clustering Algorithm for Parallelizing Software Systems in Multiprocessors Environment," IEEE Transations on Software Engineering, vol. 26, 2000, pp. 340-361.
13. H. Kasahara, and S. Narita, "Practical multiprocessor scheduling algorithms for efficient parallel processing," IEEE Transactions on Computers, vol. 33, 1984, pp. 1023-1029.
14. S.J. Kim, and J.C. Browne, "A General Approach to Mapping of Parallel Computation upon Multiprocessor Architectures," Proc. 1988 Int'l Conf. Parallel Processing, vol. 3, 1998, pp. 1-8.
15. Y.K. Kwok, and I. Ahmad, "Dynamic Critical-Path Scheduling: an Effective Technique for Allocating Task Graphs to Multiprocessors," IEEE Trans. Parallel and Distributed Systems, vol. 7, 1996, pp. 506-521.
16. Y.K. Kwok, and I. Ahmad, "FASTEST: A Practical Low-Complexity Algorithm for Compile-Time Assignment of Parallel Programs to Multiprocessors," IEEE Transactions on Parallel and Distributed Systems, vol. 10, 1999, pp. 147-159.
17. V.M. Lo, "Heuristic Algorithms for Task Assignment in Distributed Systems," IEEE Trans. Computers, vol. 37, 1988, pp. 1384-1397.
18. C.Y. Lee, J.J. Hwang, Y.C. Chow, and F.D. Anger, "Multiprocessor scheduling with interprocessor communication delays," Operations Research Letters, vol. 7, 1988, pp. 141-147.
19. Z. Liu, "A note on Graham's bound," Information Processing Letters, vol. 36, 1990, pp. 1-5.
20. B.A. Malloy, E.L. Lloyd, and M.L. Soffa, "Scheduling DAG's for Asynchronous Multiprocessor Execution," IEEE Trans. Parallel and Distributed Systems, vol. 5, 1994, pp. 498-508.
21. C. Papadimitriou, and M. Yannakakis, "Towards an Architecture Independent Analysis of Parallel Algorithms," SIAM Journal on Computing, vol. 19, 1990, pp. 322-328.
22. V. Sarkar, "Partitioning and Scheduling Parallel Programs for Multiprocessors," Research Monographs in Parallel and Distributed Computing, MIT Press, 1989.
23. O. Sinnen, "Task Scheduling for Parallel Systems," John Wiley & Sons, 2007.
24. G.C. Sih, and E.A. Lee, "A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures," IEEE Transactions on Parallel and Distributed Systems, vol. 4, 1993, pp. 175-187.
25. M. Wolfe, "High Performance Compilers for Parallel Computing," Addison Wesley, 1996.
26. M.Y. Wu, and D.D. Gajski, "Hypertool: A Programming Aid for Message-Passing Systems," IEEE Trans. Parallel and Distributed Systems, vol. 1, 1990, pp. 330-343.
27. M.Y. Wu, W. Shu, and J. Gu, "Efficient Local Search for DAG Scheduling," IEEE Transactions on Parallel and Distributed Systems, vol. 12, 2001, pp. 617-627.
28. T. Yang, and A. Gerasoulis, "A Fast Static Scheduling Algorithm for DAGs on an Unbounded Number of Processors," Proc. Fifth Int'l Conf. Supercomputing, 1991, pp. 633-642.
29. T. Yang, and A. Gerasoulis, "PYRROS: Static Scheduling and Code Generation for Message Passing Multiprocessors," Proc. Sixth Int'l Conf. Supercomputing, July 1992, pp. 428-437.
30. T. Yang, and A. Gerasoulis, "List scheduling with and without communication delays," Parallel Computing, vol. 19, 1993, pp. 1321-1344.