Results 251 to 260 of about 34,037 (308)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On priority assignment in fixed priority scheduling
Information Processing Letters, 2001N C Audsley
exaly +3 more sources
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications, 1997
For many applications, the end-to-end delay of an application-specific data unit is a more important performance measure than the end-to-end delays of individual packets within a network. From this observation, we propose the idea of group scheduling. Specifically, consecutive packet arrivals in a flow are partitioned into groups, and the same deadline
Lam, S., Xie, Geoffrey
openaire +2 more sources
For many applications, the end-to-end delay of an application-specific data unit is a more important performance measure than the end-to-end delays of individual packets within a network. From this observation, we propose the idea of group scheduling. Specifically, consecutive packet arrivals in a flow are partitioned into groups, and the same deadline
Lam, S., Xie, Geoffrey
openaire +2 more sources
Proceedings 16th IEEE Real-Time Systems Symposium, 2002
In this paper, we present a new strategy for scheduling tasks with soft deadlines in real-time systems containing periodic, sporadic and adaptive tasks with hard deadlines. In such systems, much of the spare capacity present is due to sporadic and adaptive tasks not arriving at their maximum rate.
Robert I. Davis 0001, Andy J. Wellings
openaire +1 more source
In this paper, we present a new strategy for scheduling tasks with soft deadlines in real-time systems containing periodic, sporadic and adaptive tasks with hard deadlines. In such systems, much of the spare capacity present is due to sporadic and adaptive tasks not arriving at their maximum rate.
Robert I. Davis 0001, Andy J. Wellings
openaire +1 more source
On Schedulability Bounds of Static Priority Schedulers
11th IEEE Real Time and Embedded Technology and Applications Symposium, 2005While utilization bound based schedulability test is simple and effective, it is often difficult to derive the bound itself. For its analytical complexity, utilization bound results are usually obtained on a case-by-case basis. In this paper, we develop a general framework that allows one to effectively derive schedulability bounds for a wide range of ...
Jianjia Wu, Jyh-Charn Liu, Wei Zhao 0001
openaire +1 more source
Fixed priority scheduling with limited priority levels
IEEE Transactions on Computers, 1995Summary: This paper develops necessary and sufficient conditions for analyzing the schedulability of fixed priority algorithms on resources with limited priority levels. We introduce the degree of schedulable saturation \((S_{\max})\) as an objective function.
Daniel I. Katcher +2 more
openaire +2 more sources
Stochastic Scheduling with Priority Classes
Mathematics of Operations Research, 1998We consider controlled stochastic systems in which multiple job types (customers, projects, jobs, etc.) may require processing by one or more servers. The job types are all members of priority classes and admissible controls must respect the constraints imposed by these.
Renate Garbe, Kevin D. Glazebrook
openaire +1 more source
Priority Scheduling for Interactive Applications
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020Many modern parallel applications, such as desktop software and cloud-based web services, are service-oriented, long running, and perform frequent interactions with the external world (e.g., responding to user input). We want such interactive applications to provide fast response times because typically at the other end of the external interaction ...
Kyle Singer +5 more
openaire +1 more source
Dynamic priorities, priority scheduling and priority inheritance
ACM SIGAda Ada Letters, 1990Scheduling 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:
openaire +1 more source