Task allocation algorithm for distributed computing systems

Stephen S. Yau, Venkeepuram R. Satish

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Most performance lapses in distributed computing systems can be traced to the lack of good task allocation strategy for distributed software. Random assignment of tasks or modules onto processors or subsystems can substantially degrade the performance of the entire distributed system. In this paper a heuristic algorithm for task allocation for any distributed computing system where the subsystems are connected in the form of a local area network and communicate by means of broadcasting is presented. This algorithm is based on minimizing communication cost and balancing the load among its subsystems. An example to illustrate our algorithm is also given.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE Computer Society's International Computer Software & Applications Conference
Editors Anon
PublisherPubl by IEEE
Pages336-342
Number of pages7
ISBN (Print)0818644400
StatePublished - Dec 1 1993
Externally publishedYes
EventProceedings of the 17th Annual International Computer Software & Applications Conference - COMPSAC 93 - Phoenix, AZ, USA
Duration: Nov 1 1993Nov 5 1993

Publication series

NameProceedings - IEEE Computer Society's International Computer Software & Applications Conference
ISSN (Print)0730-6512

Other

OtherProceedings of the 17th Annual International Computer Software & Applications Conference - COMPSAC 93
CityPhoenix, AZ, USA
Period11/1/9311/5/93

ASJC Scopus subject areas

  • Software
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Task allocation algorithm for distributed computing systems'. Together they form a unique fingerprint.

Cite this