Coscheduling under memory constraints in a NOW environment
From MaRDI portal
Recommendations
- Implementing and analysing an effective explicit coscheduling algorithm on a NOW
- Adjusting time slices to apply coscheduling techniques in a non-dedicated NOW
- Models and algorithms for coscheduling compute-intensive tasks on a network of workstations
- Minimizing paging tradeoffs applying coscheduling techniques in a Linux cluster
- Predictive coscheduling implementation in a non-dedicated Linux cluster
Cited in
(11)- Models and algorithms for coscheduling compute-intensive tasks on a network of workstations
- IMPROVED RESOURCE UTILIZATION WITH BUFFERED COSCHEDULING
- Minimizing paging tradeoffs applying coscheduling techniques in a Linux cluster
- Implementing and analysing an effective explicit coscheduling algorithm on a NOW
- An efficient and scalable coscheduling technique for large symmetric multiprocessor clusters
- On the development of an efficient coscheduling system
- Effectively scheduling parallel tasks and communications on networks of workstations
- Multi-application scheduling in networks of workstations and clusters of processors
- Adding dynamic coscheduling support to PVM
- Predictive coscheduling implementation in a non-dedicated Linux cluster
- Adjusting time slices to apply coscheduling techniques in a non-dedicated NOW
This page was built for publication: Coscheduling under memory constraints in a NOW environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473898)
