Generation type garbage collection for parallel logic languages:
Abstract: "This paper presents a garbage collection (GC) method for parallel logic programming languages. Paralle logic languages require large amounts of data since logic variables can have only one value. Efficient memory management is important for an efficient language processor. In the par...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1989
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
512 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper presents a garbage collection (GC) method for parallel logic programming languages. Paralle logic languages require large amounts of data since logic variables can have only one value. Efficient memory management is important for an efficient language processor. In the parallel loge language Flat Guarded Horn Clauses (FGHC), the amount of live data is always small compared to the total amount of data allocated. These are two kinds of data: short-term and long-term. We concluded that garbage collection using only 2 generations best suits this kind of language. We call our garbage collection method "2-generation garbage collection" Short-term data is garbage collected back into the 1st generation garbage collection and long-term data is collected into the 2nd generation garbage collection. This method is efficient independent of the ratio of the amount of live data to heap size. When this ratio is high, our method is especially good, reducing the amount of data copied by a factor of 10, compared to simple copying garbage collection. |
| Beschreibung: | 14 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010948858 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960913s1989 d||| |||| 00||| engod | ||
| 035 | |a (OCoLC)22536664 | ||
| 035 | |a (DE-599)BVBBV010948858 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Ozawa, Toshihiro |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Generation type garbage collection for parallel logic languages |c T. Ozawa, A. Hosoi & A. Hattot |
| 264 | 1 | |a Tokyo, Japan |c 1989 | |
| 300 | |a 14 S. |b graph. Darst. | ||
| 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 512 | |
| 520 | 3 | |a Abstract: "This paper presents a garbage collection (GC) method for parallel logic programming languages. Paralle logic languages require large amounts of data since logic variables can have only one value. Efficient memory management is important for an efficient language processor. In the parallel loge language Flat Guarded Horn Clauses (FGHC), the amount of live data is always small compared to the total amount of data allocated. These are two kinds of data: short-term and long-term. We concluded that garbage collection using only 2 generations best suits this kind of language. We call our garbage collection method "2-generation garbage collection" | |
| 520 | 3 | |a Short-term data is garbage collected back into the 1st generation garbage collection and long-term data is collected into the 2nd generation garbage collection. This method is efficient independent of the ratio of the amount of live data to heap size. When this ratio is high, our method is especially good, reducing the amount of data copied by a factor of 10, compared to simple copying garbage collection. | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 700 | 1 | |a Hosoi, Akira |e Verfasser |4 aut | |
| 700 | 1 | |a Hattori, Akira |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 512 |w (DE-604)BV010923438 |9 512 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007322835 | ||
Datensatz im Suchindex
| _version_ | 1804125435796127744 |
|---|---|
| any_adam_object | |
| author | Ozawa, Toshihiro Hosoi, Akira Hattori, Akira |
| author_facet | Ozawa, Toshihiro Hosoi, Akira Hattori, Akira |
| author_role | aut aut aut |
| author_sort | Ozawa, Toshihiro |
| author_variant | t o to a h ah a h ah |
| building | Verbundindex |
| bvnumber | BV010948858 |
| ctrlnum | (OCoLC)22536664 (DE-599)BVBBV010948858 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02197nam a2200337 cb4500</leader><controlfield tag="001">BV010948858</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960913s1989 d||| |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22536664</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010948858</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">Ozawa, Toshihiro</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Generation type garbage collection for parallel logic languages</subfield><subfield code="c">T. Ozawa, A. Hosoi & A. Hattot</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">14 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">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">512</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper presents a garbage collection (GC) method for parallel logic programming languages. Paralle logic languages require large amounts of data since logic variables can have only one value. Efficient memory management is important for an efficient language processor. In the parallel loge language Flat Guarded Horn Clauses (FGHC), the amount of live data is always small compared to the total amount of data allocated. These are two kinds of data: short-term and long-term. We concluded that garbage collection using only 2 generations best suits this kind of language. We call our garbage collection method "2-generation garbage collection"</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Short-term data is garbage collected back into the 1st generation garbage collection and long-term data is collected into the 2nd generation garbage collection. This method is efficient independent of the ratio of the amount of live data to heap size. When this ratio is high, our method is especially good, reducing the amount of data copied by a factor of 10, compared to simple copying garbage collection.</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="700" ind1="1" ind2=" "><subfield code="a">Hosoi, Akira</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hattori, Akira</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 report</subfield><subfield code="v">512</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">512</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007322835</subfield></datafield></record></collection> |
| id | DE-604.BV010948858 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:01:31Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007322835 |
| oclc_num | 22536664 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 14 S. graph. Darst. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| 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 | Ozawa, Toshihiro Verfasser aut Generation type garbage collection for parallel logic languages T. Ozawa, A. Hosoi & A. Hattot Tokyo, Japan 1989 14 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 512 Abstract: "This paper presents a garbage collection (GC) method for parallel logic programming languages. Paralle logic languages require large amounts of data since logic variables can have only one value. Efficient memory management is important for an efficient language processor. In the parallel loge language Flat Guarded Horn Clauses (FGHC), the amount of live data is always small compared to the total amount of data allocated. These are two kinds of data: short-term and long-term. We concluded that garbage collection using only 2 generations best suits this kind of language. We call our garbage collection method "2-generation garbage collection" Short-term data is garbage collected back into the 1st generation garbage collection and long-term data is collected into the 2nd generation garbage collection. This method is efficient independent of the ratio of the amount of live data to heap size. When this ratio is high, our method is especially good, reducing the amount of data copied by a factor of 10, compared to simple copying garbage collection. Logic programming Parallel programming (Computer science) Hosoi, Akira Verfasser aut Hattori, Akira Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 512 (DE-604)BV010923438 512 |
| spellingShingle | Ozawa, Toshihiro Hosoi, Akira Hattori, Akira Generation type garbage collection for parallel logic languages Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Logic programming Parallel programming (Computer science) |
| title | Generation type garbage collection for parallel logic languages |
| title_auth | Generation type garbage collection for parallel logic languages |
| title_exact_search | Generation type garbage collection for parallel logic languages |
| title_full | Generation type garbage collection for parallel logic languages T. Ozawa, A. Hosoi & A. Hattot |
| title_fullStr | Generation type garbage collection for parallel logic languages T. Ozawa, A. Hosoi & A. Hattot |
| title_full_unstemmed | Generation type garbage collection for parallel logic languages T. Ozawa, A. Hosoi & A. Hattot |
| title_short | Generation type garbage collection for parallel logic languages |
| title_sort | generation type garbage collection for parallel logic languages |
| 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 ozawatoshihiro generationtypegarbagecollectionforparallellogiclanguages AT hosoiakira generationtypegarbagecollectionforparallellogiclanguages AT hattoriakira generationtypegarbagecollectionforparallellogiclanguages |