Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage

DOI10.1137/0208039zbMath0441.68030OpenAlexW1990301739MaRDI QIDQ3883479

No author found.

Publication date: 1979

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0208039

zbMATH Keywords

scheduling algorithmsbatched processinglinear storage mediumminimizing expected access time

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

The optimum execution order of queries in linear storage

This page was built for publication: Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage