Extremal scheduling of parallel processing with and without real-time constraints

DOI10.1145/174147.169745MaRDI QIDQ4285638zbMATH OpenOpenAlexFDO

Authors Francois Baccelli, Zhen Liu, Don Towsley

Publication date 11 September 1994

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/174147.169745

zbMATH Keywords

longest due time firstthroughputstochastic orderingshortest due time firstSchur convex orderingresponse timereal- time constraintsprecedence constraintsparallel processingoptimal schedulingconvex orderinglocal order preservingLIFOLCFSFIFOFCFSextremal policydatenessconvex symmetric ordering

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• On optimal lateness and tardiness scheduling in real-time systems
• Scheduling parallel processors: Structural properties and optimal policies
• Dynamic on-line task scheduling on parallel processors
• On the optimality of static priority policies in stochastic scheduling on parallel machines
• Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors

Cited in

(19)

• On optimal lateness and tardiness scheduling in real-time systems
• Effects of service disciplines in \(G/GI/s\) queueing systems
• Dual-priority versus background scheduling: A path-wise comparison
• Static and dynamic processor scheduling disciplines in heterogeneous parallel architectures
• Sample path methods in the control of queues
• On the Scalability of Constraint Solving for Static/Off-Line Real-Time Scheduling
• A performance evaluation of several priority policies for parallel processing systems
• On Scheduling Policies for Streams of Structured Jobs
• A note on preemptive scheduling of multiclass jobs with geometric service times and hard deadlines
• Preemptive LCFS scheduling in hard real-time applications
• On Nonpreemptive LCFS Scheduling with Deadlines
• On-line scheduling policies for a class of IRIS (increasing reward with increasing service) real-time tasks
• Dynamic on-line task scheduling on parallel processors
• An execution/sleep scheduling policy for serving an additional job in priority queueing systems
• Optimal Scheduling of Multiclass Stochastic Systems
• Dynamic routing of real-time jobs among parallel EDF queues: a performance study
• The performance of priority rules for the dynamic stochastic resource-constrained multi-project scheduling problem: an experimental investigation
• The concept of maximal unschedulable deadline assignment for optimization in fixed-priority scheduled real-time systems
• Delay-bounded scheduling without delay!

This page was built for publication: Extremal scheduling of parallel processing with and without real-time constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285638)