Sciweavers

1502 search results - page 44 / 301
» Node weighted scheduling
Sort
View
EUROSYS
2010
ACM
14 years 7 months ago
Delay Scheduling: A Simple Technique for Achieving Locality and Fairness in Cluster Scheduling
As organizations start to use data-intensive cluster computing systems like Hadoop and Dryad for more applications, there is a growing need to share clusters between users. Howeve...
Matei Zaharia, Dhruba Borthakur, Joydeep Sen Sarma...
ISORC
2008
IEEE
14 years 4 months ago
On Collaborative Scheduling of Distributable Real-Time Threads in Dynamic, Networked Embedded Systems
Some emerging networked embedded real-time applications have relatively long reaction time magnitudes—e.g., milliseconds to minutes. These longer execution time magnitudes allow...
Sherif Fadel Fahmy, Binoy Ravindran, E. Douglas Je...
ADAEUROPE
2006
Springer
14 years 3 months ago
Interchangeable Scheduling Policies in Real-Time Middleware for Distribution
When a middleware layer is designed for providing semi-transparent distribution facilities to real-time applications, a trade-off must be made between the expressiveness and contro...
Juan López Campos, J. Javier Gutiérr...
CCGRID
2008
IEEE
13 years 12 months ago
Scheduling Dynamic Workflows onto Clusters of Clusters using Postponing
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
Sascha Hunold, Thomas Rauber, Frédér...
CPC
2008
74views more  CPC 2008»
13 years 10 months ago
An Analysis of the Height of Tries with Random Weights on the Edges
We analyze the weighted height of random tries built from independent strings of i.i.d. symbols on the finite alphabet {1, . . . , d}. The edges receive random weights whose distr...
Nicolas Broutin, Luc Devroye