Sciweavers

246 search results - page 4 / 50
» Possibility and Impossibility Results in a Shared Memory Env...
Sort
View
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
WSC
2001
14 years 11 months ago
Use of DaSSF in a scalable multiprocessor wireless simulation architecture
The problem of efficient load distribution and scaling of large-scale wireless communication system simulation on multiprocessor architectures (both shared memory and cluster arra...
Trefor J. Delve, Nathan Smith
DEXAW
2002
IEEE
133views Database» more  DEXAW 2002»
15 years 2 months ago
ESOW: Parallel/Distributed Programming on the Web
This paper presents an environment for supporting parallel/distributed programming using Java with RMI and RMI-IIOP (CORBA). The environment implements the notion of Shared Object...
Denivaldo Lopes, Slimane Hammoudi, Zair Abdelouaha...
DATE
2000
IEEE
94views Hardware» more  DATE 2000»
15 years 2 months ago
Shared Memory Implementations of Synchronous Dataflow Specifications
There has been a proliferation of block-diagram environments for specifying and prototyping DSP systems. These include tools from academia like Ptolemy [3], and GRAPE [7], and com...
Praveen K. Murthy, Shuvra S. Bhattacharyya
SPDP
1993
IEEE
15 years 1 months ago
How to Share an Object: A Fast Timing-Based Solution
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
Rajeev Alur, Gadi Taubenfeld