Distributed computing on core–periphery networks: Axiom-based design

Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

Inspired by social networks and complex systems, we propose a core–periphery network architecture that supports fast computation for many distributed algorithms, is robust and uses a linear number of links. Rather than providing a concrete network model, we take an axiom-based design approach. We provide three intuitive and independent algorithmic axioms and prove that any network that satisfies all axioms enjoys an efficient algorithm for a range of tasks (such as MST, sparse matrix multiplication, and more). We also show the necessity of our axiom set: for networks that satisfy any subset of the axioms, the same efficiency cannot be guaranteed for any deterministic algorithm.

Original languageEnglish
Pages (from-to)51-67
Number of pages17
JournalJournal of Parallel and Distributed Computing
Volume99
DOIs
StatePublished - 1 Jan 2017
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2016 Elsevier Inc.

Funding

The authors were supported in part by the Israel Science Foundation (grant 1549/13 ).

FundersFunder number
Israel Science Foundation1549/13

    Keywords

    • Axiom-base design
    • Core–periphery networks
    • Distributed computing
    • Minimum spanning tree

    Fingerprint

    Dive into the research topics of 'Distributed computing on core–periphery networks: Axiom-based design'. Together they form a unique fingerprint.

    Cite this