Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules

Applied Mathematical Modelling

Volumn 36, Issue 12, 2012, Pages 6243-6263

  Mishra, Pramod Kumar ^a   Mishra, Abhishek ^b   Mishra, Kamal Sheel ^c   Tripathi, Anil Kumar ^b  

^a BANARAS HINDU UNIVERSITY   (India)

^b BANARAS HINDU UNIVERSITY   (India)

^c Faculty School of Management Sciences   (India)

Author keywords

Benchmarking; Clustering; Distributed computing; Homogeneous systems; Scheduling; Task allocation

Indexed keywords

CLUSTERING; COMMUNICATION LOAD; COMPARISON PARAMETERS; DOMINANT SEQUENCE CLUSTERING; DYNAMIC COMPUTATIONS; DYNAMIC PRIORITY; HOMOGENEOUS SYSTEM; NUMBER OF CLUSTERS; RANDOMIZED ALGORITHMS; STATIC PRIORITY; STATISTICAL PARAMETERS; TASK ALLOCATION; TASK GRAPH;

BENCHMARKING; COMMUNICATION; DISTRIBUTED COMPUTER SYSTEMS; MULTIPROCESSING SYSTEMS; SCHEDULING;

CLUSTERING ALGORITHMS;

EID: 84864966875     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2012.02.011     Document Type: Article

References (35)

1. Sinnen O. Task Scheduling for Parallel Systems 2007, John Wiley and Sons.
2. Sarkar V. Partitioning and scheduling parallel programs for multiprocessors. Research Monographs in Parallel and Distributed Computing 1989, MIT Press.
3. Papadimitriou C.H., Yannakakis M. Towards an architecture-independent analysis of parallel algorithms. SIAM J. Comput. 1990, 19:322-328.
4. Adam T.L., Chandy K.M., Dickson J.R. A comparison of list schedules for parallel processing systems. Commun. ACM 1974, 17:685-690.
5. Coffman E.G., Graham R.L. Optimal scheduling for two-processor systems. Acta Inform. 1972, 1:200-213.
6. Graham R.L. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 1969, 17:416-429.
7. Hu T.C. Parallel sequencing and assembly line problems. Oper. Res. 1961, 9:841-848.
8. Kasahara H., Narita S. Practical multiprocessor scheduling algorithms for efficient parallel processing. IEEE Trans. Comput. 1984, 33:1023-1029.
9. Lee C.Y., Hwang J.J., Chow Y.C., Anger F.D. Multiprocessor scheduling with interprocessor communication delays. Oper. Res. Lett. 1988, 7:141-147.
10. Liu Z. A note on Graham's bound. Inform. Process. Lett. 1990, 36:1-5.
11. Wu M.-Y., Gajski D.D. Hypercool: a programming aid for message-passing systems. IEEE Trans. Parallel Distrib. Syst. 1990, 1:330-343.
12. Yang T., Gerasoulis A. List scheduling with and without communication delays. Parallel Comput. 1993, 19:1321-1344.
13. Mishra P.K., Mishra K.S., Mishra A. A clustering heuristic for multiprocessor environments using computation and communication loads of modules. Int. J. Comput. Sci. Inform. Technol. 2010, 2:170-182.
14. T. Yang, A. Gerasoulis, A fast static scheduling algorithm for DAGs on an unbounded number of processors, in: Proceedings of the 1991 ACM/IEEE Conference on Supercomputing, 1991, pp. 633-642.
15. S.J. Kim, J.C. Browne, A general approach to mapping of parallel computation upon multiprocessor architectures, in: Proceedings of 1988 International Conference on Parallel Processing, 3, 1988, pp. 1-8.
16. Kadamuddi D., Tsai J.J.P. Clustering algorithm for parallelizing software systems in multiprocessors environment. IEEE Trans. Software Eng. 2000, 26:340-361.
17. Hanen C., Munier A. An approximation algorithm for scheduling dependent tasks on m processors with small communication delays. Disc. Appl. Math. 2001, 108:239-257.
18. P.E. Coll, C.C. Ribeiro, C.C. de Sousa, Test instances for scheduling unrelated processors under precedence constraints, 2002, www.ic.uff.br/celso/grupo/readme.ps.
19. Davidovic T., Crainic T.G. Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems. Comput. Oper. Res. 2006, 33:2155-2177.
20. Kwok Y.K., Ahmad I. Benchmarking and comparison of the task graph scheduling algorithms. J. Parallel Distrib. Comput. 1999, 59:381-422.
21. Tobita T., Kasahara H. A standard task graph set for fair evaluation of multiprocessor scheduling algorithms. J. Sched. 2002, 5:379-394.
22. Mishra A., Tripathi A.K. An extension of edge zeroing heuristic for scheduling precedence constrained task graphs on parallel systems using cluster dependent priority scheme. J. Inform. Comput. Sci. 2011, 6:83-96. An extended abstract of this paper appears in the Proceedings of IEEE International Conference on Computer and Communication Technology, 2010, pp. 647-651.
23. Mishra P.K., Mishra K.S., Mishra A. A clustering algorithm for multiprocessor environments using dynamic priority of modules. Ann. Math. Inform. 2011, 38:99-110.
24. P.K. Mishra, K.S. Mishra, A. Mishra, A.K. Tripathi, A randomized scheduling algorithm for multiprocessor environments, submitted for publication.
25. Cox D.R., Hinkley D.V. Theoretical Statistics 1974, Chapman and Hall, London.
26. Freund J.E., Walpole R.E. Mathematical Statistics 4e 1987, Prentice Hall, Englewood Cliffs, NJ.
27. A. Al-Maasarani, Priority-based Scheduling and Evaluation of Precedence Graphs with Communication Times, M.S. thesis, King Fahd University of Petroleum and Minerals, Saudi Arabia, 1993.
28. Al-Mouhamed M.A. Lower bound on the number of processors and time for scheduling precedence graphs with communication costs. IEEE Trans. Software Eng. 1990, 16:1390-1401.
29. Colin J.Y., Chretienne P. C.P.M. scheduling with small computation delays and task duplication. Oper. Res. 1991, 39:680-684.
30. Y.C. Chung, S. Ranka, Application and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributedmemory multiprocessors, in: Proc. Supercomput., 1992, pp. 512-521.
31. T. Davidovic, Benchmark task graphs, http://www.mi.sanu.ac.rs/~tanjad/sched_results.htm.
32. Ibarra O.H., Sohn S.M. On mapping systolic algorithms onto the hypercube. IEEE Trans. Parallel Distrib. Syst. 1990, 1:48-63.
33. Bertsekas D.P., Tsitsiklis J.N. Parallel and Distributed Computation - Numerical Methods. Athena Sci. 1989.
34. Madal S., Sinclair J.B. Performance of synchronous parallel algorithms with regular structures. IEEE Trans. Parallel Distrib. Syst. 1991, 2:105-116.
35. J.P. Kitajima, Modèles Quantitatifs d'Algorithmes Parallèles, Doctorate thesis, Institut National Ploytechnique de Grenoble, 1992.