File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/71.238627
- Scopus: eid_2-s2.0-0027649940
- WOS: WOS:A1993ME61100008
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Parallel algorithm for an efficient mapping of grids in hypercubes
| Title | Parallel algorithm for an efficient mapping of grids in hypercubes |
|---|---|
| Authors | |
| Issue Date | 1993 |
| Publisher | I 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? |
| Abstract | This 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 Identifier | http://hdl.handle.net/10722/152240 |
| ISSN | 2023 Impact Factor: 5.6 2023 SCImago Journal Rankings: 2.340 |
| ISI Accession Number ID |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chan, MY | en_US |
| dc.contributor.author | Chin, Francis | en_US |
| dc.date.accessioned | 2012-06-26T06:36:42Z | - |
| dc.date.available | 2012-06-26T06:36:42Z | - |
| dc.date.issued | 1993 | en_US |
| dc.identifier.citation | Ieee Transactions On Parallel And Distributed Systems, 1993, v. 4 n. 8, p. 933-946 | en_US |
| dc.identifier.issn | 1045-9219 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10722/152240 | - |
| dc.description.abstract | This 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.language | eng | en_US |
| dc.publisher | I E E E. The Journal's web site is located at http://www.computer.org/tpds | en_US |
| dc.relation.ispartof | IEEE Transactions on Parallel and Distributed Systems | en_US |
| dc.title | Parallel algorithm for an efficient mapping of grids in hypercubes | en_US |
| dc.type | Article | en_US |
| dc.identifier.email | Chin, Francis:chin@cs.hku.hk | en_US |
| dc.identifier.authority | Chin, Francis=rp00105 | en_US |
| dc.description.nature | link_to_subscribed_fulltext | en_US |
| dc.identifier.doi | 10.1109/71.238627 | en_US |
| dc.identifier.scopus | eid_2-s2.0-0027649940 | en_US |
| dc.identifier.volume | 4 | en_US |
| dc.identifier.issue | 8 | en_US |
| dc.identifier.spage | 933 | en_US |
| dc.identifier.epage | 946 | en_US |
| dc.identifier.isi | WOS:A1993ME61100008 | - |
| dc.publisher.place | United States | en_US |
| dc.identifier.scopusauthorid | Chan, MY=7402597863 | en_US |
| dc.identifier.scopusauthorid | Chin, Francis=7005101915 | en_US |
| dc.identifier.issnl | 1045-9219 | - |