2010 · 21 citations · 19 references
ComputingComputer EngineeringComputer ScienceReal-time SystemsSchedulingService OperationsPerformance OptimizationReal-time SchedulingResource SchedulingScheduling OptimizationScheduling TheoryTask SchedulingDeadlinesReal-time Task SchedulingRequest SchedulingScheduling With Deadlines
As computing devices and the Internet technology advances, real-time on-line services are emerging. Different from traditional real-time applications for which the scheduling objective is to meet task deadlines, the optimization goal for on-line service systems is to maximize profit obtained through providing timely services. For this class of applications, there are two distinctive characteristics: (1) tasks, i.e., client requests, are associated with a pair of unimodal time functions, representing system accrued profit when a task is completed before its deadline, or accrued penalty if otherwise; and (2) requests execution times vary in a wide range. The paper presents a new scheduling algorithm, i.e., the Profit and Penalty aware (PP-aware) scheduling algorithm, with an objective to maximize system's total accrued profit. Our simulation results have empirically shown the advantages, in respect of system total accrued profit, of the proposed algorithm over other commonly used scheduling algorithms, such as Earliest Deadline First (EDF) and Utility Accrual (UA) algorithms.
19
Best-effort decision-making for real-time scheduling
C. Douglass Locke · 1986 · 377 citations
On maximizing service-level-agreement profits
Zhen Liu, Mark S. Squillante, Joel L. Wolf · 2001 · 186 citations
SLA based profit optimization in autonomic computing systems
Li Zhang, Danilo Ardagna · 2004 · 130 citations