Sciweavers

1499 search results - page 172 / 300
» Chopping Concurrent Programs
Sort
View
ASPLOS
2008
ACM
15 years 2 months ago
General and efficient locking without blocking
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of act...
Yannis Smaragdakis, Anthony Kay, Reimer Behrends, ...
CACM
2010
179views more  CACM 2010»
15 years 24 days 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...
192
Voted
POPL
2007
ACM
16 years 1 months ago
SAC: off-the-shelf support for data-parallelism on multicores
The advent of multicore processors has raised new demand for harnessing concurrency in the software mass market. We summarise our previous work on the data parallel, functional ar...
Clemens Grelck, Sven-Bodo Scholz
CTCS
1989
Springer
15 years 4 months ago
Temporal Structures
We combine the principles of the Floyd-Warshall-Kleene algorithm, enriched categories, and Birkhoff arithmetic, to yield a useful class of algebras of transitive vertex-labeled s...
Ross Casley, Roger F. Crew, José Meseguer, ...
109
Voted
APN
2001
Springer
15 years 4 months ago
Partial Order Verification of Programmable Logic Controllers
We address the verification of programmable logic controllers (PLC). In our approach, a PLC program is translated into a special type of colored Petri net, a so-called register net...
Peter Deussen