Sciweavers

706 search results - page 10 / 142
» Online Interval Scheduling
Sort
View
IPPS
2010
IEEE
13 years 5 months ago
Handling errors in parallel programs based on happens before relations
Abstract--Intervals are a new model for parallel programming based on an explicit happens before relation. Intervals permit fine-grained but high-level control of the program sched...
Nicholas D. Matsakis, Thomas R. Gross
APPROX
2000
Springer
107views Algorithms» more  APPROX 2000»
13 years 12 months ago
Online real-time preemptive scheduling of jobs with deadlines
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
Bhaskar DasGupta, Michael A. Palis
FSTTCS
2010
Springer
13 years 5 months ago
Minimizing Busy Time in Multiple Machine Real-time Scheduling
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
Rohit Khandekar, Baruch Schieber, Hadas Shachnai, ...
LCPC
2009
Springer
14 years 4 days ago
Programming with Intervals
Abstract. Intervals are a new, higher-level primitive for parallel programming with which programmers directly construct the program schedule. Programs using intervals can be stati...
Nicholas D. Matsakis, Thomas R. Gross