A multilevel partitioning approach for efficient tasks allocation in heterogeneous distributed systems

Journal of Systems Architecture

Volumn 54, Issue 5, 2008, Pages 530-548

  Arafeh, Bassel ^a   Day, Khalid ^a   Touzene, Abderezak ^a  

^a SULTAN QABOOS UNIVERSITY   (Oman)

Author keywords

Heterogeneous computing systems; Mapping problem; Multilevel graph partitioning; Task allocation assignment

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; HEURISTIC ALGORITHMS; PROGRAM PROCESSORS;

HETEROGENEOUS COMPUTING SYSTEMS; MAPPING PROBLEM; MULTILEVEL GRAPH PARTITIONING; TASK ALLOCATION;

RESOURCE ALLOCATION;

EID: 43649091365     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sysarc.2007.10.001     Document Type: Article

References (31)

1. Berman F., Wolski H., Casanova H., et al. Adaptive computing on the Grid using AppLeS. IEEE Transactions Parallel and Distributed Systems 14 4 (2003) 369-382
2. Bokhari S.H. On the mapping problem. IEEE Transactions on Computers 30 3 (1981) 207-214
3. K. Cooper, A. Dasgupta, K. Kennedy, et al., New Grid scheduling and rescheduling methods in the GrADS project, Workshop for Next Generation Software, Santa Fe, New Mexico, April 2004.
4. F. Dong, S.G. Akl, Scheduling algorithms for grid computing: state of the art and open problems, Technical Report No. 2006-504, School of Computing, Queen's University, Kingston, Ontario, January 2006.
5. C.M. Fiduccia, R.M. Mattheyses, A linear time heuristic for improving network partitions, in: Proceedings 19th IEEE Design Automation Conference, 1982, pp. 175-181.
6. Foster I., and Kesselman C. The Grid: Blueprints for a New Computing Infrastructure. second ed. (2004), Elsevier Inc.
7. Garey M., Johnson D., and Stockmeyer L. Some simplified NP-complete graph problems. Theoretical Computer Science 1 (1976) 237-267
8. Gendreau M. An Introduction to Tabu Search. In: Glover F., and Kochenberger G.A. (Eds). Handbook of Metaheuristics (2003), Kluwer Academic Publishers 37-54
9. Glover F., and Laguna M. Tabu Search (1997), Kluwer Academic Publishers, Boston, MA
10. A. Gupta, Fast and effective algorithms for graph partitioning and sparse matrix ordering, IBM Research Report RC 30496 (90799), 1996.
11. B. Hendrickson, R. Leland, The Chaco user's guide, version 2.0, Technical Report SAND-95-2344, Sandia National Labs, Albuquerque, NM, 1995.
12. Hendrickson B., and Kolda T.G. Graph partitioning models for parallel computing. Parallel Computing 26 (2000) 1519-1534
13. Z. Juhasz, S.J. Turner, A new heuristic for process-processor mapping problem, in: Proceedings of Third Austrian-Hungarian Workshop on Distributed and Parallel Systems, DAPSYS, 2000, pp. 91-94.
14. Kafil M., and Ahmed I. Optimal task assignment in heterogeneous distributed computing systems. IEEE Concurrency 6 3 (1998) 42-51
15. G. Karypis, V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, Technical Report 95-035, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1995.
16. Karypis G., and Kumar V. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing 48 1 (1998) 96-129
17. Karypis G., and Kumar V. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 20 1 (1998) 359-392
18. G. Karypis, Multilevel hypergraph partitioning, Technical Report TR 02-025, Department of Computer Science, University of Minnesota, June 2002.
19. Kernighan B.W., and Lin S. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal 49 2 (1970) 291-307
20. Krauter K., Buyya R., and Maheswaran M. A taxonomy and survey of grid resource management systems for distributed computing. Software-Practice and Experience 32 2 (2002) 135-164
21. S. Kumar, S.K. Das, R. Biswas, Graph partitioning for parallel applications in heterogeneous grid environments, Proceedings of the IEEE 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), Fort Lauderdale, Florida, April 15-17, 2002.
22. Ma Y.-C., Chen T.-F., and Chung C.-P. Branch-and-bound task allocation with task clustering-based pruning. Journal of Parallel and Distributed Computing 64 11 (2004) 1223-1240
23. Orduna J.M., Silla F., and Duato J. On the development of a communication-aware task mapping technique. Journal of Systems Architecture 50 4 (2004) 207-220
24. Osman I., and Laporte G. Metaheuristics: a bibliography. Annals of Operations Research 63 (1996) 513-623
25. T. Schnekenburger, M. Huber, Heterogeneous partitioning in a workstation network, Workshop on Heterogeneous Computing, Mexico, April 1994, pp. 72-77.
26. Senar M.A., Ripoll A., Cortes A., and Luque E. Clustering and reassignment-based mapping strategy for message-passing architectures. Journal of Systems Architecture 48 8-10 (2003) 267-283
27. K. Taura, A.A. Chien, Heuristic algorithm for mapping communicating tasks on heterogeneous resources, in: Proceedings of the Ninth Heterogeneous Computing Workshop, HCW 2000, IEEE, Cancun, Mexico, 2000, pp. 102-115.
28. Tom A.P., and Murthy C.S.R. Optimal task allocation in distributed systems by graph matching and state space search. Journal of Systems and Software 46 1 (1999) 59-75
29. Ucar B., Aykanat C., Kaya K., and Ikinci M. Task assignment in heterogeneous computing systems. Journal of Parallel and Distributed Computing 66 1 (2006) 32-46
30. Walshaw C., and Cross M. Mesh partitioning: a multilevel balancing and refinement algorithms. SIAM Journal Scientific Computing 22 (2000) 63-80
31. Walshaw C., and Cross M. Multilevel mesh partitioning for heterogeneous communication networks. Future Generation Computer Systems 17 (2001) 601-623