Sciweavers

5055 search results - page 171 / 1011
» Relative Timing
Sort
View
ACSC
2009
IEEE
16 years 1 months ago
The Impact of Quanta on the Performance of Multi-level Time Sharing Policy under Heavy-tailed Workloads
Recent research indicates that modern computer workloads (e.g. processing time of web requests) follow heavy-tailed distributions. In a heavy-tailed distribution there are a large...
Malith Jayasinghe, Zahir Tari, Panlop Zeephongseku...
ICCS
2004
Springer
15 years 11 months ago
Petri Nets as Executable Specifications of High-Level Timed Parallel Systems
We propose to use high-level Petri nets as a model for the semantics of high-level parallel systems. This model is known to be useful for the purpose of verification and we show t...
Franck Pommereau
ICALP
2001
Springer
15 years 10 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
PADS
2009
ACM
16 years 1 months ago
Scalable Time Warp on Blue Gene Supercomputers
Abstract—In this paper we illustrate scalable parallel performance for the Time Warp synchronization protocol on the L and P variants of the IBM Blue Gene supercomputer. Scalable...
David W. Bauer, Christopher D. Carothers, Akintayo...
VLDB
1999
ACM
145views Database» more  VLDB 1999»
15 years 10 months ago
DBMSs on a Modern Processor: Where Does Time Go?
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill...