Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Parallel Application Scheduling on Networks of Workstations Stergios V. Anastasiadis and Kenneth C. Sevcik
 

Summary: Parallel Application Scheduling on Networks of Workstations
Stergios V. Anastasiadis and Kenneth C. Sevcik
Computer Systems Research Institute
University of Toronto
{stergios,kcs}@cs.toronto.edu
Abstract
Parallel applications can be executed using the idle computing capacity of workstation clus-
ters. However, it remains unclear how to most effectively schedule the processors among different
applications. Processor scheduling algorithms that were successful for shared-memory machines
have proven to be inadequate for distributed memory environments due to the high costs of remote
memory accesses and redistributing data.
We investigate how knowledge of system load and application characteristics can be used in
scheduling decisions. We propose the new algorithm AEP(2) which, by properly exploiting both
the information types above, performs better than other non-preemptive scheduling rules, and nearly
as well as idealized versions of preemptive rules (with free preemption). We conclude that AEP(2)
is suitable for use in scheduling parallel applications on networks of workstations.
1 Introduction
Advances in software and hardware technology continuously improve the performance of workstation
clusters. Load balancing software which allows efficient use of otherwise underutilized resources is
now commercially available. However, techniques and policies for efficiently supporting workloads

  

Source: Anastasiadis, Stergios V. - Department of Computer Science, University of Ioannina

 

Collections: Computer Technologies and Information Sciences