Accelerating Divisible Load Distribution on Tree and Pyramid Networks Using Pipelined Communications

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Keqin Li

18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 13

Santa Fe, New Mexico

April 26-April 30

ISBN: 0-7695-2132-0

	ASCII Text	x
	Keqin Li, "Accelerating Divisible Load Distribution on Tree and Pyramid Networks Using Pipelined Communications," Parallel and Distributed Processing Symposium, International, vol. 14, pp. 228b, 18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 13, 2004.

	BibTex	x
	@article{ 10.1109/IPDPS.2004.1303270, author = {Keqin Li}, title = {Accelerating Divisible Load Distribution on Tree and Pyramid Networks Using Pipelined Communications}, journal ={Parallel and Distributed Processing Symposium, International}, volume = {14}, year = {2004}, isbn = {0-7695-2132-0}, pages = {228b}, doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2004.1303270}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel and Distributed Processing Symposium, International TI - Accelerating Divisible Load Distribution on Tree and Pyramid Networks Using Pipelined Communications SN - 0-7695-2132-0 SP EP A1 - Keqin Li, PY - 2004 KW - Divisible load KW - load distribution KW - performance analysis KW - pipelined communication KW - pyramid KW - speedup KW - tree VL - 14 JA - Parallel and Distributed Processing Symposium, International ER -

Keqin Li, State University of New York at New Paltz

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2004.1303270

We propose two methods which employ pipelined communications to distribute divisible loads on tree and pyramid networks. We derive the closed form solutions to the parallel time and speedup for both methods and show that the asymptotic speedup of both methods is bβ + 1for a complete b-ary tree network and 4bβ + 1 for a pyramid network, where β the ratio of the time for computing a unit load to the time for communicating a unit load.

Index Terms:

Divisible load, load distribution, performance analysis, pipelined communication, pyramid, speedup, tree

Citation:

Keqin Li, "Accelerating Divisible Load Distribution on Tree and Pyramid Networks Using Pipelined Communications," ipdps, vol. 14, pp.228b, 18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 13, 2004

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.