Average case analysis for batched disk scheduling and increasing subsequences

DOI10.1145/509907.509951MaRDI QIDQ3579230zbMATH OpenOpenAlexFDO

Authors Eitan Bachmat

Publication date 5 August 2010

Published in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Approximation algorithms (68W25) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Cited in

(1)

• Average case analysis of disk scheduling, increasing subsequences and spacetime geometry

This page was built for publication: Average case analysis for batched disk scheduling and increasing subsequences

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