Minimizing paging tradeoffs applying coscheduling techniques in a Linux cluster

DOI10.1007/3-540-36569-9_40MaRDI QIDQ4414817zbMATH OpenFDO

Authors Francesc Giné, Francesc Solsona, Porfidio Hernández, Emilio Luque

Publication date 27 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2565/25650593.htm

Mathematics Subject Classification ID

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

Recommendations

• Predictive coscheduling implementation in a non-dedicated Linux cluster
• IMPROVED RESOURCE UTILIZATION WITH BUFFERED COSCHEDULING
• Coscheduling under memory constraints in a NOW environment
• An efficient and scalable coscheduling technique for large symmetric multiprocessor clusters
• Adjusting the lengths of time slices when scheduling PVM jobs with high memory requirements

Cited in

(5)

• Design and implementation of an agent home scheme strategy for prefetch-based DSM systems
• An efficient and scalable coscheduling technique for large symmetric multiprocessor clusters
• Coscheduling under memory constraints in a NOW environment
• Efficient memory page replacement on web server clusters
• Predictive coscheduling implementation in a non-dedicated Linux cluster

This page was built for publication: Minimizing paging tradeoffs applying coscheduling techniques in a Linux cluster

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