Arrow Research search
Back to FOCS

FOCS 1990

Network Synchronization with Polylogarithmic Overhead

Conference Paper Accepted Paper Algorithms and Complexity ยท Theoretical Computer Science

Abstract

The synchronizer is a simulation methodology for simulating a synchronous network by an asynchronous one, thus enabling the execution of a synchronous algorithm on an asynchronous network. Previously known synchronizers require each processor in the network to participate in each pulse of the synchronization process. The resulting communication overhead depends linearly on the number n of network nodes. A synchronizer with overhead only polylogarithmically dependent on n is introduced. This synchronizer can also be realized with polylog(n) space. The polylog-overhead synchronizer is based on involving only the relevant portions of the network in the synchronization process. >

Authors

Keywords

  • Synchronization
  • Pulse measurements
  • Algorithm design and analysis
  • Pulse generation
  • Clocks
  • Mathematics
  • Contracts
  • Protocols
  • ARPANET
  • Career development
  • Portion Of Network
  • Synchronization Algorithm
  • Global Status
  • Network Size
  • Finite Time
  • Complexity Measures
  • Network Algorithm
  • Subtree
  • Complex Communication
  • Breadth-first Search
  • Concept Of Safety
  • Deadlock
  • Postconditioning

Context

Venue
IEEE Symposium on Foundations of Computer Science
Archive span
1975-2025
Indexed papers
3809
Paper id
584541472105984226
v2026.09.13