Design of a simulation system for distributed task scheduling algorithms

Jiannong Cao, Mathew Pole

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

Abstract

Task scheduling is an important part of any distributed computing environment. Distributed task scheduling algorithms aim at attaining increased performance of a distributed system by distributing the tasks of distributed programs onto the processors of the system. In designing a task scheduling mechanism, one needs to evaluate performance of task scheduling algorithms in order to decide among several algorithms or several versions of an algorithm. This paper describes the design of a general simulation system for distributed task scheduling algorithms. The design is highly modular and provides a system that can be configured and extended to simulate and evaluate different algorithms under different environments. The implementation of DisMimic, a prototype of the simulation system is also described. The framework described in this paper provides a basis of building toolbox to simplify the study of distributed task scheduling algorithms.
Original languageEnglish
Title of host publicationIEEE International Conference on Algorithms and Architectures for Parallel Processing
PublisherIEEE
Pages690-698
Number of pages9
Publication statusPublished - 1 Jan 1995
Externally publishedYes
EventProceedings of the IEEE 1st International Conference on Algorithms and Architectures for Parallel Processing. Part 1 (of 2) - Brisbane, Australia
Duration: 19 Apr 199521 Apr 1995

Conference

ConferenceProceedings of the IEEE 1st International Conference on Algorithms and Architectures for Parallel Processing. Part 1 (of 2)
CountryAustralia
CityBrisbane
Period19/04/9521/04/95

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this