NDLI: Improved Blocking Time Analysis and Evaluation for the Multiprocessor Priority Ceiling Protocol

Content Provider	Springer Nature Link
Author	Yang, Mao Lin Lei, Hang Liao, Yong Rabee, Furkan
Copyright Year	2014
Abstract	The Multiprocessor Priority Ceiling Protocol (MPCP) is a classic suspension-based real-time locking protocol for partitioned fixed-priority (P-FP) scheduling. However, existing blocking time analysis is pessimistic under the P-FP + MPCP scheduling, which negatively impacts the schedulability for real-time tasks. In this paper, we model each task as an alternating sequence of normal and critical sections, and use both the best-case execution time (BCET) and the worst-case execution time (WCET) to describe the execution requirement for each section. Based on this model, a novel analysis is proposed to bound shared resource requests. This analysis uses BCET to derive the lower bound on the inter-arrival time for shared resource requests, and uses WCET to obtain the upper bound on the execution time of a task on critical sections during an arbitrary time interval of Δt. Based on this analysis, improved blocking analysis and its associated worst-case response time (WCRT) analysis are proposed for P-FP + MPCP scheduling. Schedulability experiments indicate that the proposed method outperforms the existing methods and improves the schedulability significantly.
Starting Page	1003
Ending Page	1013
Page Count	11
File Format	PDF
ISSN	10009000
Journal	Journal of Computer Science and Technology
Volume Number	29
Issue Number	6
e-ISSN	18604749
Language	English
Publisher	Springer US
Publisher Date	2014-11-17
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	real-time scheduling multiprocessor scheduling locking protocol blocking analysis worst-case response time Computer Science Software Engineering Theory of Computation Data Structures, Cryptology and Information Theory Artificial Intelligence (incl. Robotics) Information Systems Applications (incl. Internet)
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Computer Science Applications 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

Fault-tolerant scheduling for real-time embedded control systems

Dynamic I/O-Aware Scheduling for Batch-Mode Applications on Chip Multiprocessor Systems of Cluster Platforms

Optimal Checkpoint Placement on Real-Time Tasks with Harmonic Periods

Better-Than-Worst-Case Design: Progress and Opportunities

Stability analysis of buffer priority scheduling policies using Petri nets

Fuzzy-Based Dynamic Distributed Queue Scheduling for Packet Switched Networks

Multi-Dimensional Scheduling for Real-Time Tasks on Heterogeneous Clusters

Demand Priority Protocol simulation and evaluation

Worst-Case Finish Time Analysis for DAG-Based Applications in the Presence of Transient Faults

Improved Blocking Time Analysis and Evaluation for the Multiprocessor Priority Ceiling Protocol

Similar Documents

Fault-tolerant scheduling for real-time embedded control systems

Dynamic I/O-Aware Scheduling for Batch-Mode Applications on Chip Multiprocessor Systems of Cluster Platforms

Optimal Checkpoint Placement on Real-Time Tasks with Harmonic Periods

Better-Than-Worst-Case Design: Progress and Opportunities

Stability analysis of buffer priority scheduling policies using Petri nets

Fuzzy-Based Dynamic Distributed Queue Scheduling for Packet Switched Networks

Multi-Dimensional Scheduling for Real-Time Tasks on Heterogeneous Clusters

Demand Priority Protocol simulation and evaluation

Worst-Case Finish Time Analysis for DAG-Based Applications in the Presence of Transient Faults

Improved Blocking Time Analysis and Evaluation for the Multiprocessor Priority Ceiling Protocol