Sciweavers

140 search results - page 11 / 28
» Comparing the performance of concurrent linked-list implemen...
Sort
View
CF
2006
ACM
14 years 2 months ago
Exploiting locality to ameliorate packet queue contention and serialization
Packet processing systems maintain high throughput despite relatively high memory latencies by exploiting the coarse-grained parallelism available between packets. In particular, ...
Sailesh Kumar, John Maschmeyer, Patrick Crowley
IWMM
2010
Springer
137views Hardware» more  IWMM 2010»
14 years 17 days ago
The locality of concurrent write barriers
Concurrent and incremental collectors require barriers to ensure correct synchronisation between mutator and collector. The overheads imposed by particular barriers on particular ...
Laurence Hellyer, Richard Jones, Antony L. Hosking
ICDCS
1996
IEEE
14 years 22 days ago
The Relative Importance of Concurrent Writers and Weak Consistency Models
This paper presents a detailed comparison of the relative importance of allowing concurrent writers versus the choice of the underlying consistency model. Our comparison is based ...
Peter J. Keleher
IPPS
2007
IEEE
14 years 2 months ago
A Configuration Control Mechanism Based on Concurrency Level for a Reconfigurable Consistency Algorithm
A Reconfigurable Consistency Algorithm (RCA) is an algorithm that guarantees the consistency in Distributed Shared Memory (DSM) Systems. In a RCA, there is a Configuration Control...
Christiane V. Pousa, Luís Fabrício W...
OOPSLA
2009
Springer
14 years 3 months ago
Scalable nonblocking concurrent objects for mission critical code
The high degree of complexity and autonomy of future robotic space missions, such as Mars Science Laboratory (MSL), poses serious challenges in assuring their reliability and efï¬...
Damian Dechev, Bjarne Stroustrup