Sciweavers

112 search results - page 22 / 23
» Faster deterministic dictionaries
Sort
View
SIGMETRICS
2010
ACM
212views Hardware» more  SIGMETRICS 2010»
13 years 11 months ago
A mean field model of work stealing in large-scale systems
In this paper, we consider a generic model of computational grids, seen as several clusters of homogeneous processors. In such systems, a key issue when designing efficient job al...
Nicolas Gast, Bruno Gaujal
CASES
2000
ACM
13 years 10 months ago
A dynamic memory management unit for embedded real-time system-on-a-chip
Dealing with global on-chip memory allocation/de-allocation in a dynamic yet deterministic way is an important issue for upcoming billion transistor multiprocessor System-on-a-Chi...
Mohamed Shalan, Vincent John Mooney III
ERSHOV
1989
Springer
13 years 10 months ago
Experiments with Implementations of Two Theoretical Constructions
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...
Torben Amtoft Hansen, Thomas Nikolajsen, Jesper La...
FAST
2010
13 years 8 months ago
Discovery of Application Workloads from Network File Traces
An understanding of application I/O access patterns is useful in several situations. First, gaining insight into what applications are doing with their data at a semantic level he...
Neeraja J. Yadwadkar, Chiranjib Bhattacharyya, K. ...
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
13 years 6 months ago
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
Nikhil Bansal, Kedar Dhamdhere, Jochen Könema...