Parallel algorithms for slicing based final placement:
Abstract: "This paper presents parallel algorithms for solving the final placement problem of rectangular modules assuming predefined neighborhood relations between the modules to be placed. By enumerating all arrangements, i.e. slicing structures, of local module subsets optimum solutions are...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
München
1992
|
| Schriftenreihe: | Technische Universität <München>: TUM
9209 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper presents parallel algorithms for solving the final placement problem of rectangular modules assuming predefined neighborhood relations between the modules to be placed. By enumerating all arrangements, i.e. slicing structures, of local module subsets optimum solutions are obtained. They are combined in a global evaluation step such that the local solutions fit well into the global arrangement. Increased size of the enumerated local subproblems leads to placements that are closer to global optimum. However, this requires significantly larger computing resources. Parallel computers provide huge amounts of computing power and distributed memory that can be used to meet these high computational demands Therefore, we propose new algorithms for the enumeration on message-passing parallel computers. Experimental results show that significant speedups as well as better results can be achieved. |
| Beschreibung: | 14 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009008849 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27742856 | ||
| 035 | |a (DE-599)BVBBV009008849 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Spruth, Henning |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parallel algorithms for slicing based final placement |c Henning Spruth ; Georg Sigl ; Frank Johannes |
| 264 | 1 | |a München |c 1992 | |
| 300 | |a 14 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Technische Universität <München>: TUM |v 9209 | |
| 520 | 3 | |a Abstract: "This paper presents parallel algorithms for solving the final placement problem of rectangular modules assuming predefined neighborhood relations between the modules to be placed. By enumerating all arrangements, i.e. slicing structures, of local module subsets optimum solutions are obtained. They are combined in a global evaluation step such that the local solutions fit well into the global arrangement. Increased size of the enumerated local subproblems leads to placements that are closer to global optimum. However, this requires significantly larger computing resources. Parallel computers provide huge amounts of computing power and distributed memory that can be used to meet these high computational demands | |
| 520 | 3 | |a Therefore, we propose new algorithms for the enumeration on message-passing parallel computers. Experimental results show that significant speedups as well as better results can be achieved. | |
| 650 | 4 | |a Combinatorial optimization | |
| 650 | 4 | |a Integrated circuits |x Very large scale integration | |
| 700 | 1 | |a Sigl, Georg |e Verfasser |4 aut | |
| 700 | 1 | |a Johannes, Frank M. |e Verfasser |4 aut | |
| 830 | 0 | |a Technische Universität <München>: TUM |v 9209 |w (DE-604)BV006185376 |9 9209 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005955321 | ||
Datensatz im Suchindex
| _version_ | 1804123356020080640 |
|---|---|
| any_adam_object | |
| author | Spruth, Henning Sigl, Georg Johannes, Frank M. |
| author_facet | Spruth, Henning Sigl, Georg Johannes, Frank M. |
| author_role | aut aut aut |
| author_sort | Spruth, Henning |
| author_variant | h s hs g s gs f m j fm fmj |
| building | Verbundindex |
| bvnumber | BV009008849 |
| ctrlnum | (OCoLC)27742856 (DE-599)BVBBV009008849 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01984nam a2200337 cb4500</leader><controlfield tag="001">BV009008849</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27742856</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009008849</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Spruth, Henning</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel algorithms for slicing based final placement</subfield><subfield code="c">Henning Spruth ; Georg Sigl ; Frank Johannes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14 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">Technische Universität <München>: TUM</subfield><subfield code="v">9209</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper presents parallel algorithms for solving the final placement problem of rectangular modules assuming predefined neighborhood relations between the modules to be placed. By enumerating all arrangements, i.e. slicing structures, of local module subsets optimum solutions are obtained. They are combined in a global evaluation step such that the local solutions fit well into the global arrangement. Increased size of the enumerated local subproblems leads to placements that are closer to global optimum. However, this requires significantly larger computing resources. Parallel computers provide huge amounts of computing power and distributed memory that can be used to meet these high computational demands</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Therefore, we propose new algorithms for the enumeration on message-passing parallel computers. Experimental results show that significant speedups as well as better results can be achieved.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Integrated circuits</subfield><subfield code="x">Very large scale integration</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sigl, Georg</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Johannes, Frank M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM</subfield><subfield code="v">9209</subfield><subfield code="w">(DE-604)BV006185376</subfield><subfield code="9">9209</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005955321</subfield></datafield></record></collection> |
| id | DE-604.BV009008849 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:28Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005955321 |
| oclc_num | 27742856 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 14 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series | Technische Universität <München>: TUM |
| series2 | Technische Universität <München>: TUM |
| spelling | Spruth, Henning Verfasser aut Parallel algorithms for slicing based final placement Henning Spruth ; Georg Sigl ; Frank Johannes München 1992 14 S. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: TUM 9209 Abstract: "This paper presents parallel algorithms for solving the final placement problem of rectangular modules assuming predefined neighborhood relations between the modules to be placed. By enumerating all arrangements, i.e. slicing structures, of local module subsets optimum solutions are obtained. They are combined in a global evaluation step such that the local solutions fit well into the global arrangement. Increased size of the enumerated local subproblems leads to placements that are closer to global optimum. However, this requires significantly larger computing resources. Parallel computers provide huge amounts of computing power and distributed memory that can be used to meet these high computational demands Therefore, we propose new algorithms for the enumeration on message-passing parallel computers. Experimental results show that significant speedups as well as better results can be achieved. Combinatorial optimization Integrated circuits Very large scale integration Sigl, Georg Verfasser aut Johannes, Frank M. Verfasser aut Technische Universität <München>: TUM 9209 (DE-604)BV006185376 9209 |
| spellingShingle | Spruth, Henning Sigl, Georg Johannes, Frank M. Parallel algorithms for slicing based final placement Technische Universität <München>: TUM Combinatorial optimization Integrated circuits Very large scale integration |
| title | Parallel algorithms for slicing based final placement |
| title_auth | Parallel algorithms for slicing based final placement |
| title_exact_search | Parallel algorithms for slicing based final placement |
| title_full | Parallel algorithms for slicing based final placement Henning Spruth ; Georg Sigl ; Frank Johannes |
| title_fullStr | Parallel algorithms for slicing based final placement Henning Spruth ; Georg Sigl ; Frank Johannes |
| title_full_unstemmed | Parallel algorithms for slicing based final placement Henning Spruth ; Georg Sigl ; Frank Johannes |
| title_short | Parallel algorithms for slicing based final placement |
| title_sort | parallel algorithms for slicing based final placement |
| topic | Combinatorial optimization Integrated circuits Very large scale integration |
| topic_facet | Combinatorial optimization Integrated circuits Very large scale integration |
| volume_link | (DE-604)BV006185376 |
| work_keys_str_mv | AT spruthhenning parallelalgorithmsforslicingbasedfinalplacement AT siglgeorg parallelalgorithmsforslicingbasedfinalplacement AT johannesfrankm parallelalgorithmsforslicingbasedfinalplacement |