{"title":"The design of a simulation system for distributed task scheduling algorithms","authors":"Jiannong Cao, M. Pole","doi":"10.1109/ICAPP.1995.472256","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAPP.1995.472256","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.<>