A Novel Distributed Algorithm for High-Throughput and Scalable Gossiping View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2001-06-12

AUTHORS

Vincenzo De Florio , Geert Deconinck , Rudy Lauwereins

ABSTRACT

A family of gossiping algorithms depending on a combinatorial parameter is introduced, formalized, and discussed. Three members are analyzed. It is shown that, depending on the pattern of the parameter, gossiping can use from O(N2) to O(N) time, N being the number of communicating members. The last and best-performing algorithm, whose activity follows the execution pattern of pipelined hardware processors, is shown to exhibit high throughput and efficiency that are constant with respect to N. This translates in unlimited scalability for the corresponding gossiping service provided by this algorithm. More... »

PAGES

313-322

References to SciGraph publications

Book

TITLE

High Performance Computing and Networking

ISBN

978-3-540-67553-2
978-3-540-45492-2

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-45492-6_31

DOI

http://dx.doi.org/10.1007/3-540-45492-6_31

DIMENSIONS

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


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/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "type": "DefinedTerm"
      }, 
      {
        "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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "KU Leuven", 
          "id": "https://www.grid.ac/institutes/grid.5596.f", 
          "name": [
            "Electrical Engineering Department, ACCA Division, Katholieke Universiteit Leuven, Kardinaal Mercierlaan 94, B-3001, Heverlee, Belgium"
          ], 
          "type": "Organization"
        }, 
        "familyName": "De Florio", 
        "givenName": "Vincenzo", 
        "id": "sg:person.013423720733.02", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013423720733.02"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "KU Leuven", 
          "id": "https://www.grid.ac/institutes/grid.5596.f", 
          "name": [
            "Electrical Engineering Department, ACCA Division, Katholieke Universiteit Leuven, Kardinaal Mercierlaan 94, B-3001, Heverlee, Belgium"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Deconinck", 
        "givenName": "Geert", 
        "id": "sg:person.01022745130.75", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01022745130.75"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "KU Leuven", 
          "id": "https://www.grid.ac/institutes/grid.5596.f", 
          "name": [
            "Electrical Engineering Department, ACCA Division, Katholieke Universiteit Leuven, Kardinaal Mercierlaan 94, B-3001, Heverlee, Belgium"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Lauwereins", 
        "givenName": "Rudy", 
        "id": "sg:person.015212207733.37", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015212207733.37"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1145/357172.357176", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1001982359"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1002/net.3230180406", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1034475756"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-48311-x_164", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1047930677", 
          "https://doi.org/10.1007/3-540-48311-x_164"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/3-540-48311-x_164", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1047930677", 
          "https://doi.org/10.1007/3-540-48311-x_164"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1049/ip-sen:19982441", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1056859182"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.4153/cmb-1972-081-0", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1072270113"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.4153/cmb-1972-081-0", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1072270113"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2001-06-12", 
    "datePublishedReg": "2001-06-12", 
    "description": "A family of gossiping algorithms depending on a combinatorial parameter is introduced, formalized, and discussed. Three members are analyzed. It is shown that, depending on the pattern of the parameter, gossiping can use from O(N2) to O(N) time, N being the number of communicating members. The last and best-performing algorithm, whose activity follows the execution pattern of pipelined hardware processors, is shown to exhibit high throughput and efficiency that are constant with respect to N. This translates in unlimited scalability for the corresponding gossiping service provided by this algorithm.", 
    "editor": [
      {
        "familyName": "Bubak", 
        "givenName": "Marian", 
        "type": "Person"
      }, 
      {
        "familyName": "Afsarmanesh", 
        "givenName": "Hamideh", 
        "type": "Person"
      }, 
      {
        "familyName": "Hertzberger", 
        "givenName": "Bob", 
        "type": "Person"
      }, 
      {
        "familyName": "Williams", 
        "givenName": "Roy", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-45492-6_31", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-67553-2", 
        "978-3-540-45492-2"
      ], 
      "name": "High Performance Computing and Networking", 
      "type": "Book"
    }, 
    "name": "A Novel Distributed Algorithm for High-Throughput and Scalable Gossiping", 
    "pagination": "313-322", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-45492-6_31"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "d50e5f8702dd1438a39a4d171faa514cd4f6c8fb4022a472d5f564e6a6753d67"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1044727960"
        ]
      }
    ], 
    "publisher": {
      "location": "Berlin, Heidelberg", 
      "name": "Springer Berlin Heidelberg", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-45492-6_31", 
      "https://app.dimensions.ai/details/publication/pub.1044727960"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-16T05:27", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000345_0000000345/records_64117_00000001.jsonl", 
    "type": "Chapter", 
    "url": "https://link.springer.com/10.1007%2F3-540-45492-6_31"
  }
]
 

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/3-540-45492-6_31'

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/3-540-45492-6_31'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-45492-6_31'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-45492-6_31'


 

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

