EFFICIENT PARALLEL JOB SCHEDULING USING GANG SERVICE
From MaRDI portal
Publication:5249256
Recommendations
- scientific article; zbMATH DE number 2221459
- scientific article; zbMATH DE number 5500652
- scientific article; zbMATH DE number 2080863
- Approximation and Online Algorithms
- Group based job scheduling to increase the high-performance computing efficiency
- Scheduling parallel jobs on heterogeneous platforms
- Simultaneous job scheduling and resource allocation on parallel machines
Cites work
This page was built for publication: EFFICIENT PARALLEL JOB SCHEDULING USING GANG SERVICE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249256)