1370 search results - page 205 / 274 » Synchronization Transformations for Parallel Computing |
137
click to vote
IPPS
2010
IEEE
15 years 2 days ago
2010
IEEE
Predicting how well applications may run on modern systems is becoming increasingly challenging. It is no longer sufficient to look at number of floating point operations and commu...
131
Voted
IPMI
2003
Springer
16 years 3 months ago
2003
Springer
In this paper we develop a novel measure of information in a random variable based on its cumulative distribution that we dub cumulative residual entropy (CRE). This measure parall...
88
Voted
SPAA
2009
ACM
16 years 2 months ago
2009
ACM
We present three new reader-writer lock algorithms that scale under high read-only contention. Many previous reader-writer locks suffer significant degradation when many readers a...
129
Voted
SPAA
2009
ACM
16 years 2 months ago
2009
ACM
Transactional memory (TM) eliminates many problems associated with lock-based synchronization. Over recent years, much progress has been made in software and hardware implementati...
149
Voted
PODC
2006
ACM
15 years 8 months ago
2006
ACM
Byzantine agreement algorithms typically assume implicit initial state consistency and synchronization among the correct nodes and then operate in coordinated rounds of informatio...