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

Hyoung Joong Kim; Taehoon Kim; V. Mani

doi:10.1109/SCORED.2002.1033158

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

Hyoung Joong Kim, Taehoon Kim, V. Mani

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	2002 Student Conference on Research and Development
Subtitle of host publication	Globalizing Research and Development in Electrical and Electronics Engineering, SCOReD 2002 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	464-467
Number of pages	4
ISBN (Electronic)	0780375653, 9780780375659
DOIs	https://doi.org/10.1109/SCORED.2002.1033158
Publication status	Published - 2002
Externally published	Yes
Event	Student Conference on Research and Development, SCOReD 2002 - Shah Alam, Malaysia Duration: 2002 Jul 16 → 2002 Jul 17

Publication series

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

Other

Other	Student Conference on Research and Development, SCOReD 2002
Country/Territory	Malaysia
City	Shah Alam
Period	02/7/16 → 02/7/17

ASJC Scopus subject areas

Biomedical Engineering
Control and Systems Engineering
Electrical and Electronic Engineering
Education

Access to Document

10.1109/SCORED.2002.1033158

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] (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.. 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, Hyoung 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 (2002 Student Conference on Research and Development: Globalizing Research and Development in Electrical and Electronics Engineering, SCOReD 2002 - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference 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, 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., 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. (2002 Student Conference on Research and Development: Globalizing Research and Development in Electrical and Electronics Engineering, SCOReD 2002 - Proceedings). doi: 10.1109/SCORED.2002.1033158

Kim, Hyoung 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 (2002 Student Conference on Research and Development: Globalizing Research and Development in Electrical and Electronics Engineering, SCOReD 2002 - Proceedings).

@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, {Hyoung Joong} and Taehoon Kim and V. Mani",

note = "Funding Information: Acknowledgment This work was in part supported by the BK21 Project under the auspices of Kangwon National University and in part by the IDEC under the auspices of KAIST. Publisher Copyright: {\textcopyright} 2002 IEEE.; Student Conference on Research and Development, SCOReD 2002 ; Conference date: 16-07-2002 Through 17-07-2002",

year = "2002",

doi = "10.1109/SCORED.2002.1033158",

language = "English",

series = "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.",

pages = "464--467",

booktitle = "2002 Student Conference on Research and Development",

}

TY - GEN

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

T2 - Student Conference on Research and Development, SCOReD 2002

AU - Kim, Hyoung Joong

AU - Kim, Taehoon

AU - Mani, V.

N1 - Funding Information: Acknowledgment This work was in part supported by the BK21 Project under the auspices of Kangwon National University and in part by the IDEC under the auspices of KAIST. Publisher Copyright: © 2002 IEEE.

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

U2 - 10.1109/SCORED.2002.1033158

DO - 10.1109/SCORED.2002.1033158

M3 - Conference contribution

AN - SCOPUS:84971612014

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

SP - 464

EP - 467

BT - 2002 Student Conference on Research and Development

PB - Institute of Electrical and Electronics Engineers Inc.

Y2 - 16 July 2002 through 17 July 2002

ER -

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

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this