73 search results - page 14 / 15 » Optimistic Concurrency Semantics for Transactions in Coordin... |
172
click to vote
POPL
2005
ACM
15 years 9 months ago
2005
ACM
We introduce transactors, a fault-tolerant programming model for composing loosely-coupled distributed components running in an unreliable environment such as the internet into sy...
ISSTA
2004
ACM
15 years 2 months ago
2004
ACM
Software process and workflow languages are increasingly used to define loosely-coupled systems of systems. These languages focus on coordination issues such as data flow and c...
PPOPP
2010
ACM
15 years 6 months ago
2010
ACM
Drawing inspiration from several previous projects, we present an ownership-record-free software transactional memory (STM) system that combines extremely low overhead with unusua...
85
Voted
POPL
2011
ACM
14 years 8 days ago
2011
ACM
We consider programs for embedded real-time systems which use priority-driven preemptive scheduling with task priorities adjusted dynamically according to the immediate ceiling pr...
TSE
1998
14 years 9 months ago
1998
—New protocols are often useful, but are hard to implement well. Protocol synthesis is a solution, but synthesized protocols can be slow. Implementing protocols will be even more...