619 search results - page 97 / 124 » Visualization of Concurrent Program Executions |
SIGADA
1999
Springer
13 years 11 months ago
1999
Springer
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
PPOPP
2012
ACM
12 years 2 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
PLDI
2012
ACM
11 years 9 months ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
KBSE
2007
IEEE
14 years 1 months ago
2007
IEEE
Flexibility and interoperability make web services well suited for designing highly-customizable reactive service-based applications, that is interactive applications that can be ...
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
Snapshot isolation (SI) provides significantly improved concurrency over 2PL, allowing reads to be non-blocking. Unfortunately, it can also lead to non-serializable executions in ...