A behavior priority driven approach for resource reservation scheduling

Authors:
Leo Ordínez;David Donari;Rodrigo Santos
Affiliations:
IIIE-DIEC, Bahía Blanca, Arg.;IIIE-DIEC, Bahía Blanca, Arg.;IIIE-DIEC, Bahía Blanca, Arg.
Venue:
Proceedings of the 2008 ACM symposium on Applied computing
Year:
2008

Citing 7
Cited 1

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Dual priority scheduling

RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Integrating Multimedia Applications in Hard Real-Time Systems

RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Importance-based Scheduling for Predictable Real-Time Systems using MART

WPDRTS '96 Proceedings of the 4th International Workshop on Parallel and Distributed Real-Time Systems
Mode Change Protocols for Real-Time Systems: A Survey and a New Proposal

Real-Time Systems
IRIS: A New Reclaiming Algorithm for Server-Based Real-Time Systems

RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
IMAC: an importance-level based adaptive CPU scheduling scheme for multimedia and non-real time applications

AICCSA '05 Proceedings of the ACS/IEEE 2005 International Conference on Computer Systems and Applications

Resource sharing in behavioral based scheduling

Proceedings of the 2009 ACM symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a behavioral distinction of soft real-time tasks is introduced. The distinction is based on the behavior of the previous instance of each task and it is used to propose a scheduling algorithm. The algorithm, called BIDS, uses well-known server mechanisms with an extension to handle two priority queues within each server. The priority of a server is managed accordingly to the result that its associated task produce. Along with the formal presentation of the algorithm and the proofs of its properties some performance evaluations based on simulations are included.