110 TRIPLES      23 PREDICATES      31 URIs      19 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-45492-6_31 schema:about anzsrc-for:08
2 anzsrc-for:0801
3 schema:author N922ca68609a34035b512e349e8c191fe
4 schema:citation sg:pub.10.1007/3-540-48311-x_164
5 https://doi.org/10.1002/net.3230180406
6 https://doi.org/10.1049/ip-sen:19982441
7 https://doi.org/10.1145/357172.357176
8 https://doi.org/10.4153/cmb-1972-081-0
9 schema:datePublished 2001-06-12
10 schema:datePublishedReg 2001-06-12
11 schema:description A family of gossiping algorithms depending on a combinatorial parameter is introduced, formalized, and discussed. Three members are analyzed. It is shown that, depending on the pattern of the parameter, gossiping can use from O(N2) to O(N) time, N being the number of communicating members. The last and best-performing algorithm, whose activity follows the execution pattern of pipelined hardware processors, is shown to exhibit high throughput and efficiency that are constant with respect to N. This translates in unlimited scalability for the corresponding gossiping service provided by this algorithm.
12 schema:editor N518ad0eba0594d578531bcfcf81bb102
13 schema:genre chapter
14 schema:inLanguage en
15 schema:isAccessibleForFree false
16 schema:isPartOf N1d1bf3bec490461b82f80151f825baae
17 schema:name A Novel Distributed Algorithm for High-Throughput and Scalable Gossiping
18 schema:pagination 313-322
19 schema:productId N3b6f4702085f4968bfb5675c170a31d3
20 N5e860120f53540308a7a2c0cd1e43b98
21 Nb6ff4f30ed004e01bec5c8a26d5bf2f0
22 schema:publisher N0e4a8b086170426f80da120c3fca2c49
23 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044727960
24 https://doi.org/10.1007/3-540-45492-6_31
25 schema:sdDatePublished 2019-04-16T05:27
26 schema:sdLicense https://scigraph.springernature.com/explorer/license/
27 schema:sdPublisher Nc6c30961d35f4a55bdaf97dca2bf34be
28 schema:url https://link.springer.com/10.1007%2F3-540-45492-6_31
29 sgo:license sg:explorer/license/
30 sgo:sdDataset chapters
31 rdf:type schema:Chapter
32 N0e4a8b086170426f80da120c3fca2c49 schema:location Berlin, Heidelberg
33 schema:name Springer Berlin Heidelberg
34 rdf:type schema:Organisation
35 N1d1bf3bec490461b82f80151f825baae schema:isbn 978-3-540-45492-2
36 978-3-540-67553-2
37 schema:name High Performance Computing and Networking
38 rdf:type schema:Book
39 N3b6f4702085f4968bfb5675c170a31d3 schema:name dimensions_id
40 schema:value pub.1044727960
41 rdf:type schema:PropertyValue
42 N3bdcb6e9b9ae4af0bf73c264aa11169b schema:familyName Hertzberger
43 schema:givenName Bob
44 rdf:type schema:Person
45 N3c2bd2bd43aa400097a8914c39ff4231 schema:familyName Bubak
46 schema:givenName Marian
47 rdf:type schema:Person
48 N518ad0eba0594d578531bcfcf81bb102 rdf:first N3c2bd2bd43aa400097a8914c39ff4231
49 rdf:rest N5ae79aac63f24120a8ce36938419c2c7
50 N547717d6389945b79513a866039e5ee9 rdf:first Nfa788d7fa8cc40cfabe79932cf263b26
51 rdf:rest rdf:nil
52 N55499c4e238e48bfbe7031e39f1c99e2 rdf:first N3bdcb6e9b9ae4af0bf73c264aa11169b
53 rdf:rest N547717d6389945b79513a866039e5ee9
54 N5ae79aac63f24120a8ce36938419c2c7 rdf:first N5d900e84162b4f9b8d7da96db1e7f710
55 rdf:rest N55499c4e238e48bfbe7031e39f1c99e2
56 N5d900e84162b4f9b8d7da96db1e7f710 schema:familyName Afsarmanesh
57 schema:givenName Hamideh
58 rdf:type schema:Person
59 N5e860120f53540308a7a2c0cd1e43b98 schema:name doi
60 schema:value 10.1007/3-540-45492-6_31
61 rdf:type schema:PropertyValue
62 N5eb80bf7cab04948ba7afd9cea584cc7 rdf:first sg:person.015212207733.37
63 rdf:rest rdf:nil
64 N922ca68609a34035b512e349e8c191fe rdf:first sg:person.013423720733.02
65 rdf:rest N9d767f55329e413fa7473a4fc4e0ee9b
66 N9d767f55329e413fa7473a4fc4e0ee9b rdf:first sg:person.01022745130.75
67 rdf:rest N5eb80bf7cab04948ba7afd9cea584cc7
68 Nb6ff4f30ed004e01bec5c8a26d5bf2f0 schema:name readcube_id
69 schema:value d50e5f8702dd1438a39a4d171faa514cd4f6c8fb4022a472d5f564e6a6753d67
70 rdf:type schema:PropertyValue
71 Nc6c30961d35f4a55bdaf97dca2bf34be schema:name Springer Nature - SN SciGraph project
72 rdf:type schema:Organization
73 Nfa788d7fa8cc40cfabe79932cf263b26 schema:familyName Williams
74 schema:givenName Roy
75 rdf:type schema:Person
76 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
77 schema:name Information and Computing Sciences
78 rdf:type schema:DefinedTerm
79 anzsrc-for:0801 schema:inDefinedTermSet anzsrc-for:
80 schema:name Artificial Intelligence and Image Processing
81 rdf:type schema:DefinedTerm
82 sg:person.01022745130.75 schema:affiliation https://www.grid.ac/institutes/grid.5596.f
83 schema:familyName Deconinck
84 schema:givenName Geert
85 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01022745130.75
86 rdf:type schema:Person
87 sg:person.013423720733.02 schema:affiliation https://www.grid.ac/institutes/grid.5596.f
88 schema:familyName De Florio
89 schema:givenName Vincenzo
90 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013423720733.02
91 rdf:type schema:Person
92 sg:person.015212207733.37 schema:affiliation https://www.grid.ac/institutes/grid.5596.f
93 schema:familyName Lauwereins
94 schema:givenName Rudy
95 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015212207733.37
96 rdf:type schema:Person
97 sg:pub.10.1007/3-540-48311-x_164 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047930677
98 https://doi.org/10.1007/3-540-48311-x_164
99 rdf:type schema:CreativeWork
100 https://doi.org/10.1002/net.3230180406 schema:sameAs https://app.dimensions.ai/details/publication/pub.1034475756
101 rdf:type schema:CreativeWork
102 https://doi.org/10.1049/ip-sen:19982441 schema:sameAs https://app.dimensions.ai/details/publication/pub.1056859182
103 rdf:type schema:CreativeWork
104 https://doi.org/10.1145/357172.357176 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001982359
105 rdf:type schema:CreativeWork
106 https://doi.org/10.4153/cmb-1972-081-0 schema:sameAs https://app.dimensions.ai/details/publication/pub.1072270113
107 rdf:type schema:CreativeWork
108 https://www.grid.ac/institutes/grid.5596.f schema:alternateName KU Leuven
109 schema:name Electrical Engineering Department, ACCA Division, Katholieke Universiteit Leuven, Kardinaal Mercierlaan 94, B-3001, Heverlee, Belgium
110 rdf:type schema:Organization
 




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


...