An Evaluation of Distributed Scheduling Algorithms Within the DESPOT Architecture

Current systems for managing workload on clusters of workstations, particularly those available for Linuxbased (Beowulf) clusters, are typically based on traditional process-based, coarse-grained parallel and distributed programming. The DESPOT project is building a sophisticated thread-level resource-monitoring system for computational, storage and network resources [2, 3]. In this paper we present an evaluation of several scheduling algorithms within DESPOT, our architecture for low-overhead, fine-grained resourcemonitoring tools for per-process network and other resource usage. We also present experimental results show our performance using a genetic algorithm, the MOSIX default scheduler, and a range of parameters for the multi-facetted DESPOT algorithm. We also give several examples where our scheduling algorithm outperforms the MOSIX scheduler.

• Type: Conference
• Year: 2004
• Where: PDPTA
• Authors: Daniel Andresen, Jeffrey Lebak, Ethan Bowker
• Keywords: MOSIX Default Scheduler, Multi-facetted Despot Algorithm, PDPTA 2004, PDPTA 2007, Scheduling Algorithm