Sciweavers

1719 search results - page 169 / 344
» Scheduling with soft constraints
Sort
View
RTSS
1999
IEEE
15 years 10 months ago
Design and Implementation of Statistical Rate Monotonic Scheduling in KURT Linux
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and...
Alia Atlas, Azer Bestavros
141
Voted
SIGMOD
1996
ACM
133views Database» more  SIGMOD 1996»
15 years 9 months ago
Multi-dimensional Resource Scheduling for Parallel Queries
Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution en...
Minos N. Garofalakis, Yannis E. Ioannidis
CORR
2002
Springer
136views Education» more  CORR 2002»
15 years 5 months ago
Libra: An Economy driven Job Scheduling System for Clusters
Clusters of computers have emerged as mainstream parallel and distributed platforms for high-performance, highthroughput and high-availability computing. To enable effective resou...
Jahanzeb Sherwani, Nosheen Ali, Nausheen Lotia, Za...
149
Voted
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
15 years 9 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani
DATE
2009
IEEE
89views Hardware» more  DATE 2009»
16 years 11 days ago
Robust non-preemptive hard real-time scheduling for clustered multicore platforms
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
Michele Lombardi, Michela Milano, Luca Benini