Static and dynamic processor allocation for higher-order concurrent languages
From MaRDI portal
Recommendations
- Performance bounds on multiprocessor scheduling strategies for statically allocated programs
- Static and dynamic processor scheduling disciplines in heterogeneous parallel architectures
- Using parallel program characteristics in dynamic processor allocation policies
- scientific article; zbMATH DE number 2112980
- Structured partitioning of concurrent programs for execution on multiprocessors
- Mapping parallel programs to multiprocessors: A dynamic approach
- Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds
Cites work
- Constraints for polymorphic behaviours of concurrent ML
- Data flow analysis of distributed communicating processes
- scientific article; zbMATH DE number 177787 (Why is no real title available?)
- scientific article; zbMATH DE number 177855 (Why is no real title available?)
- scientific article; zbMATH DE number 3592938 (Why is no real title available?)
- Program derivation by fixed point computation
- Type and behaviour reconstruction for higher-order concurrent programs
Cited in
(5)- Type reconstruction for linear \(\pi\)-calculus with I/O subtyping.
- scientific article; zbMATH DE number 1670564 (Why is no real title available?)
- Placement Inference for a Client-Server Calculus
- scientific article; zbMATH DE number 2090841 (Why is no real title available?)
- Dynamic matrices and the cost analysis of concurrent programs
This page was built for publication: Static and dynamic processor allocation for higher-order concurrent languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096756)