A comparison of automatic versus manual parallelization of the Boyer-Moore theorem prover:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Urbana, Ill.
1990
|
| Schriftenreihe: | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report
960 |
| Schlagwörter: | |
| Abstract: | Abstract: "In this paper, we compare the manual parallelization of the Boyer-Moore theorem prover [Gab85] using the constructs of Multiplisp [Hal85] and Qlisp [GGS89], with the automatic parallelization of the same program using the Parcel compiler [Har89]. boyer is popular as a Lisp benchmark because it performs a significant and representative computation; its structure makes it interesting for studying manual and automatic parallelization as well. We will compare the parallelism that results from a straightforward hand-parallelization of the theorem prover using future and qlet, with that introduced by Parcel. We find the most significant parallelism within the theorem prover is easily expressed using future or qlet, and that this same parallelism is automatically uncovered by the Parcel compiler There is in boyer some producer-consumer parallelism that can be expressed using future or qlet, that is not exploited by Parcel. On the other hand, we show that Parcel is able to deduce the lifetimes of dynamically allocated objects, and on this basis to guide the management of a hierarchical memory, whereas there is no provision for the management of such a memory in either Multilisp or Qlisp. |
| Umfang: | 17 Bl. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008949942 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 940206s1990 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)22145283 | ||
| 035 | |a (DE-599)BVBBV008949942 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Harrison, Luddy |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A comparison of automatic versus manual parallelization of the Boyer-Moore theorem prover |c Williams Ludwell Harrison and Zahira Ammarguellat |
| 264 | 1 | |a Urbana, Ill. |c 1990 | |
| 300 | |a 17 Bl. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 960 | |
| 520 | 3 | |a Abstract: "In this paper, we compare the manual parallelization of the Boyer-Moore theorem prover [Gab85] using the constructs of Multiplisp [Hal85] and Qlisp [GGS89], with the automatic parallelization of the same program using the Parcel compiler [Har89]. boyer is popular as a Lisp benchmark because it performs a significant and representative computation; its structure makes it interesting for studying manual and automatic parallelization as well. We will compare the parallelism that results from a straightforward hand-parallelization of the theorem prover using future and qlet, with that introduced by Parcel. We find the most significant parallelism within the theorem prover is easily expressed using future or qlet, and that this same parallelism is automatically uncovered by the Parcel compiler | |
| 520 | 3 | |a There is in boyer some producer-consumer parallelism that can be expressed using future or qlet, that is not exploited by Parcel. On the other hand, we show that Parcel is able to deduce the lifetimes of dynamically allocated objects, and on this basis to guide the management of a hierarchical memory, whereas there is no provision for the management of such a memory in either Multilisp or Qlisp. | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 700 | 1 | |a Ammarguellat, Zahira |e Verfasser |4 aut | |
| 830 | 0 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 960 |w (DE-604)BV008930033 |9 960 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005905553 | |
Datensatz im Suchindex
| _version_ | 1818951113304440832 |
|---|---|
| any_adam_object | |
| author | Harrison, Luddy Ammarguellat, Zahira |
| author_facet | Harrison, Luddy Ammarguellat, Zahira |
| author_role | aut aut |
| author_sort | Harrison, Luddy |
| author_variant | l h lh z a za |
| building | Verbundindex |
| bvnumber | BV008949942 |
| ctrlnum | (OCoLC)22145283 (DE-599)BVBBV008949942 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02349nam a2200325 cb4500</leader><controlfield tag="001">BV008949942</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940206s1990 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22145283</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008949942</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">Harrison, Luddy</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A comparison of automatic versus manual parallelization of the Boyer-Moore theorem prover</subfield><subfield code="c">Williams Ludwell Harrison and Zahira Ammarguellat</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 Bl.</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">Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report</subfield><subfield code="v">960</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper, we compare the manual parallelization of the Boyer-Moore theorem prover [Gab85] using the constructs of Multiplisp [Hal85] and Qlisp [GGS89], with the automatic parallelization of the same program using the Parcel compiler [Har89]. boyer is popular as a Lisp benchmark because it performs a significant and representative computation; its structure makes it interesting for studying manual and automatic parallelization as well. We will compare the parallelism that results from a straightforward hand-parallelization of the theorem prover using future and qlet, with that introduced by Parcel. We find the most significant parallelism within the theorem prover is easily expressed using future or qlet, and that this same parallelism is automatically uncovered by the Parcel compiler</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">There is in boyer some producer-consumer parallelism that can be expressed using future or qlet, that is not exploited by Parcel. On the other hand, we show that Parcel is able to deduce the lifetimes of dynamically allocated objects, and on this basis to guide the management of a hierarchical memory, whereas there is no provision for the management of such a memory in either Multilisp or Qlisp.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ammarguellat, Zahira</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report</subfield><subfield code="v">960</subfield><subfield code="w">(DE-604)BV008930033</subfield><subfield code="9">960</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005905553</subfield></datafield></record></collection> |
| id | DE-604.BV008949942 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:29:19Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005905553 |
| oclc_num | 22145283 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 17 Bl. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |
| series2 | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |
| spelling | Harrison, Luddy Verfasser aut A comparison of automatic versus manual parallelization of the Boyer-Moore theorem prover Williams Ludwell Harrison and Zahira Ammarguellat Urbana, Ill. 1990 17 Bl. txt rdacontent n rdamedia nc rdacarrier Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 960 Abstract: "In this paper, we compare the manual parallelization of the Boyer-Moore theorem prover [Gab85] using the constructs of Multiplisp [Hal85] and Qlisp [GGS89], with the automatic parallelization of the same program using the Parcel compiler [Har89]. boyer is popular as a Lisp benchmark because it performs a significant and representative computation; its structure makes it interesting for studying manual and automatic parallelization as well. We will compare the parallelism that results from a straightforward hand-parallelization of the theorem prover using future and qlet, with that introduced by Parcel. We find the most significant parallelism within the theorem prover is easily expressed using future or qlet, and that this same parallelism is automatically uncovered by the Parcel compiler There is in boyer some producer-consumer parallelism that can be expressed using future or qlet, that is not exploited by Parcel. On the other hand, we show that Parcel is able to deduce the lifetimes of dynamically allocated objects, and on this basis to guide the management of a hierarchical memory, whereas there is no provision for the management of such a memory in either Multilisp or Qlisp. Automatic theorem proving Parallel processing (Electronic computers) Ammarguellat, Zahira Verfasser aut Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 960 (DE-604)BV008930033 960 |
| spellingShingle | Harrison, Luddy Ammarguellat, Zahira A comparison of automatic versus manual parallelization of the Boyer-Moore theorem prover Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report Automatic theorem proving Parallel processing (Electronic computers) |
| title | A comparison of automatic versus manual parallelization of the Boyer-Moore theorem prover |
| title_auth | A comparison of automatic versus manual parallelization of the Boyer-Moore theorem prover |
| title_exact_search | A comparison of automatic versus manual parallelization of the Boyer-Moore theorem prover |
| title_full | A comparison of automatic versus manual parallelization of the Boyer-Moore theorem prover Williams Ludwell Harrison and Zahira Ammarguellat |
| title_fullStr | A comparison of automatic versus manual parallelization of the Boyer-Moore theorem prover Williams Ludwell Harrison and Zahira Ammarguellat |
| title_full_unstemmed | A comparison of automatic versus manual parallelization of the Boyer-Moore theorem prover Williams Ludwell Harrison and Zahira Ammarguellat |
| title_short | A comparison of automatic versus manual parallelization of the Boyer-Moore theorem prover |
| title_sort | a comparison of automatic versus manual parallelization of the boyer moore theorem prover |
| topic | Automatic theorem proving Parallel processing (Electronic computers) |
| topic_facet | Automatic theorem proving Parallel processing (Electronic computers) |
| volume_link | (DE-604)BV008930033 |
| work_keys_str_mv | AT harrisonluddy acomparisonofautomaticversusmanualparallelizationoftheboyermooretheoremprover AT ammarguellatzahira acomparisonofautomaticversusmanualparallelizationoftheboyermooretheoremprover |