SPAA
2009
ACM
14 years 5 months ago
2009
ACM
In order to be efficient with selfish programmers, a multicore transactional memory (TM) system must be designed such that it is compatible with good programming incentives (GPI),...
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
This paper takes a step toward developing a theory for understanding aborts in transactional memory systems (TMs). Existing TMs may abort many transactions that could, in fact, co...
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
Transactional memory (TM) is a promising approach for designing concurrent data structures, and it is essential to develop better understanding of the formal properties that can b...
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
PPOPP
2009
ACM
14 years 5 months ago
2009
ACM
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
PPOPP
2009
ACM
14 years 5 months ago
2009
ACM
The advent of new parallel architectures has increased the need for parallel optimizing compilers to assist developers in creating efficient code. OpenUH is a state-of-the-art opt...
PPOPP
2009
ACM
14 years 5 months ago
2009
ACM
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...