Sciweavers

1095 search results - page 4 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
92
Voted
DEXAW
1999
IEEE
91views Database» more  DEXAW 1999»
15 years 2 months ago
Hierarchical Scheduling Algorithms for Near-Line Tape Libraries
Robotic tape libraries (RTLs) currently enjoy a prominent place in the storage market, with a reported average annual growth rate approaching 34%, primarily due to their low cost ...
Peter Triantafillou, Ioannis Georgiadis
ORL
2002
81views more  ORL 2002»
14 years 9 months ago
On-line scheduling of unit time jobs with rejection: minimizing the total completion time
We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, o...
Leah Epstein, John Noga, Gerhard J. Woeginger
ESA
2009
Springer
142views Algorithms» more  ESA 2009»
15 years 4 months ago
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
Andreas Karrenbauer, Thomas Rothvoß
COCOON
2007
Springer
15 years 1 months ago
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
This paper deals with problems which fall into the domain of selfish scheduling: a protocol is in charge of building a schedule for a set of tasks without directly knowing their l...
George Christodoulou, Laurent Gourvès, Fann...
STACS
1999
Springer
15 years 1 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann