Adjusting Time Slices to Apply Coscheduling Techniques in a Non-dedicated NOW (Research Note)

Authors:
Francesc Giné;Francesc Solsona;Porfidio Hernández;Emilio Luque
Affiliations:
-;-;-;-
Venue:
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Year:
2002

Citing 5
Cited 0

Architectural requirements and scalability of the NAS parallel benchmarks

SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Dynamic Coscheduling on Workstation Clusters

IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
An Efficient and Scalable Coscheduling Technique for Large Symmetric Multiprocessor Clusters

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
Predictive Coscheduling Implementation in a Non-dedicated Linux Cluster

Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Our research is focussed on keeping both local and parallel jobs together in a time-sharing NOW and efficiently scheduling them by means of coscheduling mechanisms. In such systems, the proper length of the time slice still remains an open question. In this paper, an algorithm is presented to adjust the length of the quantum dynamically to the necessity of the distributed tasks while keeping good response time for interactive processes. It is implemented and evaluated in a Linux cluster.