Scheduling divisible loads in non-blocking mode of communication: Optimal sequencing and arrangement in a single-level tree network

Hyong Joong Kim, Taehoon Kim, V. Mani

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

2 Citations (Scopus)

Abstract

For the first time, the problem of scheduling divisible loads in a single-level tree network in the non-blocking mode of communication is considered. All earlier studies in divisible load scheduling have considered the blocking mode of communication. A closed-form expression for the processing time in non-blocking mode of communication is derived. Using this closed-form expression, this paper analytically proves a number of significant results on load sequencing and processor-link arrangement in a single-level tree network.

Original languageEnglish
Title of host publication2002 Student Conference on Research and Development: Globalizing Research and Development in Electrical and Electronics Engineering, SCOReD 2002 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages464-467
Number of pages4
ISBN (Electronic)0780375653, 9780780375659
DOIs
Publication statusPublished - 2002
Externally publishedYes
EventStudent Conference on Research and Development, SCOReD 2002 - Shah Alam, Malaysia
Duration: 2002 Jul 162002 Jul 17

Other

OtherStudent Conference on Research and Development, SCOReD 2002
CountryMalaysia
CityShah Alam
Period02/7/1602/7/17

ASJC Scopus subject areas

  • Biomedical Engineering
  • Control and Systems Engineering
  • Electrical and Electronic Engineering
  • Education

Fingerprint Dive into the research topics of 'Scheduling divisible loads in non-blocking mode of communication: Optimal sequencing and arrangement in a single-level tree network'. Together they form a unique fingerprint.

Cite this