Scheduling Collective Communications on Wormhole Fat Cubes

	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
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Vaclav Dvorak

17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'05)

Rio de Janeiro, Brazil

October 24-October 27

ISBN: 0-7695-2446-X

	ASCII Text	x
	Vaclav Dvorak, "Scheduling Collective Communications on Wormhole Fat Cubes," Computer Architecture and High Performance Computing, Symposium on, pp. 27-34, 17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'05), 2005.

	BibTex	x
	@article{ 10.1109/CAHPC.2005.39, author = {Vaclav Dvorak}, title = {Scheduling Collective Communications on Wormhole Fat Cubes}, journal ={Computer Architecture and High Performance Computing, Symposium on}, volume = {0}, year = {2005}, issn = {1550-6533}, pages = {27-34}, doi = {http://doi.ieeecomputersociety.org/10.1109/CAHPC.2005.39}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computer Architecture and High Performance Computing, Symposium on TI - Scheduling Collective Communications on Wormhole Fat Cubes SN - 1550-6533 SP27 EP34 A1 - Vaclav Dvorak, PY - 2005 KW - null VL - 0 JA - Computer Architecture and High Performance Computing, Symposium on ER -

Vaclav Dvorak, Brno University of Technology

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CAHPC.2005.39

A recent renewed interest in hypercube interconnection network has been concentrated to the more scalable and mostly cheaper version known as a fat cube. This paper generalizes the known results on time complexity of collective communications on a hypercube for the wormhole fat cube. Examples of particular communication algorithms on the 2D-fat cube topology with 8 processors are summarized and given in detail. The performed study shows that a large variety of fat cubes can provide lower cost, better scalability and manufacturability without compromising communication performance.

Citation:

Vaclav Dvorak, "Scheduling Collective Communications on Wormhole Fat Cubes," sbac-pad, pp.27-34, 17th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'05), 2005

Peer Review Notice | Give Us Feedback

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