Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems

DOI10.1137/S0097539799294398zbMath0953.68001OpenAlexW1967188205MaRDI QIDQ4507326

Håkan Lennerstad, Lars-Erik Lundberg

Publication date: 18 October 2000

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

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

zbMATH Keywords

0schedulingoptimal partitionextremal combinatoricsmultiprocessordynamic allocationoptimal performancecluster allocationstatic allocationcombinatorial formula1-matrices

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07) Extremal combinatorics (05D99)

This page was built for publication: Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems