Submesh allocation in mesh multicomputers using busy-list: A best-fit approach with complete recognition capability

Journal of Parallel and Distributed Computing

Volumn 36, Issue 2, 1996, Pages 106-118

  Das Sharma, Debendra ^a   Pradhan, Dhiraj K ^b  

^a HEWLETT PACKARD COMPANY   (United States)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030210599     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0093     Document Type: Article

References (23)

1. 1. Chuang, P.-J., and Tzeng, N.-F. An efficient submesh allocation strategy for mesh computer systems, Proc. 11th Int'l Conf. on Distributed Computing Systems. 1991, pp. 256-262.
2. 2. Li, K., and Cheng, K. H. A two dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system. Proc. ACM Computer Science Conference. 1990, pp. 22-28.
3. 3. 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 (May 1991), 79-83.
4. 4. Ding, J., and Bhuyan, L. N. An adaptive submesh allocation strategy for two-dimensional mesh connected systems. Proc. 1993 International Conf. on Parallel Processing. Vol. II. 1993, pp. 193-200.
5. 5. Kim, J., Das, C. R., and Lin, W. A top-down processor allocation scheme for hypercube computers. IEEE Trans.Parallel Distrib. Systems 2, 1 (Jan. 1991), 20-30.
6. 6. Das Sharma, D. Space and time scheduling in multicomputers. Ph.D. Dissertation, University of Massachusetts, Amherst, MA, 1995.
7. 7. Das Sharma, D., and Pradhan, D. K. A fast and efficient strategy for submesh allocation in mesh-connected parallel computers. Proc. 5th IEEE Symp. on Parallel and Distributed Processing. 1993 [to appear].
8. 8. Das Sharma, D., and Pradhan, D. K. Submesh allocation in mesh multicomputers. Tech. Rep. 93-043, Dept. of Computer Science, Texas A&M University, 1993.
9. 9. Das Sharma, D., and Pradhan, D. K. A novel approach for SubCube allocation in hypercube multiprocessors. Proc. 4th IEEE Symp. on Parallel and Distributed Processing. 1992, pp. 336-345.
10. 10. Das Sharma, D., and Pradhan, D. K. Fast and efficient strategies for cubic and non-cubic allocation in hypercube multiprocessors. Intl. Conf. on Parallel Processing, Vol. I. 1993, pp. 118-127.
11. 11. Zhu, Y. Efficient processor allocation strategies for mesh-connected parallel computers. J. Parallel Distrib. Comput. 16, 4 (Dec. 1992), 328-337.
12. 12. Intel Corporation. Paragon XP/S Product Overview. 1991.
13. 13. Intel Corporation. A touchstone DELTA system description, 1991.
14. 14. R. Alverson et al. The Tera computer system. Proc. 1990 Int'l Conf. on Supercomputing. 1990, pp. 1-6.
15. 15. Cray Research Inc. MPP Technology Preview. 1992.
16. 16. Zorpette, G. The power of parallelism. IEEE Spectrum (Sept. 1992), 28-33.
17. 17. Kahaner, D. K., and Wattenberg, U. Japan: A competitive assessment. IEEE Spectrum (Sept. 1992), 42-47.
18. 18. Bell, T. E. Beyond today's supercomputers. IEEE Spectrum (Sept. 1992), 72-75.
19. 19. Dutt, S., and Hayes, J. P. On allocating subcubes in a hypercube multiprocessor. Proc. Third Conf. on Hypercube Computers and Applications. 1988, pp. 801-810.
20. 20. Das Sharma, D., and Pradhan, D. K. Job scheduling in hypercube supercomputers. submitted to IEEE Transactions on Parallel and Distributed Systems For publication.
21. 21. Krueger, P., Lai, T.-H., and Radiya, V. A. Processor allocation vs. job scheduling on hypercube computers. Proc. 11th Int'l Conf. on Distributed Computing Systems. 1991, pp. 394-401.
22. 22. Baase, S. Computer Algorithms: Introduction to Design and Analysis. Addision-Wesley, Nov. Reading, MA, 1988.
23. 23. Knowlton, K. C. A fast storage allocator. Comm. ACM 8, 10 (Oct. 1965), 623-625.