Distributed Control Algorithms (Selected Topics) View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

1993

AUTHORS

Friedemann Mattern

ABSTRACT

The paper presents several algorithmic solutions to typical problems from the theory of distributed computing. The following topics are treated: Distributed approximation, leader election, routing tables for shortest paths, termination detection, parallel graph traversal, information dissemination, consistent snapshot computation. Concepts like atomic actions, message driven computations, time diagrams, and consistent cuts are introduced and references to the literature for further reading are given. More... »

PAGES

167-185

Book

TITLE

Parallel Computing on Distributed Memory Multiprocessors

ISBN

978-3-642-63460-4
978-3-642-58066-6

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-58066-6_9

DOI

http://dx.doi.org/10.1007/978-3-642-58066-6_9

DIMENSIONS

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


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/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "FB Informatik, Universit\u00e4t des Saarlandes, Im Stadtwald 36, D 6600, Saarbr\u00fccken, Fed. Rep. Germany", 
          "id": "http://www.grid.ac/institutes/grid.11749.3a", 
          "name": [
            "FB Informatik, Universit\u00e4t des Saarlandes, Im Stadtwald 36, D 6600, Saarbr\u00fccken, 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": "1993", 
    "datePublishedReg": "1993-01-01", 
    "description": "The paper presents several algorithmic solutions to typical problems from the theory of distributed computing. The following topics are treated: Distributed approximation, leader election, routing tables for shortest paths, termination detection, parallel graph traversal, information dissemination, consistent snapshot computation. Concepts like atomic actions, message driven computations, time diagrams, and consistent cuts are introduced and references to the literature for further reading are given.", 
    "editor": [
      {
        "familyName": "\u00d6zg\u00fcner", 
        "givenName": "F\u00fcsun", 
        "type": "Person"
      }, 
      {
        "familyName": "Er\u00e7al", 
        "givenName": "Fikret", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-58066-6_9", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-642-63460-4", 
        "978-3-642-58066-6"
      ], 
      "name": "Parallel Computing on Distributed Memory Multiprocessors", 
      "type": "Book"
    }, 
    "keywords": [
      "parallel graph traversal", 
      "termination detection", 
      "graph traversal", 
      "algorithmic solution", 
      "consistent cuts", 
      "atomic actions", 
      "snapshot computation", 
      "information dissemination", 
      "shortest path", 
      "leader election", 
      "control algorithm", 
      "typical problems", 
      "computation", 
      "computing", 
      "time diagrams", 
      "traversal", 
      "algorithm", 
      "messages", 
      "further reading", 
      "path", 
      "table", 
      "detection", 
      "topic", 
      "concept", 
      "dissemination", 
      "solution", 
      "diagram", 
      "approximation", 
      "reference", 
      "literature", 
      "cut", 
      "theory", 
      "reading", 
      "action", 
      "elections", 
      "problem", 
      "paper", 
      "consistent snapshot computation"
    ], 
    "name": "Distributed Control Algorithms (Selected Topics)", 
    "pagination": "167-185", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1029261667"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-58066-6_9"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-58066-6_9", 
      "https://app.dimensions.ai/details/publication/pub.1029261667"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-01-01T19:27", 
    "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_8.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-642-58066-6_9"
  }
]
 

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-642-58066-6_9'

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-642-58066-6_9'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-58066-6_9'

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-642-58066-6_9'


 

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

