A heuristic processor allocation strategy in hypercube systems
A new processor allocation scheme for hypercube systems, called the HPA (heuristic processor allocation) strategy, is presented. In this scheme, an undirected graph, called the SC-graph (Subcube-graph), is used to maintain the free subcubes available in system, which are represented by vertices. An...
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 | 581 |
|---|---|
| container_issue | |
| container_start_page | 574 |
| container_title | |
| container_volume | |
| creator | Yoon, S.Y. Kang, O. Yoon, H. Maeng, S.R. Cho, J.W. |
| description | A new processor allocation scheme for hypercube systems, called the HPA (heuristic processor allocation) strategy, is presented. In this scheme, an undirected graph, called the SC-graph (Subcube-graph), is used to maintain the free subcubes available in system, which are represented by vertices. An allocation request for a k-cube is satisfied by finding a free subcube of dimension k in the SC-graph or by decomposing a nearest higher dimension subcube. If there are more than one subcube of dimension k, a subcube which has minimum degree in the SC-graph is selected to reduce the external fragmentation. For deallocating the released subcube a heuristic algorithm is used to maintain the dimension of free subcube as high as possible. It is theoretically shown that the HPA strategy is not only statically optimal but also it has a complete subcube recognition capability in a dynamic environment. Extensive simulation results show that the HPA strategy improves the performance and significantly reduces the allocation/deallocation time compared to the previously proposed schemes.< > |
| doi_str_mv | 10.1109/SPDP.1991.218248 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_218248</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>218248</ieee_id><sourcerecordid>218248</sourcerecordid><originalsourceid>FETCH-LOGICAL-i89t-d3a2ce3d78fb967c75f6453e38f4b3a2352bfaac2c7178c07a569f97fd104fd93</originalsourceid><addsrcrecordid>eNotj8tqwzAURAWh0DTNvnSlH7CrK1mWtAmE9AmBBpp9kOWrRsGJjaQs_Pc1pLMZOAMHhpAnYCUAMy8_u9ddCcZAyUHzSs_IA9Ogay6AwT1ZpnRiU6SckJyT1Zoe8RpDysHRIfYOU-ojtV3XO5tDf6EpR5vxd6ThQo_jgNFdG6RpTBnP6ZHcedslXP73guzf3_abz2L7_fG1WW-LoE0uWmG5Q9Eq7RtTK6ekryspUGhfNdMmJG-8tY47BUo7pqysjTfKt8Aq3xqxIM83bUDEwxDD2cbxcDso_gAty0eY</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A heuristic processor allocation strategy in hypercube systems</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Yoon, S.Y. ; Kang, O. ; Yoon, H. ; Maeng, S.R. ; Cho, J.W.</creator><creatorcontrib>Yoon, S.Y. ; Kang, O. ; Yoon, H. ; Maeng, S.R. ; Cho, J.W.</creatorcontrib><description>A new processor allocation scheme for hypercube systems, called the HPA (heuristic processor allocation) strategy, is presented. In this scheme, an undirected graph, called the SC-graph (Subcube-graph), is used to maintain the free subcubes available in system, which are represented by vertices. An allocation request for a k-cube is satisfied by finding a free subcube of dimension k in the SC-graph or by decomposing a nearest higher dimension subcube. If there are more than one subcube of dimension k, a subcube which has minimum degree in the SC-graph is selected to reduce the external fragmentation. For deallocating the released subcube a heuristic algorithm is used to maintain the dimension of free subcube as high as possible. It is theoretically shown that the HPA strategy is not only statically optimal but also it has a complete subcube recognition capability in a dynamic environment. Extensive simulation results show that the HPA strategy improves the performance and significantly reduces the allocation/deallocation time compared to the previously proposed schemes.< ></description><identifier>ISBN: 0818623101</identifier><identifier>ISBN: 9780818623103</identifier><identifier>DOI: 10.1109/SPDP.1991.218248</identifier><language>eng</language><publisher>IEEE Comput. Soc. Press</publisher><subject>Computer science ; Concurrent computing ; Flow graphs ; Heuristic algorithms ; Hypercubes ; Scattering ; Strontium</subject><ispartof>Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991, p.574-581</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/218248$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/218248$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yoon, S.Y.</creatorcontrib><creatorcontrib>Kang, O.</creatorcontrib><creatorcontrib>Yoon, H.</creatorcontrib><creatorcontrib>Maeng, S.R.</creatorcontrib><creatorcontrib>Cho, J.W.</creatorcontrib><title>A heuristic processor allocation strategy in hypercube systems</title><title>Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing</title><addtitle>SPDP</addtitle><description>A new processor allocation scheme for hypercube systems, called the HPA (heuristic processor allocation) strategy, is presented. In this scheme, an undirected graph, called the SC-graph (Subcube-graph), is used to maintain the free subcubes available in system, which are represented by vertices. An allocation request for a k-cube is satisfied by finding a free subcube of dimension k in the SC-graph or by decomposing a nearest higher dimension subcube. If there are more than one subcube of dimension k, a subcube which has minimum degree in the SC-graph is selected to reduce the external fragmentation. For deallocating the released subcube a heuristic algorithm is used to maintain the dimension of free subcube as high as possible. It is theoretically shown that the HPA strategy is not only statically optimal but also it has a complete subcube recognition capability in a dynamic environment. Extensive simulation results show that the HPA strategy improves the performance and significantly reduces the allocation/deallocation time compared to the previously proposed schemes.< ></description><subject>Computer science</subject><subject>Concurrent computing</subject><subject>Flow graphs</subject><subject>Heuristic algorithms</subject><subject>Hypercubes</subject><subject>Scattering</subject><subject>Strontium</subject><isbn>0818623101</isbn><isbn>9780818623103</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1991</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj8tqwzAURAWh0DTNvnSlH7CrK1mWtAmE9AmBBpp9kOWrRsGJjaQs_Pc1pLMZOAMHhpAnYCUAMy8_u9ddCcZAyUHzSs_IA9Ogay6AwT1ZpnRiU6SckJyT1Zoe8RpDysHRIfYOU-ojtV3XO5tDf6EpR5vxd6ThQo_jgNFdG6RpTBnP6ZHcedslXP73guzf3_abz2L7_fG1WW-LoE0uWmG5Q9Eq7RtTK6ekryspUGhfNdMmJG-8tY47BUo7pqysjTfKt8Aq3xqxIM83bUDEwxDD2cbxcDso_gAty0eY</recordid><startdate>1991</startdate><enddate>1991</enddate><creator>Yoon, S.Y.</creator><creator>Kang, O.</creator><creator>Yoon, H.</creator><creator>Maeng, S.R.</creator><creator>Cho, J.W.</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>A heuristic processor allocation strategy in hypercube systems</title><author>Yoon, S.Y. ; Kang, O. ; Yoon, H. ; Maeng, S.R. ; Cho, J.W.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i89t-d3a2ce3d78fb967c75f6453e38f4b3a2352bfaac2c7178c07a569f97fd104fd93</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1991</creationdate><topic>Computer science</topic><topic>Concurrent computing</topic><topic>Flow graphs</topic><topic>Heuristic algorithms</topic><topic>Hypercubes</topic><topic>Scattering</topic><topic>Strontium</topic><toplevel>online_resources</toplevel><creatorcontrib>Yoon, S.Y.</creatorcontrib><creatorcontrib>Kang, O.</creatorcontrib><creatorcontrib>Yoon, H.</creatorcontrib><creatorcontrib>Maeng, S.R.</creatorcontrib><creatorcontrib>Cho, J.W.</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>Yoon, S.Y.</au><au>Kang, O.</au><au>Yoon, H.</au><au>Maeng, S.R.</au><au>Cho, J.W.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A heuristic processor allocation strategy in hypercube systems</atitle><btitle>Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing</btitle><stitle>SPDP</stitle><date>1991</date><risdate>1991</risdate><spage>574</spage><epage>581</epage><pages>574-581</pages><isbn>0818623101</isbn><isbn>9780818623103</isbn><abstract>A new processor allocation scheme for hypercube systems, called the HPA (heuristic processor allocation) strategy, is presented. In this scheme, an undirected graph, called the SC-graph (Subcube-graph), is used to maintain the free subcubes available in system, which are represented by vertices. An allocation request for a k-cube is satisfied by finding a free subcube of dimension k in the SC-graph or by decomposing a nearest higher dimension subcube. If there are more than one subcube of dimension k, a subcube which has minimum degree in the SC-graph is selected to reduce the external fragmentation. For deallocating the released subcube a heuristic algorithm is used to maintain the dimension of free subcube as high as possible. It is theoretically shown that the HPA strategy is not only statically optimal but also it has a complete subcube recognition capability in a dynamic environment. Extensive simulation results show that the HPA strategy improves the performance and significantly reduces the allocation/deallocation time compared to the previously proposed schemes.< ></abstract><pub>IEEE Comput. Soc. Press</pub><doi>10.1109/SPDP.1991.218248</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 0818623101 |
| ispartof | Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991, p.574-581 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_218248 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Computer science Concurrent computing Flow graphs Heuristic algorithms Hypercubes Scattering Strontium |
| title | A heuristic processor allocation strategy in hypercube systems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T18%3A07%3A59IST&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=A%20heuristic%20processor%20allocation%20strategy%20in%20hypercube%20systems&rft.btitle=Proceedings%20of%20the%20Third%20IEEE%20Symposium%20on%20Parallel%20and%20Distributed%20Processing&rft.au=Yoon,%20S.Y.&rft.date=1991&rft.spage=574&rft.epage=581&rft.pages=574-581&rft.isbn=0818623101&rft.isbn_list=9780818623103&rft_id=info:doi/10.1109/SPDP.1991.218248&rft_dat=%3Cieee_6IE%3E218248%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=218248&rfr_iscdi=true |