Sciweavers

33 search results - page 5 / 7
» Heaps and Stacks in Distributed Shared Memory
Sort
View
SPDP
1993
IEEE
13 years 9 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
C++
1994
132views more  C++ 1994»
13 years 6 months ago
ASX: An Object-Oriented Framework for Developing Distributed Applications
The ADAPTIVE Service eXecutive (ASX) is a highly modular and extensible object-oriented framework that simplifies the development and configuration of distributed applications on ...
Douglas C. Schmidt
PDP
2009
IEEE
14 years 11 days ago
High Throughput Intra-Node MPI Communication with Open-MX
Abstract—The increasing number of cores per node in highperformance computing requires an efficient intra-node MPI communication subsystem. Most existing MPI implementations rel...
Brice Goglin
DCOSS
2006
Springer
13 years 9 months ago
Y-Threads: Supporting Concurrency in Wireless Sensor Networks
Abstract. Resource constrained systems often are programmed using an eventbased model. Many applications do not lend themselves well to an event-based approach, but preemptive mult...
Christopher Nitta, Raju Pandey, Yann Ramin
OPODIS
2010
13 years 3 months ago
An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...
Danny Hendler, Shay Kutten, Erez Michalak