Divisible load scheduling in single-level tree networks

Optimal sequencing and arrangement in the nonblocking mode of communication

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

The problem of scheduling divisible loads in a single-level tree network is considered. All the earlier studies in divisible load scheduling consider the blocking mode of communication. In this paper, the nonblocking mode of communication is considered. Closed-form expression for the processing time in the nonblocking 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. It is shown that the performance measures of interest such as the processing time, idle time, and utilization of processors are better in the nonblocking mode of communication than in the blocking mode of communication.

Original languageEnglish
Pages (from-to)1611-1623
Number of pages13
JournalComputers and Mathematics with Applications
Volume46
Issue number10-11
DOIs
Publication statusPublished - 2003 Nov
Externally publishedYes

Fingerprint

Divisible Loads
Tree Networks
Sequencing
Arrangement
Scheduling
Communication
Closed-form
Processing
Performance Measures

Keywords

  • Divisible loads
  • Nonblocking mode of communication
  • Optimal load sequence
  • Processing time
  • Single-level tree network

ASJC Scopus subject areas

  • Applied Mathematics
  • Computational Mathematics
  • Modelling and Simulation

Cite this

@article{97b62c21da4743219294fa9815afe9f2,
title = "Divisible load scheduling in single-level tree networks: Optimal sequencing and arrangement in the nonblocking mode of communication",
abstract = "The problem of scheduling divisible loads in a single-level tree network is considered. All the earlier studies in divisible load scheduling consider the blocking mode of communication. In this paper, the nonblocking mode of communication is considered. Closed-form expression for the processing time in the nonblocking 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. It is shown that the performance measures of interest such as the processing time, idle time, and utilization of processors are better in the nonblocking mode of communication than in the blocking mode of communication.",
keywords = "Divisible loads, Nonblocking mode of communication, Optimal load sequence, Processing time, Single-level tree network",
author = "Kim, {Hyong Joong} and V. Mani",
year = "2003",
month = "11",
doi = "10.1016/S0898-1221(03)90196-9",
language = "English",
volume = "46",
pages = "1611--1623",
journal = "Computers and Mathematics with Applications",
issn = "0898-1221",
publisher = "Elsevier Limited",
number = "10-11",

}

TY - JOUR

T1 - Divisible load scheduling in single-level tree networks

T2 - Optimal sequencing and arrangement in the nonblocking mode of communication

AU - Kim, Hyong Joong

AU - Mani, V.

PY - 2003/11

Y1 - 2003/11

N2 - The problem of scheduling divisible loads in a single-level tree network is considered. All the earlier studies in divisible load scheduling consider the blocking mode of communication. In this paper, the nonblocking mode of communication is considered. Closed-form expression for the processing time in the nonblocking 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. It is shown that the performance measures of interest such as the processing time, idle time, and utilization of processors are better in the nonblocking mode of communication than in the blocking mode of communication.

AB - The problem of scheduling divisible loads in a single-level tree network is considered. All the earlier studies in divisible load scheduling consider the blocking mode of communication. In this paper, the nonblocking mode of communication is considered. Closed-form expression for the processing time in the nonblocking 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. It is shown that the performance measures of interest such as the processing time, idle time, and utilization of processors are better in the nonblocking mode of communication than in the blocking mode of communication.

KW - Divisible loads

KW - Nonblocking mode of communication

KW - Optimal load sequence

KW - Processing time

KW - Single-level tree network

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

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

U2 - 10.1016/S0898-1221(03)90196-9

DO - 10.1016/S0898-1221(03)90196-9

M3 - Article

VL - 46

SP - 1611

EP - 1623

JO - Computers and Mathematics with Applications

JF - Computers and Mathematics with Applications

SN - 0898-1221

IS - 10-11

ER -