File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Parallel algorithm for an efficient mapping of grids in hypercubes

TitleParallel algorithm for an efficient mapping of grids in hypercubes
Authors
Issue Date1993
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tpds
Citation
Ieee Transactions On Parallel And Distributed Systems, 1993, v. 4 n. 8, p. 933-946 How to Cite?
AbstractThis paper parallelizes the embedding strategy for mapping any two-dimensional grid into its optimal hypercube with minimal dilation. The parallelization allows each hypercube node to independently determine, in constant time, which grid node it will simulate and the communication paths it will take to reach the hypercube nodes which simulate its grid-neighbors. The paths between grid-neighbors are chosen in such a way as to curb the congestion at each hypercube node and across each hypercube edge. Explicity, the node congestion for our embedding is at most, 6 (one above optimal), while the edge congestion is at most 5.
Persistent Identifierhttp://hdl.handle.net/10722/152240
ISSN
2015 Impact Factor: 2.661
2015 SCImago Journal Rankings: 1.590
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorChan, MYen_US
dc.contributor.authorChin, Francisen_US
dc.date.accessioned2012-06-26T06:36:42Z-
dc.date.available2012-06-26T06:36:42Z-
dc.date.issued1993en_US
dc.identifier.citationIeee Transactions On Parallel And Distributed Systems, 1993, v. 4 n. 8, p. 933-946en_US
dc.identifier.issn1045-9219en_US
dc.identifier.urihttp://hdl.handle.net/10722/152240-
dc.description.abstractThis paper parallelizes the embedding strategy for mapping any two-dimensional grid into its optimal hypercube with minimal dilation. The parallelization allows each hypercube node to independently determine, in constant time, which grid node it will simulate and the communication paths it will take to reach the hypercube nodes which simulate its grid-neighbors. The paths between grid-neighbors are chosen in such a way as to curb the congestion at each hypercube node and across each hypercube edge. Explicity, the node congestion for our embedding is at most, 6 (one above optimal), while the edge congestion is at most 5.en_US
dc.languageengen_US
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tpdsen_US
dc.relation.ispartofIEEE Transactions on Parallel and Distributed Systemsen_US
dc.titleParallel algorithm for an efficient mapping of grids in hypercubesen_US
dc.typeArticleen_US
dc.identifier.emailChin, Francis:chin@cs.hku.hken_US
dc.identifier.authorityChin, Francis=rp00105en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/71.238627en_US
dc.identifier.scopuseid_2-s2.0-0027649940en_US
dc.identifier.volume4en_US
dc.identifier.issue8en_US
dc.identifier.spage933en_US
dc.identifier.epage946en_US
dc.identifier.isiWOS:A1993ME61100008-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChan, MY=7402597863en_US
dc.identifier.scopusauthoridChin, Francis=7005101915en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats