Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Distributed Computing manuscript No. (will be inserted by the editor)
 

Summary: Distributed Computing manuscript No.
(will be inserted by the editor)
James Aspnes Faith Ellen Fich Eric Ruppert
Relationships Between Broadcast and Shared Memory in
Reliable Anonymous Distributed Systems
the date of receipt and acceptance should be inserted later
Abstract We study the power of reliable anonymous
distributed systems, where processes do not fail, do not
have identifiers, and run identical programmes. We are
interested specifically in the relative powers of systems
with different communication mechanisms: anonymous
broadcast, read-write registers, or read-write registers
plus additional shared-memory objects. We show that a
system with anonymous broadcast can simulate a system
of shared-memory objects if and only if the objects sat-
isfy a property we call idemdicence; this result holds re-
gardless of whether either system is synchronous or asyn-
chronous. Conversely, the key to simulating anonymous
broadcast in anonymous shared memory is the ability to
count: broadcast can be simulated by an asynchronous

  

Source: Aspnes, James - Department of Computer Science, Yale University

 

Collections: Computer Technologies and Information Sciences