A new “quad-tree-based” sub-system allocation technique for mesh-connected parallel machines

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A new “quad-tree-based” sub-system allocation technique for mesh-connected parallel machines

Full text

Pdf (1.22 MB)

Source

International Conference on Supercomputing archive
Proceedings of the 13th international conference on Supercomputing table of contents

Rhodes, Greece

Pages: 60 - 67

Year of Publication: 1999

ISBN:1-58113-164-X

Authors

Jeeraporn Srisawat	Department of Electrical Engineering and Computer Science, The George Washington University, Washington, DC
Nikitas A. Alexandridis	Department of Electrical Engineering and Computer Science, The George Washington University, Washington, DC

Sponsor

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 13, Citation Count: 0

Additional Information:

references index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/305138.305160 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Robert Alverson , David Callahan , Daniel Cummings , Brian Koblenz , Allan Porterfield , Burton Smith, The Tera computer system, Proceedings of the 4th international conference on Supercomputing, p.1-6, June 11-15, 1990, Amsterdam, The Netherlands
	2	Chuang, P.J. and N.F. Tzeng, An Efficient Submesh Allocation Strategy for Mesh Computer Systems. Proc. Int'l Conf. on Distributed Computing Systems, May 1991,256-263.
	3	P. J. Chuang , N. F. Tzeng, Allocating Precise Submeshes in Mesh Connected Systems, IEEE Transactions on Parallel and Distributed Systems, v.5 n.2, p.211-217, February 1994 [doi>10.1109/71.265948]
	4	Das Sharma,D. and D.K. Pradhan, A Fast and Efficient Strategy for Submesh Allocation in Mesh-Connected Parallel Computers. IEEE Symp. Parallel and Distributed Processing, 1993,682~689.
	5	Debendra Das Sharma , Dhiraj K. Pradhan, Submesh allocation in mesh multicomputers using busy-list: a best-fit approach with complete recognition capability, Journal of Parallel and Distributed Computing, v.36 n.2, p.106-118, Aug. 1, 1996 [doi>10.1006/jpdc.1996.0093]
	6	Ding, 1. and L.N. Bhuyan, An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems. Proc. 1993 Int'l Conf. on Parallel Processing, vol. II, 1993,193-200.
	7	Intel, A Touchstone DELTA System Description. Supercomputer Systems Division, Intel Corporation, Beaverton, OR 97006, 1991.
	8	Intel, Paragon XP/S Product Overview. Supercomputer Systems Division, Intel Corporation, Beaverton, OR 97006, 1991.
	9	Geunmo Kim , Hyunsoo Yoon, On Submesh Allocation for Mesh Multicomputers: A Best-Fit Allocation and a Virtual Submesh Allocation for Faulty Meshes, IEEE Transactions on Parallel and Distributed Systems, v.9 n.2, p.175-185, February 1998 [doi>10.1109/71.663881]
	10	K. Li , K. H. Cheng, Job Scheduling in a Partitionable Mesh Using a Two-Dimensional Buddy System Partitioning Scheme, IEEE Transactions on Parallel and Distributed Systems, v.2 n.4, p.413-422, October 1991 [doi>10.1109/71.97898]
	11	Keqin Li , Kam-Hoi Cheng, A two-dimensional buddy systems for dynamic resource allocation in a partitionable mesh connected system, Journal of Parallel and Distributed Computing, v.12 n.1, p.79-83, May 1991 [doi>10.1016/0743-7315(91)90032-5]
	12	Liu, T. and et. al. A Submesh Allocation Scheme for Mesh- Connected Multiprocessor Systems. Proc. 1995 Int'l Conf. Parallel Processing, vol. II, 1995, i59-163.
	13	Mattson et al. Intel/Sandia ASCI system. Proc. of the 10~h Int'l Parallel Processing Symp., 1996.
	14	Prasant Mohapatra, Processor allocation using partitioning in mesh connected parallel computers, Journal of Parallel and Distributed Computing, v.39 n.2, p.181-190, Dec. 15, 1996 [doi>10.1006/jpdc.1996.0165]
	15	Srisawat, J. and N. A. Alexandridis, Efficient Processor Allocation Scheme with Task Embedding for Partitionable Mesh Architectures. The 11a~ Intl. Conf. on Computer Applications in industry and Engineering 98, Las Vegas, November 11 - 13, 1998, 309-312.
	16	Srisawat, J. and N. A. Alexandridis, Reducing System Fragmentation in Dynamically Partitionable Mesh-Connected Architectures. lnt'l Confi on Parallel and Distributed Computing and Networks, Australia, December 14-16, 1998, 241-244.
	17	Seong-Moo Yoo , Hee Yong Youn , Behrooz Shirazi, An Efficient Task Allocation Scheme for 2D Mesh Architectures, IEEE Transactions on Parallel and Distributed Systems, v.8 n.9, p.934-942, September 1997 [doi>10.1109/71.615439]
	18	Zhu, Y. Efficient Processor Allocation Strategies for Mesh- Connected Parallel Computers. J. of Parallel and Distributed Computing, v. 16, 1992, 328-337.