An intensional parallel processing language for applications programming:
Abstract: "Parallel programming languages fall into two classes, the implicitly parallel langugaes and the explicitly parallel languages. We will consider the implicitly parallel languages. The explicitly parallel languages are important in that they are motivated by implementation consideratio...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Menlo Park, Calif.
1989
|
| Schriftenreihe: | Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL
89,1 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Parallel programming languages fall into two classes, the implicitly parallel langugaes and the explicitly parallel languages. We will consider the implicitly parallel languages. The explicitly parallel languages are important in that they are motivated by implementation considerations. Compiler technology is relatively simple in this context. As a result we see a rapid proliferation of explicitly parallel languages on multi-processor architectures. This has important consequences for parallel processing in the short-term. The implicitly parallel languages are equally important in that they favor the applications software. The software developed is more portable and maintainable over a software life cycle that can easily extend over successive generations of multi-processor architectures This has important consequences for the long-term success of parallel processing. Languages that are not based on a sequential model of computation can exhibit significant amounts of implicit parallelism. The declaritive programming languages are therefore important parallel programming languages. Within the declaritive paradigm we feel that the languages based on intensional logic are unique in that they permit data structures such are arrays, lists and trees to be implemented in a manner that is easily distributed. To illustrate the concepts we have chosen a particular language, namely, Lucid. However the same principles apply to other implicitly parallel languages Lucid's simplicity and semantic elegance make possible the inclusion of a non-trivial application program -- an adaptive solution to the n-body problem. We present an analysis of the implicit parallelism available in such a program and show ways in which we can harness this parallelism. |
| Beschreibung: | 27 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009257970 | ||
| 003 | DE-604 | ||
| 005 | 19950516 | ||
| 007 | t | ||
| 008 | 940313s1989 d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)20787125 | ||
| 035 | |a (DE-599)BVBBV009257970 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Ashcroft, Edward A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An intensional parallel processing language for applications programming |c by E. A. Ashcroft and A. A. Faustini and R. Jagannathan |
| 264 | 1 | |a Menlo Park, Calif. |c 1989 | |
| 300 | |a 27 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL |v 89,1 | |
| 520 | 3 | |a Abstract: "Parallel programming languages fall into two classes, the implicitly parallel langugaes and the explicitly parallel languages. We will consider the implicitly parallel languages. The explicitly parallel languages are important in that they are motivated by implementation considerations. Compiler technology is relatively simple in this context. As a result we see a rapid proliferation of explicitly parallel languages on multi-processor architectures. This has important consequences for parallel processing in the short-term. The implicitly parallel languages are equally important in that they favor the applications software. The software developed is more portable and maintainable over a software life cycle that can easily extend over successive generations of multi-processor architectures | |
| 520 | 3 | |a This has important consequences for the long-term success of parallel processing. Languages that are not based on a sequential model of computation can exhibit significant amounts of implicit parallelism. The declaritive programming languages are therefore important parallel programming languages. Within the declaritive paradigm we feel that the languages based on intensional logic are unique in that they permit data structures such are arrays, lists and trees to be implemented in a manner that is easily distributed. To illustrate the concepts we have chosen a particular language, namely, Lucid. However the same principles apply to other implicitly parallel languages | |
| 520 | 3 | |a Lucid's simplicity and semantic elegance make possible the inclusion of a non-trivial application program -- an adaptive solution to the n-body problem. We present an analysis of the implicit parallelism available in such a program and show ways in which we can harness this parallelism. | |
| 650 | 4 | |a Compilers (Computer programs) | |
| 650 | 4 | |a Parallel programming (Electronic computers) | |
| 700 | 1 | |a Faustini, A. A. |e Verfasser |4 aut | |
| 700 | 1 | |a Jagannathan, Rangaswamy |e Verfasser |4 aut | |
| 830 | 0 | |a Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL |v 89,1 |w (DE-604)BV008930658 |9 89,1 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006160076 | ||
Datensatz im Suchindex
| _version_ | 1804123705031262208 |
|---|---|
| any_adam_object | |
| author | Ashcroft, Edward A. Faustini, A. A. Jagannathan, Rangaswamy |
| author_facet | Ashcroft, Edward A. Faustini, A. A. Jagannathan, Rangaswamy |
| author_role | aut aut aut |
| author_sort | Ashcroft, Edward A. |
| author_variant | e a a ea eaa a a f aa aaf r j rj |
| building | Verbundindex |
| bvnumber | BV009257970 |
| ctrlnum | (OCoLC)20787125 (DE-599)BVBBV009257970 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02958nam a2200349 cb4500</leader><controlfield tag="001">BV009257970</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19950516 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1989 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)20787125</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009257970</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">Ashcroft, Edward A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An intensional parallel processing language for applications programming</subfield><subfield code="c">by E. A. Ashcroft and A. A. Faustini and R. Jagannathan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Menlo Park, Calif.</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">27 S.</subfield><subfield code="b">graph. Darst.</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">Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL</subfield><subfield code="v">89,1</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Parallel programming languages fall into two classes, the implicitly parallel langugaes and the explicitly parallel languages. We will consider the implicitly parallel languages. The explicitly parallel languages are important in that they are motivated by implementation considerations. Compiler technology is relatively simple in this context. As a result we see a rapid proliferation of explicitly parallel languages on multi-processor architectures. This has important consequences for parallel processing in the short-term. The implicitly parallel languages are equally important in that they favor the applications software. The software developed is more portable and maintainable over a software life cycle that can easily extend over successive generations of multi-processor architectures</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This has important consequences for the long-term success of parallel processing. Languages that are not based on a sequential model of computation can exhibit significant amounts of implicit parallelism. The declaritive programming languages are therefore important parallel programming languages. Within the declaritive paradigm we feel that the languages based on intensional logic are unique in that they permit data structures such are arrays, lists and trees to be implemented in a manner that is easily distributed. To illustrate the concepts we have chosen a particular language, namely, Lucid. However the same principles apply to other implicitly parallel languages</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Lucid's simplicity and semantic elegance make possible the inclusion of a non-trivial application program -- an adaptive solution to the n-body problem. We present an analysis of the implicit parallelism available in such a program and show ways in which we can harness this parallelism.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Compilers (Computer programs)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Electronic computers)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Faustini, A. A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jagannathan, Rangaswamy</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL</subfield><subfield code="v">89,1</subfield><subfield code="w">(DE-604)BV008930658</subfield><subfield code="9">89,1</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006160076</subfield></datafield></record></collection> |
| id | DE-604.BV009257970 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:34:01Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006160076 |
| oclc_num | 20787125 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 27 S. graph. Darst. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series | Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL |
| series2 | Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL |
| spelling | Ashcroft, Edward A. Verfasser aut An intensional parallel processing language for applications programming by E. A. Ashcroft and A. A. Faustini and R. Jagannathan Menlo Park, Calif. 1989 27 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL 89,1 Abstract: "Parallel programming languages fall into two classes, the implicitly parallel langugaes and the explicitly parallel languages. We will consider the implicitly parallel languages. The explicitly parallel languages are important in that they are motivated by implementation considerations. Compiler technology is relatively simple in this context. As a result we see a rapid proliferation of explicitly parallel languages on multi-processor architectures. This has important consequences for parallel processing in the short-term. The implicitly parallel languages are equally important in that they favor the applications software. The software developed is more portable and maintainable over a software life cycle that can easily extend over successive generations of multi-processor architectures This has important consequences for the long-term success of parallel processing. Languages that are not based on a sequential model of computation can exhibit significant amounts of implicit parallelism. The declaritive programming languages are therefore important parallel programming languages. Within the declaritive paradigm we feel that the languages based on intensional logic are unique in that they permit data structures such are arrays, lists and trees to be implemented in a manner that is easily distributed. To illustrate the concepts we have chosen a particular language, namely, Lucid. However the same principles apply to other implicitly parallel languages Lucid's simplicity and semantic elegance make possible the inclusion of a non-trivial application program -- an adaptive solution to the n-body problem. We present an analysis of the implicit parallelism available in such a program and show ways in which we can harness this parallelism. Compilers (Computer programs) Parallel programming (Electronic computers) Faustini, A. A. Verfasser aut Jagannathan, Rangaswamy Verfasser aut Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL 89,1 (DE-604)BV008930658 89,1 |
| spellingShingle | Ashcroft, Edward A. Faustini, A. A. Jagannathan, Rangaswamy An intensional parallel processing language for applications programming Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL Compilers (Computer programs) Parallel programming (Electronic computers) |
| title | An intensional parallel processing language for applications programming |
| title_auth | An intensional parallel processing language for applications programming |
| title_exact_search | An intensional parallel processing language for applications programming |
| title_full | An intensional parallel processing language for applications programming by E. A. Ashcroft and A. A. Faustini and R. Jagannathan |
| title_fullStr | An intensional parallel processing language for applications programming by E. A. Ashcroft and A. A. Faustini and R. Jagannathan |
| title_full_unstemmed | An intensional parallel processing language for applications programming by E. A. Ashcroft and A. A. Faustini and R. Jagannathan |
| title_short | An intensional parallel processing language for applications programming |
| title_sort | an intensional parallel processing language for applications programming |
| topic | Compilers (Computer programs) Parallel programming (Electronic computers) |
| topic_facet | Compilers (Computer programs) Parallel programming (Electronic computers) |
| volume_link | (DE-604)BV008930658 |
| work_keys_str_mv | AT ashcroftedwarda anintensionalparallelprocessinglanguageforapplicationsprogramming AT faustiniaa anintensionalparallelprocessinglanguageforapplicationsprogramming AT jagannathanrangaswamy anintensionalparallelprocessinglanguageforapplicationsprogramming |