NDLI: An Efficient Method for Assigning Harmonic Periods to Hard Real-Time Tasks with Period Ranges

Content Provider	IEEE Xplore Digital Library
Author	Nasri, M. Fohler, G.
Copyright Year	2015
Description	Author affiliation: Dept. of Real-time Syst., Tech. Univ. Kaiserslautern, Kaiserslautern, Germany (Nasri, M.; Fohler, G.)
Abstract	During the design phase of many real-time systems, designers often have a range of acceptable period values for which some levels of safety or quality of service are guaranteed. The choice of period values influences system schedulability and computational complexity of schedulability analysis, especially for the rate monotonic (RM) scheduling algorithm. It has been shown that RM guarantees 100% utilization if the periods are harmonic, i.e., Each period is an integer multiple of shorter periods. In this paper, we address harmonic period assignment problem where each task has a given period range. We extend the results of our previous work and present an O(n^2log(n)) algorithm (where n is the number of tasks) to verify necessary and sufficient conditions for the existence of a harmonic period assignment in cases where the previous solution has pseudo-polynomial computational complexity. We provide utilization bounds of the potential assignments as well as a heuristic algorithm to construct low utilization harmonic task sets. The efficiency of our period assignment algorithms has been evaluated in terms of acceptance ratio, task set utilization, data structure size, and the number of operations required for harmonic period assignment.
Starting Page	149
Ending Page	159
File Size	796880
Page Count	11
File Format	PDF
ISBN	9781467375702
ISSN	10683070
DOI	10.1109/ECRTS.2015.21
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-07-08
Publisher Place	Sweden
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Harmonic analysis Real-time systems Computational complexity Heuristic algorithms Discrete cosine transforms Safety Time factors Hard Deadline Real-Time Systems Period Range Period Assignment Harmonic Tasks
Content Type	Text
Resource Type	Article

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

Scheduling non-preemptive hard real-time tasks with strict periods

A Framework to Construct Customized Harmonic Periods for Real-Time Systems

Optimized deadline assignment and schedulability analysis for distributed real-time systems with local edf scheduling.

Guaranteed Scheduling for (m,k)-firm Deadline-Constrained Real-Time Tasks on Multiprocessors

Optimal Priority Assignment And Feasibility Of Static Priority Tasks With Arbitrary Start Times (1991)

Optimal priority assignment and feasibility of static priority tasks with arbitrary start times (1991).

Assigning real-time tasks and resources to distributed systems (1995).

Optimal deadline assignment for periodic real-time tasks in dynamic priority systems (2006).

An Efficient Test Method for Rate Monotonic Schedulability

An Efficient Method for Assigning Harmonic Periods to Hard Real-Time Tasks with Period Ranges

Similar Documents

Scheduling non-preemptive hard real-time tasks with strict periods

A Framework to Construct Customized Harmonic Periods for Real-Time Systems

Optimized deadline assignment and schedulability analysis for distributed real-time systems with local edf scheduling.

Guaranteed Scheduling for (m,k)-firm Deadline-Constrained Real-Time Tasks on Multiprocessors

Optimal Priority Assignment And Feasibility Of Static Priority Tasks With Arbitrary Start Times (1991)

Optimal priority assignment and feasibility of static priority tasks with arbitrary start times (1991).

Assigning real-time tasks and resources to distributed systems (1995).

Optimal deadline assignment for periodic real-time tasks in dynamic priority systems (2006).

An Efficient Test Method for Rate Monotonic Schedulability

An Efficient Method for Assigning Harmonic Periods to Hard Real-Time Tasks with Period Ranges