NDLI: On-line scheduling policies for a class of IRIS (increasing reward with increasing service) real-time tasks

Content Provider	IEEE Xplore Digital Library
Author	Dey, J.K. Kurose, J. Towsley, D.
Copyright Year	1968
Abstract	We consider a real time task model where a task receives a "reward" that depends on the amount of service received prior to its deadline. The reward of the task is assumed to be an increasing function of the amount of service that it receives, i.e., the task has the property that it receives increasing reward with increasing service (IRIS). We focus on the problem of online scheduling of a random arrival sequence of IRIS tasks on a single processor with the goal of maximizing the average reward accrued per task and per unit time. We describe and evaluate several policies for this system through simulation and through a comparison with an unachievable upper bound. We observe that the best performance is exhibited by a two level policy where the top level algorithm is responsible for allocating the amount of service to tasks and the bottom level algorithm, using the earliest deadline first (EDF) rule, is responsible for determining the order in which tasks are executed. Furthermore, the performance of this policy approaches the theoretical upper bound in many cases. We also show that the average number of preemptions of a task under this two level policy is very small.
Sponsorship	IEEE Computer Society Technical Committee on Distributed Process IEEE Computer Society Technical Committee on VLSI IEEE Technical Committee on Computer Architecture IEEE Computer Society
Starting Page	802
Ending Page	813
Page Count	12
File Size	1388239
File Format	PDF
ISSN	00189340
Volume Number	45
Issue Number	7
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1996-07-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Iris Processor scheduling Iterative algorithms Upper bound Scheduling algorithm Real time systems Remotely operated vehicles Mobile robots Navigation Process planning
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Comment on On-line scheduling policies for a class of IRIS real-time tasks

Optimal reward-based scheduling for periodic real-time tasks

Using occupancy grids for mobile robot perception and navigation

Path Planning for Autonomous Vehicles by Trajectory Smoothing Using Motion Primitives

Maintaining temporal consistency: pessimistic vs. optimistic concurrency control

Real-time indoor autonomous vehicle test environment

The Quadratic Utilization Upper Bound for Arbitrary Deadline Real-Time Tasks

Resource reclaiming in multiprocessor real-time systems

Autonomous land navigation in a structured environment

On-line scheduling policies for a class of IRIS (increasing reward with increasing service) real-time tasks

Similar Documents

Comment on On-line scheduling policies for a class of IRIS real-time tasks

Optimal reward-based scheduling for periodic real-time tasks

Using occupancy grids for mobile robot perception and navigation

Path Planning for Autonomous Vehicles by Trajectory Smoothing Using Motion Primitives

Maintaining temporal consistency: pessimistic vs. optimistic concurrency control

Real-time indoor autonomous vehicle test environment

The Quadratic Utilization Upper Bound for Arbitrary Deadline Real-Time Tasks

Resource reclaiming in multiprocessor real-time systems

Autonomous land navigation in a structured environment

On-line scheduling policies for a class of IRIS (increasing reward with increasing service) real-time tasks