NDLI: Semi-fixed-priority scheduling with multiple mandatory parts

Content Provider	IEEE Xplore Digital Library
Author	Chishiro, H. Yamasaki, N.
Copyright Year	2013
Description	Author affiliation: Dept. of Comput. Sci., Univ. of North Carolina at Chapel Hill, Chapel Hill, NC, USA (Chishiro, H.) \|\| Dept. of Inf. & Comput. Sci., Keio Univ., Yokohama, Japan (Yamasaki, N.)
Abstract	An imprecise computation model has the advantage of supporting overloaded conditions in dynamic real-time environments, compared to Liu and Layland's model. However, the imprecise computation model is not practical because the termination of each optional part cannot guarantee the schedulability. In order to guarantee the schedulability of the termination of the optional part, a practical imprecise computation model is presented. In the practical imprecise computation model, each task has multiple mandatory parts and optional parts to support many imprecise real-time applications. The practical imprecise computation model is supported by dynamic-priority scheduling on uniprocessors. Unfortunately, dynamic-priority scheduling is difficult to support multiprocessors. In contrast, semifixed-priority scheduling, which is part-level fixed-priority scheduling, supports only two mandatory parts so that supported imprecise real-time applications are restricted. This paper presents semi-fixed-priority scheduling with multiple mandatory parts on uniprocessors and multiprocessors respectively. In addition, this paper explains how to calculate the optional deadline of each task, which is the termination time of optional part. The schedulability analysis shows that semi-fixed-priority scheduling strictly dominates fixed-priority scheduling. Thanks to semi-fixed-priority scheduling with multiple mandatory parts, many imprecise realtime applications can be supported.
Starting Page	1
Ending Page	8
File Size	249520
Page Count	8
File Format	PDF
ISBN	9781479921119
DOI	10.1109/ISORC.2013.6913216
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-06-19
Publisher Place	Germany
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computational modeling Processor scheduling Real-time systems Measurement Dynamic scheduling Upper bound
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

Practical Imprecise Computation Model: Theory and Practice

Response Time Upper Bounds for Fixed Priority Real-Time Systems

RT-Est: Real-Time Operating System for Semi-fixed-Priority Scheduling Algorithms

Semi-Fixed-Priority Scheduling: New Priority Assignment Policy for Practical Imprecise Computation

Global Semi-fixed-priority Scheduling on Multiprocessors

Modeling Fixed Priority Non-Preemptive Scheduling with Real-Time Calculus

Feasibility Analysis under Fixed Priority Scheduling with Fixed Preemption Points

Improving the response time analysis of global fixed-priority multiprocessor scheduling

Bounding Carry-in Interference to Improve Fixed-Priority Global Multiprocessor Scheduling Analysis

Semi-fixed-priority scheduling with multiple mandatory parts

Similar Documents

Practical Imprecise Computation Model: Theory and Practice

Response Time Upper Bounds for Fixed Priority Real-Time Systems

RT-Est: Real-Time Operating System for Semi-fixed-Priority Scheduling Algorithms

Semi-Fixed-Priority Scheduling: New Priority Assignment Policy for Practical Imprecise Computation

Global Semi-fixed-priority Scheduling on Multiprocessors

Modeling Fixed Priority Non-Preemptive Scheduling with Real-Time Calculus

Feasibility Analysis under Fixed Priority Scheduling with Fixed Preemption Points

Improving the response time analysis of global fixed-priority multiprocessor scheduling

Bounding Carry-in Interference to Improve Fixed-Priority Global Multiprocessor Scheduling Analysis

Semi-fixed-priority scheduling with multiple mandatory parts