Dynamic partitioning in a class of parallel systems
Systems that have the capability of executing tasks with various sizes and computation structures simultaneously are considered. When some of the tasks are completed, part of the system becomes idle and is reconfigured for new tasks. Inappropriate reconfiguration strategies can create resource fragm...
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 | 40 |
|---|---|
| container_issue | |
| container_start_page | 33 |
| container_title | |
| container_volume | |
| creator | Jeng, M. Siegel, H.J. |
| description | Systems that have the capability of executing tasks with various sizes and computation structures simultaneously are considered. When some of the tasks are completed, part of the system becomes idle and is reconfigured for new tasks. Inappropriate reconfiguration strategies can create resource fragments and result in a loss of computation power. This problem can be alleviated by partitioning the system dynamically. Partitioning consists of two processes: splitting the system or a subsystem into smaller subsystems, and combining unallocated subsystems into larger subsystems. These two processes are investigated analytically for a lattice model that uses a special partial ordering relation on a set. The complexities of these two processes are also analyzed. The method can be applied to any system that can be modeled by a lattice.< > |
| doi_str_mv | 10.1109/DCS.1988.12497 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_12497</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>12497</ieee_id><sourcerecordid>12497</sourcerecordid><originalsourceid>FETCH-LOGICAL-i86t-e7c2c785188e1e429c09f130f1d32ef9a1207f15f1bf9766e2530dc6ecad3ea93</originalsourceid><addsrcrecordid>eNotjztrwzAURgWh0DTNGuimP2BXV7JeY3HaphDo0Azdwo18VVRkJ1he_O_7_JYzHDjwMbYBUQMIf79t32rwztUgG28X7EY4cEY4o9-v2bqUT_G9ptHKqCVT23nAPgV-wXFKUzoPafjgaeDIQ8ZS-Dn-KMyZMi9zmagvt-wqYi60_ueKHZ4eD-2u2r8-v7QP-yo5M1VkgwzWaXCOgBrpg_ARlIjQKUnRI0hhI-gIp-itMSS1El0wFLBThF6t2N1fNhHR8TKmHsf5-HtKfQFsFkHg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Dynamic partitioning in a class of parallel systems</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Jeng, M. ; Siegel, H.J.</creator><creatorcontrib>Jeng, M. ; Siegel, H.J.</creatorcontrib><description>Systems that have the capability of executing tasks with various sizes and computation structures simultaneously are considered. When some of the tasks are completed, part of the system becomes idle and is reconfigured for new tasks. Inappropriate reconfiguration strategies can create resource fragments and result in a loss of computation power. This problem can be alleviated by partitioning the system dynamically. Partitioning consists of two processes: splitting the system or a subsystem into smaller subsystems, and combining unallocated subsystems into larger subsystems. These two processes are investigated analytically for a lattice model that uses a special partial ordering relation on a set. The complexities of these two processes are also analyzed. The method can be applied to any system that can be modeled by a lattice.< ></description><identifier>ISBN: 081860865X</identifier><identifier>ISBN: 9780818608650</identifier><identifier>DOI: 10.1109/DCS.1988.12497</identifier><language>eng</language><publisher>IEEE Comput. Soc. Press</publisher><subject>Computer networks ; Computer science ; Concurrent computing ; Costs ; Hardware ; Large-scale systems ; Lattices ; Multiprocessor interconnection networks ; Power system modeling ; Resource management</subject><ispartof>[1988] Proceedings. The 8th International Conference on Distributed, 1988, p.33-40</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/12497$$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/12497$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Jeng, M.</creatorcontrib><creatorcontrib>Siegel, H.J.</creatorcontrib><title>Dynamic partitioning in a class of parallel systems</title><title>[1988] Proceedings. The 8th International Conference on Distributed</title><addtitle>DCS</addtitle><description>Systems that have the capability of executing tasks with various sizes and computation structures simultaneously are considered. When some of the tasks are completed, part of the system becomes idle and is reconfigured for new tasks. Inappropriate reconfiguration strategies can create resource fragments and result in a loss of computation power. This problem can be alleviated by partitioning the system dynamically. Partitioning consists of two processes: splitting the system or a subsystem into smaller subsystems, and combining unallocated subsystems into larger subsystems. These two processes are investigated analytically for a lattice model that uses a special partial ordering relation on a set. The complexities of these two processes are also analyzed. The method can be applied to any system that can be modeled by a lattice.< ></description><subject>Computer networks</subject><subject>Computer science</subject><subject>Concurrent computing</subject><subject>Costs</subject><subject>Hardware</subject><subject>Large-scale systems</subject><subject>Lattices</subject><subject>Multiprocessor interconnection networks</subject><subject>Power system modeling</subject><subject>Resource management</subject><isbn>081860865X</isbn><isbn>9780818608650</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1988</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjztrwzAURgWh0DTNGuimP2BXV7JeY3HaphDo0Azdwo18VVRkJ1he_O_7_JYzHDjwMbYBUQMIf79t32rwztUgG28X7EY4cEY4o9-v2bqUT_G9ptHKqCVT23nAPgV-wXFKUzoPafjgaeDIQ8ZS-Dn-KMyZMi9zmagvt-wqYi60_ueKHZ4eD-2u2r8-v7QP-yo5M1VkgwzWaXCOgBrpg_ARlIjQKUnRI0hhI-gIp-itMSS1El0wFLBThF6t2N1fNhHR8TKmHsf5-HtKfQFsFkHg</recordid><startdate>1988</startdate><enddate>1988</enddate><creator>Jeng, M.</creator><creator>Siegel, H.J.</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>1988</creationdate><title>Dynamic partitioning in a class of parallel systems</title><author>Jeng, M. ; Siegel, H.J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i86t-e7c2c785188e1e429c09f130f1d32ef9a1207f15f1bf9766e2530dc6ecad3ea93</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1988</creationdate><topic>Computer networks</topic><topic>Computer science</topic><topic>Concurrent computing</topic><topic>Costs</topic><topic>Hardware</topic><topic>Large-scale systems</topic><topic>Lattices</topic><topic>Multiprocessor interconnection networks</topic><topic>Power system modeling</topic><topic>Resource management</topic><toplevel>online_resources</toplevel><creatorcontrib>Jeng, M.</creatorcontrib><creatorcontrib>Siegel, H.J.</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>Jeng, M.</au><au>Siegel, H.J.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Dynamic partitioning in a class of parallel systems</atitle><btitle>[1988] Proceedings. The 8th International Conference on Distributed</btitle><stitle>DCS</stitle><date>1988</date><risdate>1988</risdate><spage>33</spage><epage>40</epage><pages>33-40</pages><isbn>081860865X</isbn><isbn>9780818608650</isbn><abstract>Systems that have the capability of executing tasks with various sizes and computation structures simultaneously are considered. When some of the tasks are completed, part of the system becomes idle and is reconfigured for new tasks. Inappropriate reconfiguration strategies can create resource fragments and result in a loss of computation power. This problem can be alleviated by partitioning the system dynamically. Partitioning consists of two processes: splitting the system or a subsystem into smaller subsystems, and combining unallocated subsystems into larger subsystems. These two processes are investigated analytically for a lattice model that uses a special partial ordering relation on a set. The complexities of these two processes are also analyzed. The method can be applied to any system that can be modeled by a lattice.< ></abstract><pub>IEEE Comput. Soc. Press</pub><doi>10.1109/DCS.1988.12497</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 081860865X |
| ispartof | [1988] Proceedings. The 8th International Conference on Distributed, 1988, p.33-40 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_12497 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Computer networks Computer science Concurrent computing Costs Hardware Large-scale systems Lattices Multiprocessor interconnection networks Power system modeling Resource management |
| title | Dynamic partitioning in a class of parallel 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-31T20%3A23%3A08IST&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=Dynamic%20partitioning%20in%20a%20class%20of%20parallel%20systems&rft.btitle=%5B1988%5D%20Proceedings.%20The%208th%20International%20Conference%20on%20Distributed&rft.au=Jeng,%20M.&rft.date=1988&rft.spage=33&rft.epage=40&rft.pages=33-40&rft.isbn=081860865X&rft.isbn_list=9780818608650&rft_id=info:doi/10.1109/DCS.1988.12497&rft_dat=%3Cieee_6IE%3E12497%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=12497&rfr_iscdi=true |