Distributed Computing on Core-Periphery Networks: Axiom-Based Design

C Avin, M Borokhovich, Z Lotker, David Peleg

Research output: Contribution to journalConference articlepeer-review

Abstract

Inspired by social networks and complex systems, we propose a core-periphery network architecture that supports fast computation for many distributed algorithms and is robust and efficient in 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 (e.g., MST, sparse matrix multiplication, etc.). We also show the minimality 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)399-410
Number of pages12
JournalICALP: Proceedings of Int. Colloquium on Automata, Languages and Programming
Volume8573
StatePublished - 2014
Event41st International Colloquium on Automata, Languages and Programming - Copenhagen, DENMARK
Duration: 8 Jul 201411 Jul 2014

Fingerprint

Dive into the research topics of 'Distributed Computing on Core-Periphery Networks: Axiom-Based Design'. Together they form a unique fingerprint.

Cite this