A Buchberger algorithm for distributed memory multi-processors:
Abstract: "Gröbner Bases are a mathematical tool that has received considerable attention in recent years. Since the Buchberger Algorithm for computing these objects is expensive in both space and time, several attempts at parallelization have been made, with good results for shared-memory mult...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Tokyo, Japan
1991
|
| Series: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
677 |
| Subjects: | |
| Summary: | Abstract: "Gröbner Bases are a mathematical tool that has received considerable attention in recent years. Since the Buchberger Algorithm for computing these objects is expensive in both space and time, several attempts at parallelization have been made, with good results for shared-memory multi-processors, but not for distributed memory machines. We present an algorithm that delivers substantial speedups on distributed memory multi-processors, and an incremental version of the algorithm which is suitable for use as the solver in a constraint logic language." |
| Physical Description: | 6 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010954482 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960917s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)26039958 | ||
| 035 | |a (DE-599)BVBBV010954482 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Hawley, David |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A Buchberger algorithm for distributed memory multi-processors |c by David Hawley |
| 264 | 1 | |a Tokyo, Japan |c 1991 | |
| 300 | |a 6 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 677 | |
| 520 | 3 | |a Abstract: "Gröbner Bases are a mathematical tool that has received considerable attention in recent years. Since the Buchberger Algorithm for computing these objects is expensive in both space and time, several attempts at parallelization have been made, with good results for shared-memory multi-processors, but not for distributed memory machines. We present an algorithm that delivers substantial speedups on distributed memory multi-processors, and an incremental version of the algorithm which is suitable for use as the solver in a constraint logic language." | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Multiprocessors | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 677 |w (DE-604)BV010923438 |9 677 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007326828 | ||
Record in the Search Index
| _version_ | 1804125441420689408 |
|---|---|
| any_adam_object | |
| author | Hawley, David |
| author_facet | Hawley, David |
| author_role | aut |
| author_sort | Hawley, David |
| author_variant | d h dh |
| building | Verbundindex |
| bvnumber | BV010954482 |
| ctrlnum | (OCoLC)26039958 (DE-599)BVBBV010954482 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01525nam a2200301 cb4500</leader><controlfield tag="001">BV010954482</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960917s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26039958</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010954482</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">Hawley, David</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Buchberger algorithm for distributed memory multi-processors</subfield><subfield code="c">by David Hawley</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">6 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">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">677</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Gröbner Bases are a mathematical tool that has received considerable attention in recent years. Since the Buchberger Algorithm for computing these objects is expensive in both space and time, several attempts at parallelization have been made, with good results for shared-memory multi-processors, but not for distributed memory machines. We present an algorithm that delivers substantial speedups on distributed memory multi-processors, and an incremental version of the algorithm which is suitable for use as the solver in a constraint logic language."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprocessors</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">677</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">677</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007326828</subfield></datafield></record></collection> |
| id | DE-604.BV010954482 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:37Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007326828 |
| oclc_num | 26039958 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 6 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| spelling | Hawley, David Verfasser aut A Buchberger algorithm for distributed memory multi-processors by David Hawley Tokyo, Japan 1991 6 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 677 Abstract: "Gröbner Bases are a mathematical tool that has received considerable attention in recent years. Since the Buchberger Algorithm for computing these objects is expensive in both space and time, several attempts at parallelization have been made, with good results for shared-memory multi-processors, but not for distributed memory machines. We present an algorithm that delivers substantial speedups on distributed memory multi-processors, and an incremental version of the algorithm which is suitable for use as the solver in a constraint logic language." Algorithms Multiprocessors Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 677 (DE-604)BV010923438 677 |
| spellingShingle | Hawley, David A Buchberger algorithm for distributed memory multi-processors Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Algorithms Multiprocessors |
| title | A Buchberger algorithm for distributed memory multi-processors |
| title_auth | A Buchberger algorithm for distributed memory multi-processors |
| title_exact_search | A Buchberger algorithm for distributed memory multi-processors |
| title_full | A Buchberger algorithm for distributed memory multi-processors by David Hawley |
| title_fullStr | A Buchberger algorithm for distributed memory multi-processors by David Hawley |
| title_full_unstemmed | A Buchberger algorithm for distributed memory multi-processors by David Hawley |
| title_short | A Buchberger algorithm for distributed memory multi-processors |
| title_sort | a buchberger algorithm for distributed memory multi processors |
| topic | Algorithms Multiprocessors |
| topic_facet | Algorithms Multiprocessors |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT hawleydavid abuchbergeralgorithmfordistributedmemorymultiprocessors |