103 TRIPLES      23 PREDICATES      64 URIs      57 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-58066-6_9 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N233282a38a0d4b1494a09593c564307c
4 schema:datePublished 1993
5 schema:datePublishedReg 1993-01-01
6 schema:description The paper presents several algorithmic solutions to typical problems from the theory of distributed computing. The following topics are treated: Distributed approximation, leader election, routing tables for shortest paths, termination detection, parallel graph traversal, information dissemination, consistent snapshot computation. Concepts like atomic actions, message driven computations, time diagrams, and consistent cuts are introduced and references to the literature for further reading are given.
7 schema:editor Nb87800ba9bbb460787856f650f98309a
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf N0b42b5e22ca6487a90ca55fa61ed1e8e
12 schema:keywords action
13 algorithm
14 algorithmic solution
15 approximation
16 atomic actions
17 computation
18 computing
19 concept
20 consistent cuts
21 consistent snapshot computation
22 control algorithm
23 cut
24 detection
25 diagram
26 dissemination
27 elections
28 further reading
29 graph traversal
30 information dissemination
31 leader election
32 literature
33 messages
34 paper
35 parallel graph traversal
36 path
37 problem
38 reading
39 reference
40 shortest path
41 snapshot computation
42 solution
43 table
44 termination detection
45 theory
46 time diagrams
47 topic
48 traversal
49 typical problems
50 schema:name Distributed Control Algorithms (Selected Topics)
51 schema:pagination 167-185
52 schema:productId N3a898e40dc314b24b569d3fcd360923d
53 Nbc5b3ad6ffb04c48baa852ed4b5cebe9
54 schema:publisher N4c6a1946e29c40a59f32b4f52cc9e941
55 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029261667
56 https://doi.org/10.1007/978-3-642-58066-6_9
57 schema:sdDatePublished 2022-01-01T19:27
58 schema:sdLicense https://scigraph.springernature.com/explorer/license/
59 schema:sdPublisher N85b115cabd524c60bb944c78ea291bc9
60 schema:url https://doi.org/10.1007/978-3-642-58066-6_9
61 sgo:license sg:explorer/license/
62 sgo:sdDataset chapters
63 rdf:type schema:Chapter
64 N0b42b5e22ca6487a90ca55fa61ed1e8e schema:isbn 978-3-642-58066-6
65 978-3-642-63460-4
66 schema:name Parallel Computing on Distributed Memory Multiprocessors
67 rdf:type schema:Book
68 N233282a38a0d4b1494a09593c564307c rdf:first sg:person.012317614157.00
69 rdf:rest rdf:nil
70 N3a898e40dc314b24b569d3fcd360923d schema:name dimensions_id
71 schema:value pub.1029261667
72 rdf:type schema:PropertyValue
73 N4c6a1946e29c40a59f32b4f52cc9e941 schema:name Springer Nature
74 rdf:type schema:Organisation
75 N54ffe5e6559a44daa14fb553bca68bfc rdf:first Nebe3b33c7e074286a120449ec6be02f8
76 rdf:rest rdf:nil
77 N68198b757eac48eaabf67ea74d63e7b3 schema:familyName Özgüner
78 schema:givenName Füsun
79 rdf:type schema:Person
80 N85b115cabd524c60bb944c78ea291bc9 schema:name Springer Nature - SN SciGraph project
81 rdf:type schema:Organization
82 Nb87800ba9bbb460787856f650f98309a rdf:first N68198b757eac48eaabf67ea74d63e7b3
83 rdf:rest N54ffe5e6559a44daa14fb553bca68bfc
84 Nbc5b3ad6ffb04c48baa852ed4b5cebe9 schema:name doi
85 schema:value 10.1007/978-3-642-58066-6_9
86 rdf:type schema:PropertyValue
87 Nebe3b33c7e074286a120449ec6be02f8 schema:familyName Erçal
88 schema:givenName Fikret
89 rdf:type schema:Person
90 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
91 schema:name Information and Computing Sciences
92 rdf:type schema:DefinedTerm
93 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
94 schema:name Computation Theory and Mathematics
95 rdf:type schema:DefinedTerm
96 sg:person.012317614157.00 schema:affiliation grid-institutes:grid.11749.3a
97 schema:familyName Mattern
98 schema:givenName Friedemann
99 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012317614157.00
100 rdf:type schema:Person
101 grid-institutes:grid.11749.3a schema:alternateName FB Informatik, Universität des Saarlandes, Im Stadtwald 36, D 6600, Saarbrücken, Fed. Rep. Germany
102 schema:name FB Informatik, Universität des Saarlandes, Im Stadtwald 36, D 6600, Saarbrücken, Fed. Rep. Germany
103 rdf:type schema:Organization
 




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


...