Affine scheduling on bounded convex polyhedric domains is asymptotically optimal
From MaRDI portal
Publication:1128739
DOI10.1016/S0304-3975(97)00209-0zbMath0983.68016OpenAlexW2088390443MaRDI QIDQ1128739
Patrick Le Gouëslier d'Argence
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00209-0
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work