1390 search results - page 233 / 278 » Coordination Patterns for Parallel Computing |
103
click to vote
HPCA
2012
IEEE
13 years 5 months ago
2012
IEEE
The least recently used (LRU) replacement policy performs poorly in the last-level cache (LLC) because temporal locality of memory accesses is filtered by first and second level...
84
Voted
ICPP
1999
IEEE
15 years 2 months ago
1999
IEEE
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
Deadlock detection scheduling is an important, yet oft-overlooked problem that can significantly affect the overall performance of deadlock handling. An excessive initiation of ...
MIDDLEWARE
2001
Springer
15 years 2 months ago
2001
Springer
Although it has long been realised that ACID transactions by themselves are not adequate for structuring long-lived applications and much research work has been done on developing...
ISORC
2000
IEEE
15 years 2 months ago
2000
IEEE
We describe a real-time, component-based system for an inspection application. We chose the inspection application and the accompanying task (or scenario) so that we might fully e...