On the complexity of the mapping problem for massively parallel architectures
Abstract: "The mapping problem arises when a concurrent program is executed on a parallel architecture. The goal is to devise an allocation of processes onto physical processing nodes which optimizes a global measure of system performance. In this work we analyze the complexity and the approxim...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Pisa
1991
|
| Schriftenreihe: | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report
1991,5 |
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010843990 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960711s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)28227688 | ||
| 035 | |a (DE-599)BVBBV010843990 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Antonelli, Silvano |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On the complexity of the mapping problem for massively parallel architectures |c S. Antonelli ; S. Pelagatti |
| 264 | 1 | |a Pisa |c 1991 | |
| 300 | |a 9 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report |v 1991,5 | |
| 520 | 3 | |a Abstract: "The mapping problem arises when a concurrent program is executed on a parallel architecture. The goal is to devise an allocation of processes onto physical processing nodes which optimizes a global measure of system performance. In this work we analyze the complexity and the approximability of both the mapping problem in its general formulation and some of its subproblems that are interesting for massively parallel systems. Unfortunately, it turns out that all the problems introduced are NP-Hard. Moreover, they can be solved only with approximate algorithms for which the distance between the exact and the approximate solution is not bounded." | |
| 650 | 4 | |a Computer architecture | |
| 650 | 4 | |a Concurrent programming | |
| 700 | 1 | |a Pelagatti, Susanna |e Verfasser |4 aut | |
| 810 | 2 | |a Dipartimento di Informatica: Technical report |t Università degli Studi <Pisa> |v 1991,5 |w (DE-604)BV010841375 |9 1991,5 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007249162 | ||
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111/2001 B 6106-1991,5 |
|---|---|
| DE-BY-TUM_katkey | 751802 |
| DE-BY-TUM_media_number | 040010271937 |
| _version_ | 1816711739658469377 |
| any_adam_object | |
| author | Antonelli, Silvano Pelagatti, Susanna |
| author_facet | Antonelli, Silvano Pelagatti, Susanna |
| author_role | aut aut |
| author_sort | Antonelli, Silvano |
| author_variant | s a sa s p sp |
| building | Verbundindex |
| bvnumber | BV010843990 |
| ctrlnum | (OCoLC)28227688 (DE-599)BVBBV010843990 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01721nam a2200313 cb4500</leader><controlfield tag="001">BV010843990</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960711s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28227688</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010843990</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Antonelli, Silvano</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the complexity of the mapping problem for massively parallel architectures</subfield><subfield code="c">S. Antonelli ; S. Pelagatti</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pisa</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report</subfield><subfield code="v">1991,5</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The mapping problem arises when a concurrent program is executed on a parallel architecture. The goal is to devise an allocation of processes onto physical processing nodes which optimizes a global measure of system performance. In this work we analyze the complexity and the approximability of both the mapping problem in its general formulation and some of its subproblems that are interesting for massively parallel systems. Unfortunately, it turns out that all the problems introduced are NP-Hard. Moreover, they can be solved only with approximate algorithms for which the distance between the exact and the approximate solution is not bounded."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer architecture</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Concurrent programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pelagatti, Susanna</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Dipartimento di Informatica: Technical report</subfield><subfield code="t">Università degli Studi <Pisa></subfield><subfield code="v">1991,5</subfield><subfield code="w">(DE-604)BV010841375</subfield><subfield code="9">1991,5</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007249162</subfield></datafield></record></collection> |
| id | DE-604.BV010843990 |
| illustrated | Not Illustrated |
| indexdate | 2024-11-25T17:14:19Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007249162 |
| oclc_num | 28227688 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 9 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report |
| spellingShingle | Antonelli, Silvano Pelagatti, Susanna On the complexity of the mapping problem for massively parallel architectures Computer architecture Concurrent programming |
| title | On the complexity of the mapping problem for massively parallel architectures |
| title_auth | On the complexity of the mapping problem for massively parallel architectures |
| title_exact_search | On the complexity of the mapping problem for massively parallel architectures |
| title_full | On the complexity of the mapping problem for massively parallel architectures S. Antonelli ; S. Pelagatti |
| title_fullStr | On the complexity of the mapping problem for massively parallel architectures S. Antonelli ; S. Pelagatti |
| title_full_unstemmed | On the complexity of the mapping problem for massively parallel architectures S. Antonelli ; S. Pelagatti |
| title_short | On the complexity of the mapping problem for massively parallel architectures |
| title_sort | on the complexity of the mapping problem for massively parallel architectures |
| topic | Computer architecture Concurrent programming |
| topic_facet | Computer architecture Concurrent programming |
| volume_link | (DE-604)BV010841375 |
| work_keys_str_mv | AT antonellisilvano onthecomplexityofthemappingproblemformassivelyparallelarchitectures AT pelagattisusanna onthecomplexityofthemappingproblemformassivelyparallelarchitectures |