Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems

DOI10.1137/S0097539799294398MaRDI QIDQ4507326zbMATH OpenOpenAlexFDO

Authors Håkan Lennerstad, Lars 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

01-matricescluster allocationcombinatorial formuladynamic allocationextremal combinatoricsmultiprocessoroptimal partitionoptimal performanceschedulingstatic allocation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1902275
• scientific article; zbMATH DE number 4195188
• Optimal task allocation in hyercube multiprocessor ensembles
• scientific article; zbMATH DE number 1905094
• Optimal Multiprocesses
• Comparing processor allocation strategies in multiprogrammed shared-memory multiprocessors
• Multiprocessor scheduling and combinatorial configurations
• scientific article; zbMATH DE number 1929944

Cited in

(4)

• Optimizing Givens’ Algorithm for Multiprocessors
• scientific article; zbMATH DE number 1089241 (Why is no real title available?)
• Performance bounds on multiprocessor scheduling strategies for statically allocated programs
• Optimality of systems of identically distributed competing processes

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

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