Sciweavers

822 search results - page 109 / 165
» Contention in shared memory algorithms
Sort
View
159
Voted
PLDI
2012
ACM
13 years 5 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
114
Voted
ICCD
2008
IEEE
115views Hardware» more  ICCD 2008»
15 years 11 months ago
Techniques for increasing effective data bandwidth
—In this paper we examine techniques for increasing the effective bandwidth of the microprocessor offchip interconnect. We focus on mechanisms that are orthogonal to other techni...
Christopher Nitta, Matthew Farrens
139
Voted
DATE
2008
IEEE
138views Hardware» more  DATE 2008»
15 years 9 months ago
Functional Self-Testing for Bus-Based Symmetric Multiprocessors
Functional, instruction-based self-testing of microprocessors has recently emerged as an effective alternative or supplement to other testing approaches, and is progressively adop...
Andreas Apostolakis, Dimitris Gizopoulos, Mihalis ...
113
Voted
PPOPP
2005
ACM
15 years 8 months ago
Revocable locks for non-blocking programming
In this paper we present a new form of revocable lock that streamlines the construction of higher level concurrency abstractions such as atomic multi-word heap updates. The key id...
Tim Harris, Keir Fraser
139
Voted
IUI
2011
ACM
14 years 5 months ago
Groups without tears: mining social topologies from email
As people accumulate hundreds of “friends” in social media, a flat list of connections becomes unmanageable. Interfaces agnostic to social structure hinder the nuanced sharin...
Diana MacLean, Sudheendra Hangal, Seng Keat Teh, M...