Design and performance evaluation of combined first-fit task allocation and migration strategies in mesh multiprocessor systems

Parallel Computing

Volumn 34, Issue 9, 2008, Pages 508-520

  Goh, Lee Kee ^a   Veeravalli, Bharadwaj ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

First fit task allocation; Fragmentation reduction; Mesh multiprocessors; Processor allocation; Task migration

Indexed keywords

COMPACTION; STANDARDS;

ALLOCATION STRATEGIES; AND PERFORMANCE EVALUATION; DYNAMIC COMPACTION; FIRST-FIT TASK ALLOCATION; FRAGMENTATION REDUCTION; MESH MULTIPROCESSORS; MIGRATION STRATEGIES; MULTI-PROCESSOR SYSTEMS; PROCESSING TIME; PROCESSOR ALLOCATION; RIGOROUS SIMULATION; TASK ALLOCATION; TASK MIGRATION;

MULTIPROCESSING SYSTEMS;

EID: 50049133184     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2008.03.009     Document Type: Article

References (30)

1. Intel Corp., A Touchstone DELTA System Description, 1991.
2. Intel Corp., Paragon Network Queuing System Manual, 1993.
3. Parallel Workloads Archive, URL: .
4. R. Alverson, D. Callahan, D. Cummings, B. Koblenz, A. Porterfield, B. Smith, The Tera Computer System, Proc. 1990 Int'l Conf. Supercomputing, 1990, pp. 1-6.
5. Chen H.-L., and Tzeng N.-F. On-line task migration in hypercubes through double disjoint paths. IEEE Trans. Computers 46 3 (1997) 379-384
6. Chen M.-S., and Shin K.G. Subcube allocation and task migration in hypercube multiprocessors. IEEE Trans. Computers 39 9 (1990) 1146-1155
7. P.-J. Chuang, N.-F. Tzeng, An efficient submesh allocation strategy for mesh computer systems, Proc. 11th Int'l Conf. Distributed Computing Systems, 1991, pp. 256-263.
8. W.J. Dally, B. Towles, Route packets, Not Wires: On-Chip Interconnection Networks, Proc. 38th Conf. Design Automation, 2001, pp. 684-689.
9. G. de Micheli, L. Benini, Networks on chip: a new paradigm for systems on chip design, Proc. Conf. Design, Automation and Test in Europe, 2002, pp. 418-419.
10. O. Diessel, H. ElGindy, Ordered partial task compaction on mesh connected computers, Technical report TR96-11, Department of Computer Science and Software Engineering, The University of Newcastle, September 1996.
11. J. Ding, L.N. Bhuyan, An adaptive submesh allocation strategy for two-dimensional mesh connected systems, Proc. 1993 Int'l Conf. Parallel Processing, vol. 2, 1993, pp. 193-200.
12. S. Kumar, A. Jantsch, J.-P. Soininen, M. Forsell, M. Millberg, J. Öberg, K. Tiensyrjä, A. Hemani, A network on chip architecture and design methodology, Proc. IEEE Computer Society Annual Symp, VLSI, 2002, pp. 117-124.
13. Li K., and Cheng K.-H. A two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system. J. Parallel Distrib. Comput. 12 1 (1991) 79-83
14. D. Lifka, The ANL/IBM SP scheduling system, Proc. Workshop Job Scheduling Strategies for Parallel Processing, 1995, pp. 295-303.
15. Lo V., Windisch K.J., Liu W., and Nitzberg B. Noncontiguous processor allocation algorithms for mesh-connected multicomputers. IEEE Trans. Parallel Distrib. Syst. 8 7 (1997) 712-726
16. Lublin U., and Feitelson D.G. The workload on parallel supercomputers: modeling the characteristics of rigid jobs. J. Parallel Distrib. Comput. 63 11 (2003) 1105-1122
17. Ni L.M., and McKinley P.K. A survey of wormhole routing techniques in direct networks. IEEE Computer 26 2 (1993) 62-76
18. M.D. Noakes, D.A. Wallach, W.J. Dally, The J-Machine multi-computer: an architectural evaluation, Proc. 20th Int'l Symp. Computer Architecture, 1993, pp. 224-235.
19. D.D. Sharma, D.K. Pradhan, A fast and efficient strategy for submesh allocation in mesh-connected parallel computers, Proc. 5th IEEE Symp. Parallel and Distributed Processing, 1993, pp. 682-689.
20. Tzeng N.-F., and Chen H.-L. Fast compaction in hypercubes. IEEE Trans. Parallel Distrib. Syst. 9 1 (1998) 50-56
21. M. Wan, R. Moore, G. Kremenek, K. Steube, A batch scheduler for the intel paragon with a non-contiguous node allocation algorithm, Proc. Workshop Job Scheduling Strategies for Parallel Processing, 1996, pp. 48-64.
22. N.-C. Wang, T.-S. Chen, Task migration in all-port wormhole-routed 2D mesh multicomputers, Proc. 7th Int'l Symp. Parallel Architectures, Algorithms and Networks, 2004, pp. 123-128.
23. Wu F., Hsu C.-C., and Chou L.-P. Processor allocation in the mesh multiprocessors using the leapfrog method. IEEE Trans. Parallel Distrib. Syst. 14 3 (2003) 276-289
24. Yoo B.S., and Das C.R. Efficient processor management schemes for mesh-connected multicomputers. Parallel Comput. 27 8 (2001) 1057-1078
25. Yoo B.S., and Das C.R. A fast and efficient processor allocation scheme for mesh-connected multicomputers. IEEE Trans. Computers 51 1 (2002) 46-60
26. Yoo S.-M., Choo H., Youn H.-Y., Yu C., and Lee Y. On task relocation in two-dimensional meshes. J. Parallel Distrib. Comput. 60 5 (2000) 616-638
27. Yoo S.-M., Youn H.-Y., and Shirazi B. An efficient task allocation scheme for 2D mesh architectures. IEEE Trans. Parallel Distrib. Syst. 8 9 (1997) 934-942
28. Yu G.-J., Chang C.-Y., and Chen T.-S. Task migration in n-dimensional wormhole-routed mesh multicomputers. J. Syst. Architect. 50 4 (2004) 177-192
29. Zhu Y. Efficient processor allocation strategies for mesh-connected parallel computers. J. Parallel Distrib. Comput. 16 4 (1992) 328-337
30. D. Zotkin, P.J. Keleher, Job-length estimation and performance in backfilling schedulers, Proc. 8th Int'l Symp. High Performance Distributed Computing, 1999, pp. 236-243.