Sciweavers

455 search results - page 4 / 91
» Asynchronous and deterministic objects
Sort
View
WDAG
2005
Springer
67views Algorithms» more  WDAG 2005»
13 years 11 months ago
What Can Be Implemented Anonymously?
Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? W...
Rachid Guerraoui, Eric Ruppert
ADAEUROPE
2005
Springer
13 years 11 months ago
Extending Ravenscar with CSP Channels
Abstract. The Ravenscar Profile is a restricted subset of the Ada tasking model, designed to meet the requirements of producing analysable and deterministic code. A central featur...
Diyaa-Addein Atiya, Steve King
PODC
1997
ACM
13 years 10 months ago
Determining Consensus Numbers
Conditions on a shared object type T are given that are both necessary and sufficient for wait-free n-process consensus to be solvable using objects of type T and registers. The co...
Eric Ruppert
ENTCS
1998
105views more  ENTCS 1998»
13 years 5 months ago
A Concurrent Object Calculus: Reduction and Typing
We obtain a new formalism for concurrent object-oriented languages by extending Abadi and Cardelli's imperative object calculus with operators for concurrency from the -calc...
Andrew D. Gordon, Paul D. Hankin
INFOCOM
2008
IEEE
14 years 6 days ago
Capacity of Asynchronous Random-Access Scheduling in Wireless Networks
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Mad...