Dynamic Cluster Resource Allocations for Jobs with Known and Unknown Memory Demands
IEEE Transactions on Parallel and Distributed Systems
Adaptive Scheduling under Memory Pressure on Multiprogrammed SMPs
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Gang Scheduling with a Queue for Large Jobs
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Coscheduling under Memory Constraints in a NOW Environment
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
On the Development of an Efficient Coscheduling System
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
Effects of Memory Performance on Parallel Job Scheduling
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Memory Management Techniques for Gang Scheduling
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Adaptive scheduling under memory constraints on non-dedicated computational farms
Future Generation Computer Systems - Selected papers from CCGRID 2002
Dynamic Load Sharing With Unknown Memory Demands in Clusters
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Adaptive Memory Allocations in Clusters to Handle Unexpectedly Large Data-Intensive Jobs
IEEE Transactions on Parallel and Distributed Systems
Coscheduling in Clusters: Is It a Viable Alternative?
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Effectively Utilizing Global Cluster Memory for Large Data-Intensive Parallel Programs
IEEE Transactions on Parallel and Distributed Systems
LOMARC: Lookahead Matchmaking for Multiresource Coscheduling on Hyperthreaded CPUs
IEEE Transactions on Parallel and Distributed Systems
User-guided symbiotic space-sharing of real workloads
Proceedings of the 20th annual international conference on Supercomputing
A comprehensive performance and energy consumption analysis of scheduling alternatives in clusters
The Journal of Supercomputing
Cooperating coscheduling: a coscheduling proposal aimed at non-dedicated heterongeneous NOWs
Journal of Computer Science and Technology
The hybrid scheduling framework for virtual machine systems
Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments
Proceedings of the second international workshop on Data-aware distributed computing
Dynamic cluster resource allocations for jobs with known memory demands
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
Symbiotic space-sharing on SDSC's datastar system
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
Minimizing paging tradeoffs applying coscheduling techniques in a linux cluster
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
A distributed paging RAM grid system for wide-area memory sharing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Gang scheduling in multi-core clusters implementing migrations
Future Generation Computer Systems
Parallel job scheduling — a status report
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
Reconfigurable gang scheduling algorithm
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
LOMARC — lookahead matchmaking for multi-resource coscheduling
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
AnthillSched: a scheduling strategy for irregular and iterative I/O-intensive parallel jobs
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Pitfalls in parallel job scheduling evaluation
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Scheduling of frequently communicating tasks
International Journal of Communication Systems
Static and dynamic job scheduling with communication aware policy in cluster computing
Computers and Electrical Engineering
Hi-index | 0.00 |
A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the synchronism among a job's processes. An alternative is to impose admission controls, and only admit jobs that fit into the available memory. Despite suffering from delayed execution, this leads to better overall performance by preventing the harmful effects of paging and thrashing.