An efficient submesh allocation strategy for mesh computer systems
A processor allocation strategy is proposed which can apply to any mesh system and recognize submeshes with arbitrary sizes at any location in a mesh system. The proposed strategy allocates a submesh of exactly the size requested by an incoming task, completely avoiding internal fragmentation. Becau...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 263 |
|---|---|
| container_issue | |
| container_start_page | 256 |
| container_title | |
| container_volume | |
| creator | Chuang, P.-J. Tzeng, N.-F. |
| description | A processor allocation strategy is proposed which can apply to any mesh system and recognize submeshes with arbitrary sizes at any location in a mesh system. The proposed strategy allocates a submesh of exactly the size requested by an incoming task, completely avoiding internal fragmentation. Because of its efficient allocation, this strategy exhibits better performance than an earlier allocation strategy based on the buddy principle. An efficient implementation of this strategy is presented. Extensive simulation runs were carried out to collect experimental performance measures of interest under different allocation schemes for comparison.< > |
| doi_str_mv | 10.1109/ICDCS.1991.148674 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_148674</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>148674</ieee_id><sourcerecordid>148674</sourcerecordid><originalsourceid>FETCH-LOGICAL-c220t-9b6f60a649530030fb14f9d0abd24fc82a162895d8a0d2f60e29fb0d3cd20f293</originalsourceid><addsrcrecordid>eNotj8tOwzAURC0hJKD0A2DlH0i499ox9rKEV6VKLFrWleMHBOVRxe4if09Fmc0szuhIw9gdQokI5mFdP9fbEo3BEqVWj_KC3YBGrQilFFdsmdIPnFJVmgiv2dNq4CHG1rVhyDwdmz6kb267bnQ2t-PAU55sDl8zj-PE_6Ab-8Mxh4mnOeXQp1t2GW2XwvK_F-zz9WVXvxebj7d1vdoUjghyYRoVFVglTSUABMQGZTQebONJRqfJoiJtKq8teDpNA5nYgBfOE0QyYsHuz942hLA_TG1vp3l_fil-AZlxSLU</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>An efficient submesh allocation strategy for mesh computer systems</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Chuang, P.-J. ; Tzeng, N.-F.</creator><creatorcontrib>Chuang, P.-J. ; Tzeng, N.-F.</creatorcontrib><description>A processor allocation strategy is proposed which can apply to any mesh system and recognize submeshes with arbitrary sizes at any location in a mesh system. The proposed strategy allocates a submesh of exactly the size requested by an incoming task, completely avoiding internal fragmentation. Because of its efficient allocation, this strategy exhibits better performance than an earlier allocation strategy based on the buddy principle. An efficient implementation of this strategy is presented. Extensive simulation runs were carried out to collect experimental performance measures of interest under different allocation schemes for comparison.< ></description><identifier>ISBN: 0818621443</identifier><identifier>ISBN: 9780818621444</identifier><identifier>DOI: 10.1109/ICDCS.1991.148674</identifier><language>eng</language><publisher>IEEE Comput. Soc. Press</publisher><subject>Costs ; Delay ; Memory management ; Parallel architectures ; Power system management ; Prototypes ; Resource management ; Supercomputers ; Topology ; Very large scale integration</subject><ispartof>[1991] Proceedings. 11th International Conference on Distributed Computing Systems, 1991, p.256-263</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c220t-9b6f60a649530030fb14f9d0abd24fc82a162895d8a0d2f60e29fb0d3cd20f293</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/148674$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,4048,4049,27923,54918</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/148674$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Chuang, P.-J.</creatorcontrib><creatorcontrib>Tzeng, N.-F.</creatorcontrib><title>An efficient submesh allocation strategy for mesh computer systems</title><title>[1991] Proceedings. 11th International Conference on Distributed Computing Systems</title><addtitle>ICDCS</addtitle><description>A processor allocation strategy is proposed which can apply to any mesh system and recognize submeshes with arbitrary sizes at any location in a mesh system. The proposed strategy allocates a submesh of exactly the size requested by an incoming task, completely avoiding internal fragmentation. Because of its efficient allocation, this strategy exhibits better performance than an earlier allocation strategy based on the buddy principle. An efficient implementation of this strategy is presented. Extensive simulation runs were carried out to collect experimental performance measures of interest under different allocation schemes for comparison.< ></description><subject>Costs</subject><subject>Delay</subject><subject>Memory management</subject><subject>Parallel architectures</subject><subject>Power system management</subject><subject>Prototypes</subject><subject>Resource management</subject><subject>Supercomputers</subject><subject>Topology</subject><subject>Very large scale integration</subject><isbn>0818621443</isbn><isbn>9780818621444</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1991</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj8tOwzAURC0hJKD0A2DlH0i499ox9rKEV6VKLFrWleMHBOVRxe4if09Fmc0szuhIw9gdQokI5mFdP9fbEo3BEqVWj_KC3YBGrQilFFdsmdIPnFJVmgiv2dNq4CHG1rVhyDwdmz6kb267bnQ2t-PAU55sDl8zj-PE_6Ab-8Mxh4mnOeXQp1t2GW2XwvK_F-zz9WVXvxebj7d1vdoUjghyYRoVFVglTSUABMQGZTQebONJRqfJoiJtKq8teDpNA5nYgBfOE0QyYsHuz942hLA_TG1vp3l_fil-AZlxSLU</recordid><startdate>1991</startdate><enddate>1991</enddate><creator>Chuang, P.-J.</creator><creator>Tzeng, N.-F.</creator><general>IEEE Comput. Soc. Press</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1991</creationdate><title>An efficient submesh allocation strategy for mesh computer systems</title><author>Chuang, P.-J. ; Tzeng, N.-F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c220t-9b6f60a649530030fb14f9d0abd24fc82a162895d8a0d2f60e29fb0d3cd20f293</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1991</creationdate><topic>Costs</topic><topic>Delay</topic><topic>Memory management</topic><topic>Parallel architectures</topic><topic>Power system management</topic><topic>Prototypes</topic><topic>Resource management</topic><topic>Supercomputers</topic><topic>Topology</topic><topic>Very large scale integration</topic><toplevel>online_resources</toplevel><creatorcontrib>Chuang, P.-J.</creatorcontrib><creatorcontrib>Tzeng, N.-F.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chuang, P.-J.</au><au>Tzeng, N.-F.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>An efficient submesh allocation strategy for mesh computer systems</atitle><btitle>[1991] Proceedings. 11th International Conference on Distributed Computing Systems</btitle><stitle>ICDCS</stitle><date>1991</date><risdate>1991</risdate><spage>256</spage><epage>263</epage><pages>256-263</pages><isbn>0818621443</isbn><isbn>9780818621444</isbn><abstract>A processor allocation strategy is proposed which can apply to any mesh system and recognize submeshes with arbitrary sizes at any location in a mesh system. The proposed strategy allocates a submesh of exactly the size requested by an incoming task, completely avoiding internal fragmentation. Because of its efficient allocation, this strategy exhibits better performance than an earlier allocation strategy based on the buddy principle. An efficient implementation of this strategy is presented. Extensive simulation runs were carried out to collect experimental performance measures of interest under different allocation schemes for comparison.< ></abstract><pub>IEEE Comput. Soc. Press</pub><doi>10.1109/ICDCS.1991.148674</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 0818621443 |
| ispartof | [1991] Proceedings. 11th International Conference on Distributed Computing Systems, 1991, p.256-263 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_148674 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Costs Delay Memory management Parallel architectures Power system management Prototypes Resource management Supercomputers Topology Very large scale integration |
| title | An efficient submesh allocation strategy for mesh computer systems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T12%3A29%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=An%20efficient%20submesh%20allocation%20strategy%20for%20mesh%20computer%20systems&rft.btitle=%5B1991%5D%20Proceedings.%2011th%20International%20Conference%20on%20Distributed%20Computing%20Systems&rft.au=Chuang,%20P.-J.&rft.date=1991&rft.spage=256&rft.epage=263&rft.pages=256-263&rft.isbn=0818621443&rft.isbn_list=9780818621444&rft_id=info:doi/10.1109/ICDCS.1991.148674&rft_dat=%3Cieee_6IE%3E148674%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=148674&rfr_iscdi=true |