Sciweavers

22 search results - page 1 / 5
» Greedy scheduling with custom-made objectives
Sort
View
ANOR
2010
130views more  ANOR 2010»
13 years 8 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
COLOGNETWENTE
2008
14 years 9 days ago
Special Cases of Online Parallel Job Scheduling
In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, ...
Johann Hurink, Jacob Jan Paulus
OPODIS
2010
13 years 8 months ago
On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors
We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model in...
Piyush Garyali, Matthew Dellinger, Binoy Ravindran
ESA
2006
Springer
103views Algorithms» more  ESA 2006»
14 years 2 months ago
Greedy in Approximation Algorithms
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
Julián Mestre
TON
2010
168views more  TON 2010»
13 years 5 months ago
Engineering Wireless Mesh Networks: Joint Scheduling, Routing, Power Control, and Rate Adaptation
Abstract--We present a number of significant engineering insights on what makes a good configuration for medium- to largesize wireless mesh networks (WMNs) when the objective funct...
Jun Luo, Catherine Rosenberg, André Girard