Derivation of the parallel bottom-up parser from the sequential parser:
Abstract: "This paper describes the derivation of a parallel program from a nondeterministic sequential program using a bottom-up parser as an example. The derivation procedure consists of two stages: exploitation of AND-parallelism and exploitation of OR-parallelism. An interpreter of the sequ...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1992
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
757 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper describes the derivation of a parallel program from a nondeterministic sequential program using a bottom-up parser as an example. The derivation procedure consists of two stages: exploitation of AND-parallelism and exploitation of OR-parallelism. An interpreter of the sequential parser BUP [Matsumoto et al 83] is first transformed so that processes for the nodes in a parsing tree can run in parallel. Then, the resultant program is transformed so that a nondeterministic search of a parsing tree can be done in parallel. The former stage is performed by hand-simulation, and the latter is accomplished by the compiler of ANDOR-II, which is an AND/OR parallel logic programming language [Takeuchi et al. 89] The finally derived program, written in KL1 (Kernel Language of the FGCS Project), achieves an all solution search without side effects. It corresponds to an interpreter of PAX[Matsumoto et al 87], a revised parallel version of BUP. This correspondence shows that the derivation method proposed in this paper is effective in deriving efficient parallel programs. |
| Beschreibung: | 18 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010956654 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960919s1992 |||| 00||| engod | ||
| 035 | |a (OCoLC)27482807 | ||
| 035 | |a (DE-599)BVBBV010956654 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Takahashi, Kazuko |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Derivation of the parallel bottom-up parser from the sequential parser |c by K. Takahashi |
| 264 | 1 | |a Tokyo, Japan |c 1992 | |
| 300 | |a 18 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 757 | |
| 520 | 3 | |a Abstract: "This paper describes the derivation of a parallel program from a nondeterministic sequential program using a bottom-up parser as an example. The derivation procedure consists of two stages: exploitation of AND-parallelism and exploitation of OR-parallelism. An interpreter of the sequential parser BUP [Matsumoto et al 83] is first transformed so that processes for the nodes in a parsing tree can run in parallel. Then, the resultant program is transformed so that a nondeterministic search of a parsing tree can be done in parallel. The former stage is performed by hand-simulation, and the latter is accomplished by the compiler of ANDOR-II, which is an AND/OR parallel logic programming language [Takeuchi et al. 89] | |
| 520 | 3 | |a The finally derived program, written in KL1 (Kernel Language of the FGCS Project), achieves an all solution search without side effects. It corresponds to an interpreter of PAX[Matsumoto et al 87], a revised parallel version of BUP. This correspondence shows that the derivation method proposed in this paper is effective in deriving efficient parallel programs. | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 757 |w (DE-604)BV010923438 |9 757 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007328766 | ||
Datensatz im Suchindex
| _version_ | 1804125443926786048 |
|---|---|
| any_adam_object | |
| author | Takahashi, Kazuko |
| author_facet | Takahashi, Kazuko |
| author_role | aut |
| author_sort | Takahashi, Kazuko |
| author_variant | k t kt |
| building | Verbundindex |
| bvnumber | BV010956654 |
| ctrlnum | (OCoLC)27482807 (DE-599)BVBBV010956654 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02109nam a2200313 cb4500</leader><controlfield tag="001">BV010956654</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960919s1992 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27482807</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010956654</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">Takahashi, Kazuko</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Derivation of the parallel bottom-up parser from the sequential parser</subfield><subfield code="c">by K. Takahashi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">18 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">757</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper describes the derivation of a parallel program from a nondeterministic sequential program using a bottom-up parser as an example. The derivation procedure consists of two stages: exploitation of AND-parallelism and exploitation of OR-parallelism. An interpreter of the sequential parser BUP [Matsumoto et al 83] is first transformed so that processes for the nodes in a parsing tree can run in parallel. Then, the resultant program is transformed so that a nondeterministic search of a parsing tree can be done in parallel. The former stage is performed by hand-simulation, and the latter is accomplished by the compiler of ANDOR-II, which is an AND/OR parallel logic programming language [Takeuchi et al. 89]</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The finally derived program, written in KL1 (Kernel Language of the FGCS Project), achieves an all solution search without side effects. It corresponds to an interpreter of PAX[Matsumoto et al 87], a revised parallel version of BUP. This correspondence shows that the derivation method proposed in this paper is effective in deriving efficient parallel programs.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</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">757</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">757</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007328766</subfield></datafield></record></collection> |
| id | DE-604.BV010956654 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:39Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007328766 |
| oclc_num | 27482807 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 18 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| 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 | Takahashi, Kazuko Verfasser aut Derivation of the parallel bottom-up parser from the sequential parser by K. Takahashi Tokyo, Japan 1992 18 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 757 Abstract: "This paper describes the derivation of a parallel program from a nondeterministic sequential program using a bottom-up parser as an example. The derivation procedure consists of two stages: exploitation of AND-parallelism and exploitation of OR-parallelism. An interpreter of the sequential parser BUP [Matsumoto et al 83] is first transformed so that processes for the nodes in a parsing tree can run in parallel. Then, the resultant program is transformed so that a nondeterministic search of a parsing tree can be done in parallel. The former stage is performed by hand-simulation, and the latter is accomplished by the compiler of ANDOR-II, which is an AND/OR parallel logic programming language [Takeuchi et al. 89] The finally derived program, written in KL1 (Kernel Language of the FGCS Project), achieves an all solution search without side effects. It corresponds to an interpreter of PAX[Matsumoto et al 87], a revised parallel version of BUP. This correspondence shows that the derivation method proposed in this paper is effective in deriving efficient parallel programs. Logic programming Parallel programming (Computer science) Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 757 (DE-604)BV010923438 757 |
| spellingShingle | Takahashi, Kazuko Derivation of the parallel bottom-up parser from the sequential parser Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Logic programming Parallel programming (Computer science) |
| title | Derivation of the parallel bottom-up parser from the sequential parser |
| title_auth | Derivation of the parallel bottom-up parser from the sequential parser |
| title_exact_search | Derivation of the parallel bottom-up parser from the sequential parser |
| title_full | Derivation of the parallel bottom-up parser from the sequential parser by K. Takahashi |
| title_fullStr | Derivation of the parallel bottom-up parser from the sequential parser by K. Takahashi |
| title_full_unstemmed | Derivation of the parallel bottom-up parser from the sequential parser by K. Takahashi |
| title_short | Derivation of the parallel bottom-up parser from the sequential parser |
| title_sort | derivation of the parallel bottom up parser from the sequential parser |
| topic | Logic programming Parallel programming (Computer science) |
| topic_facet | Logic programming Parallel programming (Computer science) |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT takahashikazuko derivationoftheparallelbottomupparserfromthesequentialparser |