Sciweavers

1491 search results - page 161 / 299
» Resource-Passing Concurrent Programming
Sort
View
POPL
2009
ACM
16 years 3 months ago
Proving that non-blocking algorithms don't block
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
Alexey Gotsman, Byron Cook, Matthew J. Parkinson, ...
COORDINATION
2009
Springer
16 years 3 months ago
Exceptionally Safe Futures
A future is a well-known programming construct used to introduce concurrency to sequential programs. Computations annotated as futures are executed asynchronously and run concurren...
Armand Navabi, Suresh Jagannathan
ICFP
2006
ACM
16 years 2 months ago
Transactional events
nt programs require high-level abstractions in order to manage complexity and enable compositional reasoning. In this paper, we introduce a novel concurrency abstraction, dubbed t...
Kevin Donnelly, Matthew Fluet
ASPLOS
2000
ACM
15 years 7 months ago
Slipstream Processors: Improving both Performance and Fault Tolerance
Processors execute the full dynamic instruction stream to arrive at the final output of a program, yet there exist shorter instruction streams that produce the same overall effec...
Karthik Sundaramoorthy, Zachary Purser, Eric Roten...
LCTRTS
2004
Springer
15 years 8 months ago
Advanced control flow in Java card programming
Java Card technology simplifies the development of smart card applications by providing a high-level programming language similar to Java. However, the master-slave programming m...
Peng Li, Steve Zdancewic