The derivation of distributed termination detection algorithms from garbage collection schemes View Full Text


Ontology type: schema:Chapter      Open Access: True


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/bfb0035101

DOI

http://dx.doi.org/10.1007/bfb0035101

DIMENSIONS

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


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/0804", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Data Format", 
        "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/bfb0035101", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-54151-6", 
        "978-3-540-47471-5"
      ], 
      "name": "PARLE '91 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"
    ], 
    "name": "The derivation of distributed termination detection algorithms from garbage collection schemes", 
    "pagination": "137-149", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1018725791"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bfb0035101"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/bfb0035101", 
      "https://app.dimensions.ai/details/publication/pub.1018725791"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:21", 
    "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_377.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/bfb0035101"
  }
]
 

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/bfb0035101'

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/bfb0035101'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/bfb0035101'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/bfb0035101'


 

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

105 TRIPLES      23 PREDICATES      51 URIs      44 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/bfb0035101 schema:about anzsrc-for:08
2 anzsrc-for:0804
3 schema:author N27d8c78963df46e7bf1bce6a53406db7
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 Nea6f51fcddb14b3c97c45400f40b35d0
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf N7943f6c627ff4b22a9b812a63608610f
12 schema:keywords algorithm
13 collection algorithm
14 collection problem
15 collection scheme
16 collector
17 computation
18 counting garbage collectors
19 counting protocol
20 derivation
21 detection algorithm
22 detection problem
23 example
24 garbage collection problem
25 garbage collection scheme
26 garbage collector
27 instances
28 marks
29 problem
30 protocol
31 reference counting protocol
32 scheme
33 termination detection algorithm
34 termination detection problem
35 transformation
36 types
37 schema:name The derivation of distributed termination detection algorithms from garbage collection schemes
38 schema:pagination 137-149
39 schema:productId N37b816fcae834dce83b744a191333d48
40 N5989c76b2d0a438fb0caa7077962b7a5
41 schema:publisher N089f364bb9c34d1f90e531916ae84384
42 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018725791
43 https://doi.org/10.1007/bfb0035101
44 schema:sdDatePublished 2022-01-01T19:21
45 schema:sdLicense https://scigraph.springernature.com/explorer/license/
46 schema:sdPublisher N9637c9c268cb44aeb240d3d7500c8055
47 schema:url https://doi.org/10.1007/bfb0035101
48 sgo:license sg:explorer/license/
49 sgo:sdDataset chapters
50 rdf:type schema:Chapter
51 N089f364bb9c34d1f90e531916ae84384 schema:name Springer Nature
52 rdf:type schema:Organisation
53 N17846a397a7d4a9580bd32ed30b9d885 rdf:first N5441cb6836e548ff9c7ecb05fe38d3ca
54 rdf:rest rdf:nil
55 N27d8c78963df46e7bf1bce6a53406db7 rdf:first sg:person.016642327761.12
56 rdf:rest N493f31d0e0ce4454879b416c27bfd694
57 N37b816fcae834dce83b744a191333d48 schema:name dimensions_id
58 schema:value pub.1018725791
59 rdf:type schema:PropertyValue
60 N493f31d0e0ce4454879b416c27bfd694 rdf:first sg:person.012317614157.00
61 rdf:rest rdf:nil
62 N5441cb6836e548ff9c7ecb05fe38d3ca schema:familyName Rem
63 schema:givenName Martin
64 rdf:type schema:Person
65 N5989c76b2d0a438fb0caa7077962b7a5 schema:name doi
66 schema:value 10.1007/bfb0035101
67 rdf:type schema:PropertyValue
68 N7943f6c627ff4b22a9b812a63608610f schema:isbn 978-3-540-47471-5
69 978-3-540-54151-6
70 schema:name PARLE '91 Parallel Architectures and Languages Europe
71 rdf:type schema:Book
72 N80c597d945664013a439f38110a96546 rdf:first Nae672240665e4ee78085d3db8c5087ad
73 rdf:rest N17846a397a7d4a9580bd32ed30b9d885
74 N9637c9c268cb44aeb240d3d7500c8055 schema:name Springer Nature - SN SciGraph project
75 rdf:type schema:Organization
76 Nae672240665e4ee78085d3db8c5087ad schema:familyName van Leeuwen
77 schema:givenName Jan
78 rdf:type schema:Person
79 Nb2b101ccc9674a20ba2f48d769ff5f95 schema:familyName Aarts
80 schema:givenName Emile H. L.
81 rdf:type schema:Person
82 Nea6f51fcddb14b3c97c45400f40b35d0 rdf:first Nb2b101ccc9674a20ba2f48d769ff5f95
83 rdf:rest N80c597d945664013a439f38110a96546
84 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
85 schema:name Information and Computing Sciences
86 rdf:type schema:DefinedTerm
87 anzsrc-for:0804 schema:inDefinedTermSet anzsrc-for:
88 schema:name Data Format
89 rdf:type schema:DefinedTerm
90 sg:person.012317614157.00 schema:affiliation grid-institutes:grid.7645.0
91 schema:familyName Mattern
92 schema:givenName Friedemann
93 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012317614157.00
94 rdf:type schema:Person
95 sg:person.016642327761.12 schema:affiliation grid-institutes:grid.5477.1
96 schema:familyName Tel
97 schema:givenName Gerard
98 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016642327761.12
99 rdf:type schema:Person
100 grid-institutes:grid.5477.1 schema:alternateName Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands
101 schema:name Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands
102 rdf:type schema:Organization
103 grid-institutes:grid.7645.0 schema:alternateName Department of Computer Science, Kaiserslautern University, P.O. Box 3049, D 6750, Kaiserslautern, Fed. Rep. Germany
104 schema:name Department of Computer Science, Kaiserslautern University, P.O. Box 3049, D 6750, Kaiserslautern, Fed. Rep. Germany
105 rdf:type schema:Organization
 




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


...