Optimization of GHC programs:
Abstract: "Concurrent processes can be used both for programming computation and for programming storage. Previous implementations of (Flat) GHC, however, have been tuned for computation-intensive programs, and perform poorly for storage-intensive programs and demand-driven programs. This paper...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1989
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum
811 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Concurrent processes can be used both for programming computation and for programming storage. Previous implementations of (Flat) GHC, however, have been tuned for computation-intensive programs, and perform poorly for storage-intensive programs and demand-driven programs. This paper proposes an optimization technique for programs in which processes are almost always suspended. The technique is based on a mode system which is powerful enough to analyze bidirectional communication and streams of streams. The proposed technique is expected to expand the application areas of concurrent logic languages." |
| Beschreibung: | 8 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010972219 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960926s1989 |||| 00||| engod | ||
| 035 | |a (OCoLC)22697711 | ||
| 035 | |a (DE-599)BVBBV010972219 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Ueda, Kazunori |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Optimization of GHC programs |c by K. Ueda & M. Morita |
| 264 | 1 | |a Tokyo, Japan |c 1989 | |
| 300 | |a 8 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 memorandum |v 811 | |
| 520 | 3 | |a Abstract: "Concurrent processes can be used both for programming computation and for programming storage. Previous implementations of (Flat) GHC, however, have been tuned for computation-intensive programs, and perform poorly for storage-intensive programs and demand-driven programs. This paper proposes an optimization technique for programs in which processes are almost always suspended. The technique is based on a mode system which is powerful enough to analyze bidirectional communication and streams of streams. The proposed technique is expected to expand the application areas of concurrent logic languages." | |
| 650 | 4 | |a Computer programs | |
| 650 | 4 | |a Mathematical optimization | |
| 700 | 1 | |a Morita, Masao |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum |v 811 |w (DE-604)BV010943497 |9 811 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007341693 | ||
Datensatz im Suchindex
| _version_ | 1804125460308688896 |
|---|---|
| any_adam_object | |
| author | Ueda, Kazunori Morita, Masao |
| author_facet | Ueda, Kazunori Morita, Masao |
| author_role | aut aut |
| author_sort | Ueda, Kazunori |
| author_variant | k u ku m m mm |
| building | Verbundindex |
| bvnumber | BV010972219 |
| ctrlnum | (OCoLC)22697711 (DE-599)BVBBV010972219 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01618nam a2200313 cb4500</leader><controlfield tag="001">BV010972219</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960926s1989 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22697711</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010972219</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">Ueda, Kazunori</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimization of GHC programs</subfield><subfield code="c">by K. Ueda & M. Morita</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">8 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 memorandum</subfield><subfield code="v">811</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Concurrent processes can be used both for programming computation and for programming storage. Previous implementations of (Flat) GHC, however, have been tuned for computation-intensive programs, and perform poorly for storage-intensive programs and demand-driven programs. This paper proposes an optimization technique for programs in which processes are almost always suspended. The technique is based on a mode system which is powerful enough to analyze bidirectional communication and streams of streams. The proposed technique is expected to expand the application areas of concurrent logic languages."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Morita, Masao</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum</subfield><subfield code="v">811</subfield><subfield code="w">(DE-604)BV010943497</subfield><subfield code="9">811</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007341693</subfield></datafield></record></collection> |
| id | DE-604.BV010972219 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:55Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007341693 |
| oclc_num | 22697711 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 8 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum |
| spelling | Ueda, Kazunori Verfasser aut Optimization of GHC programs by K. Ueda & M. Morita Tokyo, Japan 1989 8 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum 811 Abstract: "Concurrent processes can be used both for programming computation and for programming storage. Previous implementations of (Flat) GHC, however, have been tuned for computation-intensive programs, and perform poorly for storage-intensive programs and demand-driven programs. This paper proposes an optimization technique for programs in which processes are almost always suspended. The technique is based on a mode system which is powerful enough to analyze bidirectional communication and streams of streams. The proposed technique is expected to expand the application areas of concurrent logic languages." Computer programs Mathematical optimization Morita, Masao Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum 811 (DE-604)BV010943497 811 |
| spellingShingle | Ueda, Kazunori Morita, Masao Optimization of GHC programs Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum Computer programs Mathematical optimization |
| title | Optimization of GHC programs |
| title_auth | Optimization of GHC programs |
| title_exact_search | Optimization of GHC programs |
| title_full | Optimization of GHC programs by K. Ueda & M. Morita |
| title_fullStr | Optimization of GHC programs by K. Ueda & M. Morita |
| title_full_unstemmed | Optimization of GHC programs by K. Ueda & M. Morita |
| title_short | Optimization of GHC programs |
| title_sort | optimization of ghc programs |
| topic | Computer programs Mathematical optimization |
| topic_facet | Computer programs Mathematical optimization |
| volume_link | (DE-604)BV010943497 |
| work_keys_str_mv | AT uedakazunori optimizationofghcprograms AT moritamasao optimizationofghcprograms |