The concurrent constraint language GDCC and its parallel constraint solver:
Abstract: "We describe the current state of development of the concurrent constraint language GDCC (Guarded Definite Clauses with Constraints), is a member of the cc (Concurrent Constraint) family of languages which supports multiple solvers and recursive queries in a committed-choice framework...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1991
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
713 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We describe the current state of development of the concurrent constraint language GDCC (Guarded Definite Clauses with Constraints), is a member of the cc (Concurrent Constraint) family of languages which supports multiple solvers and recursive queries in a committed-choice framework. GDCC models computation as the interaction of multiple cooperating agents through the exchange of information via querying and asserting the information into a central repository. Concretely, this paradigm is embedded in a guarded (conditional) reduction system, where the guards contain the queries and assertions Control is achieved by requiring that the queries in a guard are true (entailed), and that the assertions are consistent (satisfiable), with respect to the current state of the repository. GDCC is an experimental cc language, which supports a user-specified set of sorts and constraint symbols in a committed-choice framework, and is intended to be a research tool for investigating issues of constraint-solving in concurrent programming languages, such as problem decomposition, use of multiple solvers and hybrid techniques, ordering of constraints, management of semi- decidable solution methods, debugging techniques, etc We introduce the language, its implementation in KL1[NaI89a], and a parallel constraint solver for rational polynomials based on a parallel implementation of the Buchberger Algorithm. The Buchberger Algorithm is a basic technology for symbolic algebra, and several attempts at its parallelization have appeared in the recent literature, with some good results for shared memory machines. The algorithm we present is designed for the distributed-memory Multi-PSI, but nevertheless shows consistently good performance and speedups for a number of standard benchmarks from the literature. |
| Beschreibung: | 17 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010956078 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960918s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)26483693 | ||
| 035 | |a (DE-599)BVBBV010956078 | ||
| 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 The concurrent constraint language GDCC and its parallel constraint solver |c by D. Hawley |
| 264 | 1 | |a Tokyo, Japan |c 1991 | |
| 300 | |a 17 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 713 | |
| 520 | 3 | |a Abstract: "We describe the current state of development of the concurrent constraint language GDCC (Guarded Definite Clauses with Constraints), is a member of the cc (Concurrent Constraint) family of languages which supports multiple solvers and recursive queries in a committed-choice framework. GDCC models computation as the interaction of multiple cooperating agents through the exchange of information via querying and asserting the information into a central repository. Concretely, this paradigm is embedded in a guarded (conditional) reduction system, where the guards contain the queries and assertions | |
| 520 | 3 | |a Control is achieved by requiring that the queries in a guard are true (entailed), and that the assertions are consistent (satisfiable), with respect to the current state of the repository. GDCC is an experimental cc language, which supports a user-specified set of sorts and constraint symbols in a committed-choice framework, and is intended to be a research tool for investigating issues of constraint-solving in concurrent programming languages, such as problem decomposition, use of multiple solvers and hybrid techniques, ordering of constraints, management of semi- decidable solution methods, debugging techniques, etc | |
| 520 | 3 | |a We introduce the language, its implementation in KL1[NaI89a], and a parallel constraint solver for rational polynomials based on a parallel implementation of the Buchberger Algorithm. The Buchberger Algorithm is a basic technology for symbolic algebra, and several attempts at its parallelization have appeared in the recent literature, with some good results for shared memory machines. The algorithm we present is designed for the distributed-memory Multi-PSI, but nevertheless shows consistently good performance and speedups for a number of standard benchmarks from the literature. | |
| 650 | 4 | |a Concurrent programming | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 713 |w (DE-604)BV010923438 |9 713 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007328259 | ||
Datensatz im Suchindex
| _version_ | 1804125443256745984 |
|---|---|
| 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 | BV010956078 |
| ctrlnum | (OCoLC)26483693 (DE-599)BVBBV010956078 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02804nam a2200313 cb4500</leader><controlfield tag="001">BV010956078</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960918s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26483693</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010956078</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">The concurrent constraint language GDCC and its parallel constraint solver</subfield><subfield code="c">by D. 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">17 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">713</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We describe the current state of development of the concurrent constraint language GDCC (Guarded Definite Clauses with Constraints), is a member of the cc (Concurrent Constraint) family of languages which supports multiple solvers and recursive queries in a committed-choice framework. GDCC models computation as the interaction of multiple cooperating agents through the exchange of information via querying and asserting the information into a central repository. Concretely, this paradigm is embedded in a guarded (conditional) reduction system, where the guards contain the queries and assertions</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Control is achieved by requiring that the queries in a guard are true (entailed), and that the assertions are consistent (satisfiable), with respect to the current state of the repository. GDCC is an experimental cc language, which supports a user-specified set of sorts and constraint symbols in a committed-choice framework, and is intended to be a research tool for investigating issues of constraint-solving in concurrent programming languages, such as problem decomposition, use of multiple solvers and hybrid techniques, ordering of constraints, management of semi- decidable solution methods, debugging techniques, etc</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We introduce the language, its implementation in KL1[NaI89a], and a parallel constraint solver for rational polynomials based on a parallel implementation of the Buchberger Algorithm. The Buchberger Algorithm is a basic technology for symbolic algebra, and several attempts at its parallelization have appeared in the recent literature, with some good results for shared memory machines. The algorithm we present is designed for the distributed-memory Multi-PSI, but nevertheless shows consistently good performance and speedups for a number of standard benchmarks from the literature.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Concurrent programming</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">713</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">713</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007328259</subfield></datafield></record></collection> |
| id | DE-604.BV010956078 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:38Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007328259 |
| oclc_num | 26483693 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 17 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 The concurrent constraint language GDCC and its parallel constraint solver by D. Hawley Tokyo, Japan 1991 17 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 713 Abstract: "We describe the current state of development of the concurrent constraint language GDCC (Guarded Definite Clauses with Constraints), is a member of the cc (Concurrent Constraint) family of languages which supports multiple solvers and recursive queries in a committed-choice framework. GDCC models computation as the interaction of multiple cooperating agents through the exchange of information via querying and asserting the information into a central repository. Concretely, this paradigm is embedded in a guarded (conditional) reduction system, where the guards contain the queries and assertions Control is achieved by requiring that the queries in a guard are true (entailed), and that the assertions are consistent (satisfiable), with respect to the current state of the repository. GDCC is an experimental cc language, which supports a user-specified set of sorts and constraint symbols in a committed-choice framework, and is intended to be a research tool for investigating issues of constraint-solving in concurrent programming languages, such as problem decomposition, use of multiple solvers and hybrid techniques, ordering of constraints, management of semi- decidable solution methods, debugging techniques, etc We introduce the language, its implementation in KL1[NaI89a], and a parallel constraint solver for rational polynomials based on a parallel implementation of the Buchberger Algorithm. The Buchberger Algorithm is a basic technology for symbolic algebra, and several attempts at its parallelization have appeared in the recent literature, with some good results for shared memory machines. The algorithm we present is designed for the distributed-memory Multi-PSI, but nevertheless shows consistently good performance and speedups for a number of standard benchmarks from the literature. Concurrent programming Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 713 (DE-604)BV010923438 713 |
| spellingShingle | Hawley, David The concurrent constraint language GDCC and its parallel constraint solver Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Concurrent programming |
| title | The concurrent constraint language GDCC and its parallel constraint solver |
| title_auth | The concurrent constraint language GDCC and its parallel constraint solver |
| title_exact_search | The concurrent constraint language GDCC and its parallel constraint solver |
| title_full | The concurrent constraint language GDCC and its parallel constraint solver by D. Hawley |
| title_fullStr | The concurrent constraint language GDCC and its parallel constraint solver by D. Hawley |
| title_full_unstemmed | The concurrent constraint language GDCC and its parallel constraint solver by D. Hawley |
| title_short | The concurrent constraint language GDCC and its parallel constraint solver |
| title_sort | the concurrent constraint language gdcc and its parallel constraint solver |
| topic | Concurrent programming |
| topic_facet | Concurrent programming |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT hawleydavid theconcurrentconstraintlanguagegdccanditsparallelconstraintsolver |