Abstract
Scheduling requirements are a major portion of the set of requirements that must be addressed by the Ada 9X Project. This is evident by the numerous Revision Requests (RRs) submitted (over 25) to the Ada 9X Project Office and the subsequent Revision Issues (RI-7005 and RI-7007). The related 9X requirements are:
R1 - Flexible scheduling
R2 - Flexible entry queue ordering
IR2 - Rendezvous performance
IR3 - Extended priority support
WR1 - Flexible select algorithm
This report summarizes the workshop's discussions on this important area. The discussions first considered dynamic priorities, and then priority scheduling and priority inheritance.
Index Terms
- Dynamic priorities, priority scheduling and priority inheritance
Recommendations
Dynamic priorities, priority scheduling and priority inheritance
IRTAW '90: Proceedings of the fourth international workshop on Real-time Ada issuesScheduling requirements are a major portion of the set of requirements that must be addressed by the Ada 9X Project. This is evident by the numerous Revision Requests (RRs) submitted (over 25) to the Ada 9X Project Office and the subsequent Revision ...
On priority queues with priority jumps
In this paper, we investigate a simplified head-of-the-line with priority jumps (HOL-PJ) scheduling discipline. Therefore, we consider a discrete-time single-server queueing system with two priority queues of infinite capacity and with a newly ...
The impact of priority generations in a multi-priority queueing system: a simulation approach
WSC '09: Winter Simulation ConferenceIn this paper, we consider a preemptive (multiple) priority queueing model in which arrivals occur according to a Markovian arrival process (MAP). An arriving customer belongs to priority type i, 1 ≤ i ≤ m+1, with probability pi. The highest priority, ...
Comments