Results 171 to 180 of about 2,490 (199)

Analysis of SRPT Scheduling: Investigating Unfairness

ACM SIGMETRICS Performance Evaluation Review, 2000
The Shortest-Remaining-Processing-Time (SRPT) scheduling policy has long been known to be optimal for minimizing mean response time (sojourn time). Despite this fact, SRPT scheduling is rarely used in practice. It is believed that the performance improvements of SRPT over other scheduling policies stem from the fact that SRPT unfairly penalizes the ...
Bansal, N., Harchol-Balter, M.
openaire   +2 more sources

Stability Analysis of Runway Schedules

IEEE Transactions on Intelligent Transportation Systems, 2016
By performing stability analysis on an optimal runway schedule, this paper derives a method to determine whether an optimized landing sequence of aircraft remains optimal after an arbitrary number of aircraft in that sequence are delayed by an arbitrary amount of time.
Moritz Niendorf, Pierre T. Kabamba, Anouck R. Girard   +2 more
openaire   +1 more source

An Analysis of Partially Clairvoyant Scheduling

Journal of Mathematical Modelling and Algorithms, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Analysis of a scheduler for a CAD framework

Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002), 1999
The experience report describes a case study in which a key component of a software system was modeled and analyzed to better understand a proposed algorithm prior to implementation. A Promela model of a linear scheduler for a CAD framework was developed.
David S. Keyes, Laura K. Dillon, Moon-Jung Chung   +2 more
openaire   +1 more source

An Analysis of Totally Clairvoyant Scheduling

Journal of Scheduling, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Sensitivity Analysis for Scheduling Problems

Journal of Scheduling, 2004
This paper represents a first attempt at a systematic study of sensitivity analysis for scheduling problems. Because schedules contain both combinatorial and temporal structures, scheduling problems present unique issues for sensitivity analysis. Some of the issues that we discuss have not been considered before.
Nicholas G. Hall, Marc E. Posner
openaire   +1 more source

State-based scheduling with tree schedules: analysis and evaluation

Real-Time Systems, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Madhukar Anand, Sebastian Fischmeister, Insup Lee 0001, Linh T. X. Phan   +3 more
openaire   +1 more source

Schedulability analysis of acyclic processes

Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279), 2002
The paper describes the analysis of worst case execution times for a class of acyclic processes that can express precedence constraints and internal computational delays. The motivation for our work comes from hardware designs where a scheduler allocates exclusive access to a memory bus. Blocks that execute concurrently generate read and write requests.
Michael J. Meyer, Howard Wong-Toi
openaire   +1 more source

A Probabilistic Framework for Schedulability Analysis

2003
The limitations of the deterministic formulation of scheduling are outlined and a probabilistic approach is motivated. A number of models are reviewed with one being chosen as a basic framework. Response-time analysis is extended to incorporate a probabilistic characterisation of task arrivals and execution times.
Alan Burns 0001, Guillem Bernat, Ian Broster   +2 more
openaire   +1 more source

Analysis of LDPC decoding schedules

2009 IEEE International Symposium on Information Theory, 2009
Schedule is the order of passing messages between vertices of the bipartite graph defining an LDPC code during decoding. Schedules may significantly differ in the rate of decoding convergence. New efficient generalized serial schedules are described and analyzed.
Eran Sharon, Noam Presman, Simon Litsyn
openaire   +1 more source