File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Optimal layouts of midimew networks

TitleOptimal layouts of midimew networks
Authors
KeywordsDilation
Graph embedding
Interconnection networks
Mesh-connected computers
Midimew networks
Parallel processing
VLSI
Issue Date1996
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, 1996, v. 7 n. 9, p. 954-961 How to Cite?
AbstractMidimew networks [4] are mesh-connected networks derived from a subset of degree-4 circulant graphs. They have minimum diameter and average distance among all degree-4 circulant graphs, and are better than some of the most common topologies for parallel computers in terms of various cost measures. Among the many midimew networks, the rectangular ones appear to be most suitable for practical implementation. Unfortunately, with the normal way of laying out these networks on a 2D plane, long cross wires that grow with the size of the network exist. In this paper, we propose ways to lay out rectangular midimew networks in a 2D grid so that the length of the longest wire is at most a small constant. We prove that these constants are optimal under the assumption that rows and columns are moved as a whole during the layout process. ©1996 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/43634
ISSN
2015 Impact Factor: 2.661
2015 SCImago Journal Rankings: 1.590
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorLau, FCMen_HK
dc.contributor.authorChen, Gen_HK
dc.date.accessioned2007-03-23T04:50:57Z-
dc.date.available2007-03-23T04:50:57Z-
dc.date.issued1996en_HK
dc.identifier.citationIeee Transactions On Parallel And Distributed Systems, 1996, v. 7 n. 9, p. 954-961en_HK
dc.identifier.issn1045-9219en_HK
dc.identifier.urihttp://hdl.handle.net/10722/43634-
dc.description.abstractMidimew networks [4] are mesh-connected networks derived from a subset of degree-4 circulant graphs. They have minimum diameter and average distance among all degree-4 circulant graphs, and are better than some of the most common topologies for parallel computers in terms of various cost measures. Among the many midimew networks, the rectangular ones appear to be most suitable for practical implementation. Unfortunately, with the normal way of laying out these networks on a 2D plane, long cross wires that grow with the size of the network exist. In this paper, we propose ways to lay out rectangular midimew networks in a 2D grid so that the length of the longest wire is at most a small constant. We prove that these constants are optimal under the assumption that rows and columns are moved as a whole during the layout process. ©1996 IEEE.en_HK
dc.format.extent929917 bytes-
dc.format.extent26112 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/msword-
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tpdsen_HK
dc.relation.ispartofIEEE Transactions on Parallel and Distributed Systemsen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©1996 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.subjectDilationen_HK
dc.subjectGraph embeddingen_HK
dc.subjectInterconnection networksen_HK
dc.subjectMesh-connected computersen_HK
dc.subjectMidimew networksen_HK
dc.subjectParallel processingen_HK
dc.subjectVLSIen_HK
dc.titleOptimal layouts of midimew networksen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1045-9219&volume=7&issue=9&spage=954&epage=961&date=1996&atitle=Optimal+layouts+of+midimew+networksen_HK
dc.identifier.emailLau, FCM:fcmlau@cs.hku.hken_HK
dc.identifier.authorityLau, FCM=rp00221en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/71.536939en_HK
dc.identifier.scopuseid_2-s2.0-0030244655en_HK
dc.identifier.hkuros20954-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0030244655&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume7en_HK
dc.identifier.issue9en_HK
dc.identifier.spage954en_HK
dc.identifier.epage961en_HK
dc.identifier.isiWOS:A1996VK15700005-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridLau, FCM=7102749723en_HK
dc.identifier.scopusauthoridChen, G=54679356300en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats