Sciweavers

373 search results - page 23 / 75
» Scheduling Conditional Task Graphs
Sort
View
SIGMETRICS
2009
ACM
103views Hardware» more  SIGMETRICS 2009»
14 years 3 months ago
Restrained utilization of idleness for transparent scheduling of background tasks
A common practice in system design is to treat features intended to enhance performance and reliability as low priority tasks by scheduling them during idle periods, with the goal...
Ningfang Mi, Alma Riska, Xin Li, Evgenia Smirni, E...
CCGRID
2010
IEEE
13 years 9 months ago
A Fair Decentralized Scheduler for Bag-of-Tasks Applications on Desktop Grids
Desktop Grids have become very popular nowadays, with projects that include hundred of thousands computers. Desktop grid scheduling faces two challenges. First, the platform is vo...
Javier Celaya, Loris Marchal
IJCAI
2001
13 years 10 months ago
Adaptive Control of Acyclic Progressive Processing Task Structures
The progressive processing model allows a system to trade off resource consumption against the quality of the outcome by mapping each activity to a graph of potential solution met...
Stéphane Cardon, Abdel-Illah Mouaddib, Shlo...
EOR
2002
105views more  EOR 2002»
13 years 8 months ago
Review of properties of different precedence graphs for scheduling problems
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
Jacek Blazewicz, Daniel Kobler
RTAS
2002
IEEE
14 years 1 months ago
The Aperiodic Multiprocessor Utilization Bound for Liquid Tasks
Real-time scheduling theory has developed powerful tools for translating conditions on aggregate system utilization into per-task schedulability guarantees. The main breakthrough ...
Tarek F. Abdelzaher, Björn Andersson, Jan Jon...