The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes (Extended Abstract) View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1991

AUTHORS

Gerard Tel , Friedemann Mattern

ABSTRACT

It is shown that the termination detection problem for distributed computations can be modeled as an instance of the garbage collection problem. Consequently, algorithms for the termination detection problem are obtained by applying transformations to garbage collection algorithms. The transformation can be applied to collectors of the “mark-and-sweep” type as well as to reference counting garbage collectors. As an example, the scheme is used to transform the weighted reference counting protocol. More... »

PAGES

137-149

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-662-25209-3_10

DOI

http://dx.doi.org/10.1007/978-3-662-25209-3_10

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1032296317


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands", 
          "id": "http://www.grid.ac/institutes/grid.5477.1", 
          "name": [
            "Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Tel", 
        "givenName": "Gerard", 
        "id": "sg:person.016642327761.12", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016642327761.12"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, Kaiserslautern University, P.O. Box 3049, D 6750, Kaiserslautern, Fed. Rep. Germany", 
          "id": "http://www.grid.ac/institutes/grid.7645.0", 
          "name": [
            "Department of Computer Science, Kaiserslautern University, P.O. Box 3049, D 6750, Kaiserslautern, Fed. Rep. Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Mattern", 
        "givenName": "Friedemann", 
        "id": "sg:person.012317614157.00", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012317614157.00"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1991", 
    "datePublishedReg": "1991-01-01", 
    "description": "It is shown that the termination detection problem for distributed computations can be modeled as an instance of the garbage collection problem. Consequently, algorithms for the termination detection problem are obtained by applying transformations to garbage collection algorithms. The transformation can be applied to collectors of the \u201cmark-and-sweep\u201d type as well as to reference counting garbage collectors. As an example, the scheme is used to transform the weighted reference counting protocol.", 
    "editor": [
      {
        "familyName": "Aarts", 
        "givenName": "Emile H. L.", 
        "type": "Person"
      }, 
      {
        "familyName": "van Leeuwen", 
        "givenName": "Jan", 
        "type": "Person"
      }, 
      {
        "familyName": "Rem", 
        "givenName": "Martin", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-662-25209-3_10", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-662-23206-4", 
        "978-3-662-25209-3"
      ], 
      "name": "Parle \u201991 Parallel Architectures and Languages Europe", 
      "type": "Book"
    }, 
    "keywords": [
      "termination detection problem", 
      "detection problem", 
      "termination detection algorithm", 
      "garbage collection scheme", 
      "garbage collection problem", 
      "collection algorithm", 
      "detection algorithm", 
      "garbage collector", 
      "collection scheme", 
      "collection problem", 
      "algorithm", 
      "scheme", 
      "computation", 
      "counting protocol", 
      "protocol", 
      "instances", 
      "example", 
      "transformation", 
      "derivation", 
      "marks", 
      "collector", 
      "types", 
      "problem", 
      "counting garbage collectors", 
      "reference counting protocol", 
      "Distributed Termination Detection Algorithms"
    ], 
    "name": "The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes (Extended Abstract)", 
    "pagination": "137-149", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1032296317"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-662-25209-3_10"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-662-25209-3_10", 
      "https://app.dimensions.ai/details/publication/pub.1032296317"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:10", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/chapter/chapter_176.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-662-25209-3_10"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-662-25209-3_10'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-662-25209-3_10'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-662-25209-3_10'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-662-25209-3_10'


 

This table displays all metadata directly associated to this object as RDF triples.

106 TRIPLES      23 PREDICATES      52 URIs      45 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-662-25209-3_10 schema:about anzsrc-for:08
2 anzsrc-for:0801
3 schema:author N31b632a89694446f877f1ef5c7b1a945
4 schema:datePublished 1991
5 schema:datePublishedReg 1991-01-01
6 schema:description It is shown that the termination detection problem for distributed computations can be modeled as an instance of the garbage collection problem. Consequently, algorithms for the termination detection problem are obtained by applying transformations to garbage collection algorithms. The transformation can be applied to collectors of the “mark-and-sweep” type as well as to reference counting garbage collectors. As an example, the scheme is used to transform the weighted reference counting protocol.
7 schema:editor N6cc062ecdfb5437aa0e3f46014ffe3de
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N74e5fc8891064a42b2b1bc98dff4c9ba
12 schema:keywords Distributed Termination Detection Algorithms
13 algorithm
14 collection algorithm
15 collection problem
16 collection scheme
17 collector
18 computation
19 counting garbage collectors
20 counting protocol
21 derivation
22 detection algorithm
23 detection problem
24 example
25 garbage collection problem
26 garbage collection scheme
27 garbage collector
28 instances
29 marks
30 problem
31 protocol
32 reference counting protocol
33 scheme
34 termination detection algorithm
35 termination detection problem
36 transformation
37 types
38 schema:name The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes (Extended Abstract)
39 schema:pagination 137-149
40 schema:productId N02f0af43874445bc8423628d4cdb2303
41 N326d1a13824c46b3b9c0f76bedae7dca
42 schema:publisher Na4dd75219ec542bfb566a2aff0ddd87f
43 schema:sameAs https://app.dimensions.ai/details/publication/pub.1032296317
44 https://doi.org/10.1007/978-3-662-25209-3_10
45 schema:sdDatePublished 2022-01-01T19:10
46 schema:sdLicense https://scigraph.springernature.com/explorer/license/
47 schema:sdPublisher Nd94dc4767bd54787ba6b60347167143e
48 schema:url https://doi.org/10.1007/978-3-662-25209-3_10
49 sgo:license sg:explorer/license/
50 sgo:sdDataset chapters
51 rdf:type schema:Chapter
52 N02f0af43874445bc8423628d4cdb2303 schema:name dimensions_id
53 schema:value pub.1032296317
54 rdf:type schema:PropertyValue
55 N31b632a89694446f877f1ef5c7b1a945 rdf:first sg:person.016642327761.12
56 rdf:rest Ned28fb2ad0b846f2afb1aaf9268897ce
57 N326d1a13824c46b3b9c0f76bedae7dca schema:name doi
58 schema:value 10.1007/978-3-662-25209-3_10
59 rdf:type schema:PropertyValue
60 N6be32044b8e941cab6406a6a420de4fb schema:familyName Aarts
61 schema:givenName Emile H. L.
62 rdf:type schema:Person
63 N6cc062ecdfb5437aa0e3f46014ffe3de rdf:first N6be32044b8e941cab6406a6a420de4fb
64 rdf:rest Nd020fe9a20d44815b70f92bc2d7af155
65 N74e5fc8891064a42b2b1bc98dff4c9ba schema:isbn 978-3-662-23206-4
66 978-3-662-25209-3
67 schema:name Parle ’91 Parallel Architectures and Languages Europe
68 rdf:type schema:Book
69 Na4dd75219ec542bfb566a2aff0ddd87f schema:name Springer Nature
70 rdf:type schema:Organisation
71 Nafa51f6a3d924d9aaece6c1a67847356 schema:familyName Rem
72 schema:givenName Martin
73 rdf:type schema:Person
74 Nb9ad352ebcbe4bbf8afd859517c69590 rdf:first Nafa51f6a3d924d9aaece6c1a67847356
75 rdf:rest rdf:nil
76 Ncdfffa83cbf0432093ed686173d5cefd schema:familyName van Leeuwen
77 schema:givenName Jan
78 rdf:type schema:Person
79 Nd020fe9a20d44815b70f92bc2d7af155 rdf:first Ncdfffa83cbf0432093ed686173d5cefd
80 rdf:rest Nb9ad352ebcbe4bbf8afd859517c69590
81 Nd94dc4767bd54787ba6b60347167143e schema:name Springer Nature - SN SciGraph project
82 rdf:type schema:Organization
83 Ned28fb2ad0b846f2afb1aaf9268897ce rdf:first sg:person.012317614157.00
84 rdf:rest rdf:nil
85 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
86 schema:name Information and Computing Sciences
87 rdf:type schema:DefinedTerm
88 anzsrc-for:0801 schema:inDefinedTermSet anzsrc-for:
89 schema:name Artificial Intelligence and Image Processing
90 rdf:type schema:DefinedTerm
91 sg:person.012317614157.00 schema:affiliation grid-institutes:grid.7645.0
92 schema:familyName Mattern
93 schema:givenName Friedemann
94 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012317614157.00
95 rdf:type schema:Person
96 sg:person.016642327761.12 schema:affiliation grid-institutes:grid.5477.1
97 schema:familyName Tel
98 schema:givenName Gerard
99 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016642327761.12
100 rdf:type schema:Person
101 grid-institutes:grid.5477.1 schema:alternateName Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands
102 schema:name Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands
103 rdf:type schema:Organization
104 grid-institutes:grid.7645.0 schema:alternateName Department of Computer Science, Kaiserslautern University, P.O. Box 3049, D 6750, Kaiserslautern, Fed. Rep. Germany
105 schema:name Department of Computer Science, Kaiserslautern University, P.O. Box 3049, D 6750, Kaiserslautern, Fed. Rep. Germany
106 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...