Seeds for a heterogeneous interconnect

DC FieldValueLanguage
dc.contributor.authorHackett, Adam-
dc.contributor.authorAjwani, Deepak-
dc.contributor.authorAli, Shoukat-
dc.contributor.authorKirkland, Steve-
dc.contributor.authorMorrison, John P.- IEEEen_US
dc.descriptionIPDPS 2013: IEEE Workshops & PhD Forum (IPDPSW), Boston (MA), USA, 20-24 May 2013en_US
dc.description.abstractTraditionally, a parallel application is partitioned, mapped and then routed on a network of compute nodes where the topology of the interconnection network is known beforehand and is homogeneous. However, such homogeneity in interconnects is rarely required or needed for several important classes of applications. Nevertheless such interconnects are designed this way, i.e., with redundant links, to accommodate the communication patterns of a wide range of applications. However, with recent advances in technology for optical circuit switches, it is now possible to construct network with much fewer links, and to make the link endpoints configurable to suit the communication pattern of a given application. While this is economical (saving both links and the power to run them), it raises the difficult problem of how to configure the network and how to reconfigure it quickly when the application's communication pattern changes. Since the space of all configurable topologies is large and determining the quality of a topology is a time-consuming process, it is not feasible to explore the entire space. One way of dealing with this limitation is to start the search from a "good" initial topology and then conduct a restricted search around it. The success of such a strategy crucially depends on the choice of the initial or seed topology. In the past, such an initial topology was computed by mimicking the communication requirements of the application. In this paper, we propose a different approach by showing that interconnect topologies such as chordal rings(circulant graphs) chosen based on metrics such as bisection width and average shortest path length can provide a better starting point. The topology obtained by searching around such an initial topology provides almost as good a performance as an application-specific initial topology, and the search time is significantly reduced.en_US
dc.relation.ispartofProceedings - IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013en_US
dc.rights© 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.en_US
dc.subjectNetwork topologyen_US
dc.subjectOptical switchesen_US
dc.subjectIntegrated circuit interconnectionsen_US
dc.titleSeeds for a heterogeneous interconnecten_US
dc.typeConference Publicationen_US
dc.statusNot peer revieweden_US
dc.neeo.contributorMorrison|John P.|aut|-
item.fulltextWith Fulltext-
Appears in Collections:Computer Science Research Collection
Files in This Item:
File Description SizeFormat 
ajwani_hcw13.pdf525.57 kBAdobe PDFDownload
Show simple item record

Citations 50

Last Week
Last month
checked on Jan 18, 2020

Page view(s)

Last Week
Last month
checked on Jan 24, 2020


checked on Jan 24, 2020

Google ScholarTM



This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.