Using parallel program characteristics in dynamic processor allocation policies
From MaRDI portal
Recommendations
Cited in
(19)- Processors selection and traffic splitting in a parallel processors system
- Comparing processor allocation strategies in multiprogrammed shared-memory multiprocessors
- Analyzing scheduling policies using Dimemas
- Characterisation of programs for scheduling in multiprogrammed parallel systems
- Energy-efficient multiprocessor scheduling for flow time and makespan
- scientific article; zbMATH DE number 1196818 (Why is no real title available?)
- scientific article; zbMATH DE number 1966229 (Why is no real title available?)
- scientific article; zbMATH DE number 2080859 (Why is no real title available?)
- scientific article; zbMATH DE number 220157 (Why is no real title available?)
- scientific article; zbMATH DE number 2087829 (Why is no real title available?)
- Dynamically adapting to system load and program behavior in multiprogrammed multiprocessor systems
- Implementing a dynamic processor allocation policy for multiprogrammed parallel applications in the SolarisTM
- scientific article; zbMATH DE number 1863298 (Why is no real title available?)
- scientific article; zbMATH DE number 1875376 (Why is no real title available?)
- scientific article; zbMATH DE number 2090680 (Why is no real title available?)
- Static and dynamic processor allocation for higher-order concurrent languages
- Scheduling in the dark
- A simulator for adaptive parallel applications
- A spatially triggered dissipative resource distribution policy for SMT processors
This page was built for publication: Using parallel program characteristics in dynamic processor allocation policies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3122438)