Sciweavers

116 search results - page 4 / 24
» A practical access to the theory of parallel algorithms
Sort
View
JPDC
2006
111views more  JPDC 2006»
13 years 7 months ago
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Irregular parallel algorithms pose a significant challenge for achieving high performance because of the difficulty predicting memory access patterns or execution paths. Within an...
Guojing Cong, David A. Bader
IPPS
1999
IEEE
13 years 11 months ago
A Structured Approach to Parallel Programming: Methodology and Models
Parallel programming continues to be difficult, despite substantial and ongoing research aimed at making it tractable. Especially dismaying is the gulf between theory and the pract...
Berna L. Massingill
IPPS
1998
IEEE
13 years 11 months ago
Managing Concurrent Access for Shared Memory Active Messages
Passing messages through shared memory plays an important role on symmetric multiprocessors and on Clumps. The management of concurrent access to message queues is an important as...
Steven Lumetta, David E. Culler
PPOPP
2010
ACM
14 years 4 months ago
A practical concurrent binary search tree
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
Nathan Grasso Bronson, Jared Casper, Hassan Chafi,...
TON
2010
157views more  TON 2010»
13 years 2 months ago
Random Access Game and Medium Access Control Design
We study the contention/interaction among wireless nodes and med -ium access control design in game theory framework. We define a general class of games, called random access game...
Lijun Chen, Steven H. Low, John C. Doyle