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

Fingerprint

scheduling
Scheduling
communication
Communication
Processing
time

ASJC Scopus subject areas

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

Cite this

Kim, H. J., Kim, T., & Mani, V. (2002). Scheduling divisible loads in non-blocking mode of communication: Optimal sequencing and arrangement in a single-level tree network. In 2002 Student Conference on Research and Development: Globalizing Research and Development in Electrical and Electronics Engineering, SCOReD 2002 - Proceedings (pp. 464-467). [1033158] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SCORED.2002.1033158

Scheduling divisible loads in non-blocking mode of communication : Optimal sequencing and arrangement in a single-level tree network. / Kim, Hyong Joong; Kim, Taehoon; Mani, V.

2002 Student Conference on Research and Development: Globalizing Research and Development in Electrical and Electronics Engineering, SCOReD 2002 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2002. p. 464-467 1033158.

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

Kim, HJ, Kim, T & Mani, V 2002, Scheduling divisible loads in non-blocking mode of communication: Optimal sequencing and arrangement in a single-level tree network. in 2002 Student Conference on Research and Development: Globalizing Research and Development in Electrical and Electronics Engineering, SCOReD 2002 - Proceedings., 1033158, Institute of Electrical and Electronics Engineers Inc., pp. 464-467, Student Conference on Research and Development, SCOReD 2002, Shah Alam, Malaysia, 02/7/16. https://doi.org/10.1109/SCORED.2002.1033158
Kim HJ, Kim T, Mani V. Scheduling divisible loads in non-blocking mode of communication: Optimal sequencing and arrangement in a single-level tree network. In 2002 Student Conference on Research and Development: Globalizing Research and Development in Electrical and Electronics Engineering, SCOReD 2002 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2002. p. 464-467. 1033158 https://doi.org/10.1109/SCORED.2002.1033158
Kim, Hyong Joong ; Kim, Taehoon ; Mani, V. / Scheduling divisible loads in non-blocking mode of communication : Optimal sequencing and arrangement in a single-level tree network. 2002 Student Conference on Research and Development: Globalizing Research and Development in Electrical and Electronics Engineering, SCOReD 2002 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2002. pp. 464-467
@inproceedings{f0e629c024ef4dc58dc7b4447f6ed000,
title = "Scheduling divisible loads in non-blocking mode of communication: Optimal sequencing and arrangement in a single-level tree network",
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.",
author = "Kim, {Hyong Joong} and Taehoon Kim and V. Mani",
year = "2002",
doi = "10.1109/SCORED.2002.1033158",
language = "English",
pages = "464--467",
booktitle = "2002 Student Conference on Research and Development: Globalizing Research and Development in Electrical and Electronics Engineering, SCOReD 2002 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Scheduling divisible loads in non-blocking mode of communication

T2 - Optimal sequencing and arrangement in a single-level tree network

AU - Kim, Hyong Joong

AU - Kim, Taehoon

AU - Mani, V.

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84971612014&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84971612014&partnerID=8YFLogxK

U2 - 10.1109/SCORED.2002.1033158

DO - 10.1109/SCORED.2002.1033158

M3 - Conference contribution

SP - 464

EP - 467

BT - 2002 Student Conference on Research and Development: Globalizing Research and Development in Electrical and Electronics Engineering, SCOReD 2002 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -