Randomized load distribution of arbitrary trees in distributed networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Randomized load distribution of arbitrary trees in distributed networks

Full text

Pdf (458 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1998 ACM symposium on Applied Computing table of contents

Atlanta, Georgia, United States

Pages: 564 - 568

Year of Publication: 1998

ISBN:0-89791-969-6

Authors

Jaafar Gaber	L.I.F.L., Université des Sciences et Technologies de Lillel, 59655 Villeneuve d'Ascq cedex -France
Bernard Toursel	L.I.F.L., Université des Sciences et Technologies de Lillel, 59655 Villeneuve d'Ascq cedex -France

Sponsors

SIGADA: ACM Special Interest Group on Ada Programming Language
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGAPP: ACM Special Interest Group on Applied Computing
SIGBIO: ACM Special Interest Group on Biomedical Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 11, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

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/330560.330936 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	F. Thomson Leighton, Introduction to parallel algorithms and architectures: array, trees, hypercubes, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1991
	2	A. S. Wagner, Embedding all binary trees in the hypercube, Journal of Parallel and Distributed Computing, v.18 n.1, p.33-43, May 1993 [doi>10.1006/jpdc.1993.1042]
	3	S. BHATT, F. CHUNG, T. LEIGHTON, and A. ROSEN- BERG. Optimal simulations of tree machines. In g7th Annual Symposuim on Foundations of Computer Science, pp. ~7d-28~, IEEE, October, 1986.
	4	Saïd Bettayeb , Priyalal Kulasinghe, Embedding Binary Trees into Crossed Cubes, IEEE Transactions on Computers, v.44 n.7, p.923-929, July 1995 [doi>10.1109/12.392850]
	5	J. Gaber , B. Toursel , G. Goncalves , T. Hsu, Embedding tree structures in massively parallel computers, Proceedings of the 1995 ACM symposium on Applied computing, p.210-214, February 26-28, 1995, Nashville, Tennessee, United States [doi>10.1145/315891.315963]
	6	J. Gaber , B. Toursel , G. Goncalves , T. Hsu, Embedding trees in massively parallel computers, Journal of Systems Architecture: the EUROMICRO Journal, v.42 n.3, p.165-170, Oct. 1, 1996 [doi>10.1016/1383-7621(96)88853-9]
	7	M.Jiber and A.Bellaachia. Embedding quadtree structures on x-mesh networks. Proc. l Oth Annual International Symposium on High Performance Computers, Ottawa, Canada (5-7), June, 1996.
	8	J.Gaber and B.Toursel. An optimization of data movement operations : Application to the treeembedding problem. 5nd Euromicro Int. Workshop on Parallel and Distributed Processing PDP'97, Published by IEEE Computer Society, London, UK, January 1997.
	9	S.N. BHATT and J.-Y. Cal. talk a walk, grow a tree. in Proc. ~gth Annual {EEE $ymposuim on Foundations of Computer, Science, IEEE CS, Washington, De, pp. g 69-,~ 78, 1988.
	10	Sandeep Bhatt , Jin-Yi Cai, Taking random walks to grow trees in hypercubes, Journal of the ACM (JACM), v.40 n.3, p.741-764, July 1993 [doi>10.1145/174130.174144]
	11	F. T. Leighton , Mark J. Newman , Abhiram G. Ranade , Eric J. Schwabe, Dynamic tree embeddings in butterflies and hypercubes, SIAM Journal on Computing, v.21 n.4, p.639-654, Aug. 1992 [doi>10.1137/0221039]
	12	K. LI. Analysis of randomized load distribution for reproduction trees in linear arrays and tings. Proc. llth Annual International Symposium on High Performance Computers, Winnipeg, Manitoba, Canada (i O- I ~), July, 1997.
	13	S. KAm. IN and H-M. T^YLOa. A first course in stochastic processes. Academic Press Inc., 1975.
	14	G. Cybenko, Dynamic load balancing for distributed memory multiprocessors, Journal of Parallel and Distributed Computing, v.7 n.2, p.279-301, October 1989 [doi>10.1016/0743-7315(89)90021-X]

CITED BY 3

	Keqin Li, On the performance of randomized embedding of reproduction trees in static networks, International Journal of Parallel Programming, v.31 n.5, p.393-406, October 2003
	Keqin Li, Analysis of randomized load distribution for reproduction trees in linear arrays and rings, Theoretical Computer Science, v.321 n.2-3, p.195-214, 16 August 2004
	Keqin Li, Design and analysis of asymptotically optimal randomized tree embedding algorithms in static networks, Performance Evaluation, v.60 n.1-4, p.141-163, May 2005