Sciweavers

286 search results - page 47 / 58
» Highly Concurrent Shared Storage
Sort
View
78
Voted
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
15 years 10 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
ISSAC
2007
Springer
128views Mathematics» more  ISSAC 2007»
15 years 3 months ago
Productivity and performance using partitioned global address space languages
Partitioned Global Address Space (PGAS) languages combine the programming convenience of shared memory with the locality and performance control of message passing. One such langu...
Katherine A. Yelick, Dan Bonachea, Wei-Yu Chen, Ph...
DAGSTUHL
2006
14 years 11 months ago
A Petri Net Approach to Verify and Debug Simulation Models
Verification and Simulation share many issues, one is that simulation models require validation and verification. In the context of simulation, verification is understood as the ta...
Peter Kemper, Carsten Tepper
SIAMCOMP
1998
117views more  SIAMCOMP 1998»
14 years 9 months ago
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
This paper introduces the queue-read, queue-write (qrqw) parallel random access machine (pram) model, which permits concurrent reading and writing to shared memory locations, but ...
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachand...
65
Voted
MICRO
2010
IEEE
140views Hardware» more  MICRO 2010»
14 years 7 months ago
STEM: Spatiotemporal Management of Capacity for Intra-core Last Level Caches
Efficient management of last level caches (LLCs) plays an important role in bridging the performance gap between processor cores and main memory. This paper is motivated by two key...
Dongyuan Zhan, Hong Jiang, Sharad C. Seth