Sciweavers

655 search results - page 29 / 131
» Coinduction in Concurrent Timed Systems
Sort
View
CASCON
1996
125views Education» more  CASCON 1996»
13 years 11 months ago
A memory-adaptive sort (MASORT) for database systems
A memory-adaptive sort is able to dynamically change the amount of memory used during sorting. The method described in this paper adjusts memory usage according to input size and ...
Weiye Zhang, Per-Åke Larson
FORMATS
2006
Springer
14 years 1 months ago
Concurrent Semantics Without the Notions of State or State Transitions
This paper argues that basing the semantics of concurrent systems on the notions of state and state transitions is neither advisable nor necessary. The tendency to do this is deepl...
Edward A. Lee
VLDB
1995
ACM
94views Database» more  VLDB 1995»
14 years 1 months ago
Value-cognizant Speculative Concurrency Control
We describe SCC-kS, a Speculative Concurrency Control (SCC) algorithm that allows a DBMS to use efficiently the extra computing resources available in the system to increase the l...
Azer Bestavros, Spyridon Braoudakis
APN
2005
Springer
14 years 3 months ago
The (True) Concurrent Markov Property and Some Applications to Markov Nets
Abstract. We study probabilistic safe Petri nets, a probabilistic extension of safe Petri nets interpreted under the true-concurrent semantics. In particular, the likelihood of pro...
Samy Abbes
EUROSYS
2007
ACM
14 years 7 months ago
Competitive prefetching for concurrent sequential I/O
During concurrent I/O workloads, sequential access to one I/O stream can be interrupted by accesses to other streams in the system. Frequent switching between multiple sequential ...
Chuanpeng Li, Kai Shen, Athanasios E. Papathanasio...