Sciweavers

822 search results - page 54 / 165
» Contention in shared memory algorithms
Sort
View
IPPS
2009
IEEE
14 years 3 months ago
Designing multi-leader-based Allgather algorithms for multi-core clusters
The increasing demand for computational cycles is being met by the use of multi-core processors. Having large number of cores per node necessitates multi-core aware designs to ext...
Krishna Chaitanya Kandalla, Hari Subramoni, Gopala...
SPAA
2012
ACM
11 years 11 months ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...
PLDI
2006
ACM
14 years 2 months ago
Optimizing memory transactions
Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement...
Timothy L. Harris, Mark Plesko, Avraham Shinnar, D...
CCGRID
2005
IEEE
14 years 2 months ago
View-oriented update protocol with integrated diff for view-based consistency
This paper proposes a View-Oriented Update Protocol with Integrated Diff for efficient implementation of a View-based Consistency model which supports a novel View-Oriented Paral...
Zhiyi Huang, Martin K. Purvis, Paul Werstein
CAV
2007
Springer
164views Hardware» more  CAV 2007»
14 years 26 days ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke