A general methodology of partitioning and mapping for given regular arrays
A methodology for partitioning and mapping of arbitrary uniform recurrence equations (UREs) expressed as computation graphs onto a given regular array is proposed. Deriving and based on a set of canonical dependencies together with two models of space projection, we give a general method of parallel...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on parallel and distributed systems 1995-10, Vol.6 (10), p.1100-1107 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1107 |
|---|---|
| container_issue | 10 |
| container_start_page | 1100 |
| container_title | IEEE transactions on parallel and distributed systems |
| container_volume | 6 |
| creator | Xian Chen Megson, G.M. |
| description | A methodology for partitioning and mapping of arbitrary uniform recurrence equations (UREs) expressed as computation graphs onto a given regular array is proposed. Deriving and based on a set of canonical dependencies together with two models of space projection, we give a general method of parallelization. The method has significant advantages in mapping an arbitrary computation graph onto a given processor array while preserving high efficiency in both communication and computation.< > |
| doi_str_mv | 10.1109/71.473518 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_71_473518</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>473518</ieee_id><sourcerecordid>28287842</sourcerecordid><originalsourceid>FETCH-LOGICAL-c277t-d4194f5d3a5b7c5f91deef34c05e2cbe647a2ecfa249a44311c0bcf793589dd73</originalsourceid><addsrcrecordid>eNo90L1PwzAQBXALgUQpDKxMnpAYUnyOjeOxqvhUJRaYLdc-h6AkDnaK1P-eVqmY7kn30xseIdfAFgBM3ytYCFVKqE7IDKSsCg5VebrPTMhCc9Dn5CLnb8ZASCZm5G1Ja-wx2ZZ2OH5FH9tY72gMdLBpbMYm9k1fU9t72tlhOOQQE62bX-xpwnrb2kRtSnaXL8lZsG3Gq-Odk8-nx4_VS7F-f35dLdeF40qNhRegRZC-tHKjnAwaPGIohWMSudvgg1CWowuWC22FKAEc27igdCkr7b0q5-R26h1S_NliHk3XZIdta3uM22x4xStVCb6HdxN0KeacMJghNZ1NOwPMHNYyCsy01t7eTLZBxH93fP4BGRFllg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28287842</pqid></control><display><type>article</type><title>A general methodology of partitioning and mapping for given regular arrays</title><source>IEEE Electronic Library (IEL)</source><creator>Xian Chen ; Megson, G.M.</creator><creatorcontrib>Xian Chen ; Megson, G.M.</creatorcontrib><description>A methodology for partitioning and mapping of arbitrary uniform recurrence equations (UREs) expressed as computation graphs onto a given regular array is proposed. Deriving and based on a set of canonical dependencies together with two models of space projection, we give a general method of parallelization. The method has significant advantages in mapping an arbitrary computation graph onto a given processor array while preserving high efficiency in both communication and computation.< ></description><identifier>ISSN: 1045-9219</identifier><identifier>EISSN: 1558-2183</identifier><identifier>DOI: 10.1109/71.473518</identifier><identifier>CODEN: ITDSEO</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computer architecture ; Computer science ; Concurrent computing ; Difference equations ; Processor scheduling ; Topology</subject><ispartof>IEEE transactions on parallel and distributed systems, 1995-10, Vol.6 (10), p.1100-1107</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c277t-d4194f5d3a5b7c5f91deef34c05e2cbe647a2ecfa249a44311c0bcf793589dd73</citedby><cites>FETCH-LOGICAL-c277t-d4194f5d3a5b7c5f91deef34c05e2cbe647a2ecfa249a44311c0bcf793589dd73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/473518$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>315,782,786,798,27931,27932,54765</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/473518$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Xian Chen</creatorcontrib><creatorcontrib>Megson, G.M.</creatorcontrib><title>A general methodology of partitioning and mapping for given regular arrays</title><title>IEEE transactions on parallel and distributed systems</title><addtitle>TPDS</addtitle><description>A methodology for partitioning and mapping of arbitrary uniform recurrence equations (UREs) expressed as computation graphs onto a given regular array is proposed. Deriving and based on a set of canonical dependencies together with two models of space projection, we give a general method of parallelization. The method has significant advantages in mapping an arbitrary computation graph onto a given processor array while preserving high efficiency in both communication and computation.< ></description><subject>Computer architecture</subject><subject>Computer science</subject><subject>Concurrent computing</subject><subject>Difference equations</subject><subject>Processor scheduling</subject><subject>Topology</subject><issn>1045-9219</issn><issn>1558-2183</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1995</creationdate><recordtype>article</recordtype><recordid>eNo90L1PwzAQBXALgUQpDKxMnpAYUnyOjeOxqvhUJRaYLdc-h6AkDnaK1P-eVqmY7kn30xseIdfAFgBM3ytYCFVKqE7IDKSsCg5VebrPTMhCc9Dn5CLnb8ZASCZm5G1Ja-wx2ZZ2OH5FH9tY72gMdLBpbMYm9k1fU9t72tlhOOQQE62bX-xpwnrb2kRtSnaXL8lZsG3Gq-Odk8-nx4_VS7F-f35dLdeF40qNhRegRZC-tHKjnAwaPGIohWMSudvgg1CWowuWC22FKAEc27igdCkr7b0q5-R26h1S_NliHk3XZIdta3uM22x4xStVCb6HdxN0KeacMJghNZ1NOwPMHNYyCsy01t7eTLZBxH93fP4BGRFllg</recordid><startdate>19951001</startdate><enddate>19951001</enddate><creator>Xian Chen</creator><creator>Megson, G.M.</creator><general>IEEE</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19951001</creationdate><title>A general methodology of partitioning and mapping for given regular arrays</title><author>Xian Chen ; Megson, G.M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c277t-d4194f5d3a5b7c5f91deef34c05e2cbe647a2ecfa249a44311c0bcf793589dd73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1995</creationdate><topic>Computer architecture</topic><topic>Computer science</topic><topic>Concurrent computing</topic><topic>Difference equations</topic><topic>Processor scheduling</topic><topic>Topology</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Xian Chen</creatorcontrib><creatorcontrib>Megson, G.M.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on parallel and distributed systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Xian Chen</au><au>Megson, G.M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A general methodology of partitioning and mapping for given regular arrays</atitle><jtitle>IEEE transactions on parallel and distributed systems</jtitle><stitle>TPDS</stitle><date>1995-10-01</date><risdate>1995</risdate><volume>6</volume><issue>10</issue><spage>1100</spage><epage>1107</epage><pages>1100-1107</pages><issn>1045-9219</issn><eissn>1558-2183</eissn><coden>ITDSEO</coden><abstract>A methodology for partitioning and mapping of arbitrary uniform recurrence equations (UREs) expressed as computation graphs onto a given regular array is proposed. Deriving and based on a set of canonical dependencies together with two models of space projection, we give a general method of parallelization. The method has significant advantages in mapping an arbitrary computation graph onto a given processor array while preserving high efficiency in both communication and computation.< ></abstract><pub>IEEE</pub><doi>10.1109/71.473518</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1045-9219 |
| ispartof | IEEE transactions on parallel and distributed systems, 1995-10, Vol.6 (10), p.1100-1107 |
| issn | 1045-9219 1558-2183 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_71_473518 |
| source | IEEE Electronic Library (IEL) |
| subjects | Computer architecture Computer science Concurrent computing Difference equations Processor scheduling Topology |
| title | A general methodology of partitioning and mapping for given regular arrays |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-04T06%3A10%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20general%20methodology%20of%20partitioning%20and%20mapping%20for%20given%20regular%20arrays&rft.jtitle=IEEE%20transactions%20on%20parallel%20and%20distributed%20systems&rft.au=Xian%20Chen&rft.date=1995-10-01&rft.volume=6&rft.issue=10&rft.spage=1100&rft.epage=1107&rft.pages=1100-1107&rft.issn=1045-9219&rft.eissn=1558-2183&rft.coden=ITDSEO&rft_id=info:doi/10.1109/71.473518&rft_dat=%3Cproquest_RIE%3E28287842%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=28287842&rft_id=info:pmid/&rft_ieee_id=473518&rfr_iscdi=true |