Sciweavers

1719 search results - page 37 / 344
» Scheduling with soft constraints
Sort
View
ETFA
2006
IEEE
14 years 1 months ago
Non-Schedulability Conditions for Off-line Scheduling of Real-Time Systems Subject to Precedence and Strict Periodicity Constrai
Classical off-line approaches based on preemption such as RM (Rate Monotonic), DM (Deadline Monotonic), EDF (Earliest Deadline First), LLF (Least Laxity First), etc, give schedula...
Patrick Meumeu Yomsi, Yves Sorel
NIPS
2007
13 years 11 months ago
Boosting Algorithms for Maximizing the Soft Margin
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
Manfred K. Warmuth, Karen A. Glocer, Gunnar Rä...
DSOM
2004
Springer
14 years 3 months ago
Policy-Based Resource Assignment in Utility Computing Environments
In utility computing environments, multiple users and applications are served from the same r esource pool. To maintain service level objectives and maintain high levels of utiliza...
Cipriano A. Santos, Akhil Sahai, Xiaoyun Zhu, Dirk...
IJPP
1998
73views more  IJPP 1998»
13 years 9 months ago
Meld Scheduling: A Technique for Relaxing Scheduling Constraints
Santosh G. Abraham, Vinod Kathail, Brian L. Deitri...
PERCOM
2003
ACM
14 years 9 months ago
ReCalendar: Calendaring and Scheduling Applications with CPU and Energy Resource Guarantees for Mobile Devices
In this paper, we present an advance reservation scheme for CPU and energy resources, called ReCalendar. The goal is to enable soft real-time applications on mobile devices to ach...
Wanghong Yuan, Klara Nahrstedt