Comparing processor allocation strategies in multiprogrammed shared-memory multiprocessors

DOI10.1006/JPDC.1998.1443MaRDI QIDQ1268809zbMATH OpenOpenAlexFDO

Authors Kelvin K. Yue, David J. Lilja

Publication date 1 November 1998

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1998.1443

zbMATH Keywords

processor allocationmultiprogrammed multiprocessors

Mathematics Subject Classification ID

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

Recommendations

• Implementing a dynamic processor allocation policy for multiprogrammed parallel applications in the SolarisTM
• Dynamically adapting to system load and program behavior in multiprogrammed multiprocessor systems
• Using parallel program characteristics in dynamic processor allocation policies
• scientific article; zbMATH DE number 1875376
• Characterisation of programs for scheduling in multiprogrammed parallel systems

Cited in

(6)

• Stable strategies for processor sharing systems
• Dynamically adapting to system load and program behavior in multiprogrammed multiprocessor systems
• Discriminatory Processor Sharing from Optimization Point of View
• Implementing a dynamic processor allocation policy for multiprogrammed parallel applications in the SolarisTM
• Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems
• Limited combining strategies for large-scale shared-memory multiprocessors

This page was built for publication: Comparing processor allocation strategies in multiprogrammed shared-memory multiprocessors

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