Sciweavers

12453 search results - page 21 / 2491
» Concurrent Data Structures
Sort
View
ESOP
2004
Springer
15 years 7 months ago
A Semantic Framework for Designer Transactions
A transaction defines a locus of computation that satisfies important concurrency and failure properties; these so-called ACID properties provide strong serialization guarantees ...
Jan Vitek, Suresh Jagannathan, Adam Welc, Antony L...
PODC
2010
ACM
15 years 3 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
134
Voted
APSEC
1996
IEEE
15 years 5 months ago
A Prototype of a Concurrent Behavior Monitoring Tool for Testing of Concurrent Programs
Testing of concurrent programs is much more difficult than that of sequential programs. A concurrent program behaves nondeterministically, that is, the program may produce differe...
Eisuke Itoh, Zengo Furukawa, Kazuo Ushijima
CACM
2010
179views more  CACM 2010»
15 years 1 months ago
x86-TSO: a rigorous and usable programmer's model for x86 multiprocessors
Exploiting the multiprocessors that have recently become ubiquitous requires high-performance and reliable concurrent systems code, for concurrent data structures, operating syste...
Peter Sewell, Susmit Sarkar, Scott Owens, Francesc...
PPOPP
2006
ACM
15 years 7 months ago
McRT-STM: a high performance software transactional memory system for a multi-core runtime
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed t...
Bratin Saha, Ali-Reza Adl-Tabatabai, Richard L. Hu...