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

DOI10.1145/174147.169745zbMath0795.68021OpenAlexW1982450204MaRDI QIDQ4285638

Don Towsley, Zhen Liu, François Baccelli

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

response timestochastic orderingparallel processingprecedence constraintsFIFOthroughputoptimal schedulingconvex orderingLCFSLIFOFCFSSchur convex orderingconvex symmetric orderingdatenessextremal policylocal order preservinglongest due time firstreal- time constraintsshortest due time first

Mathematics Subject Classification ID

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

Related Items (3)

Sample path methods in the control of queues ⋮ Optimal Scheduling of Multiclass Stochastic Systems ⋮ Effects of service disciplines in \(G/GI/s\) queueing systems

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