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 ...
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...
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...
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...
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...