Multiprocessor scheduling with communication delays

B. Veltman; B.J. Lageweg; J.K. Lenstra

Multiprocessor scheduling with communication delays

B. Veltman
, B.J. Lageweg
, J.K. Lenstra

Stochastic Operations Research

Research output: Book/Report › Report › Academic

102 Downloads (Pure)

Abstract

This paper addresses certain types of scheduling problems that arise when a parallel computation is to be executed on a multiprocessor. We define a model that allows for communication delays between precedence-related tasks, and propose a classification of various submodels. We also review complexity results and optimization and approximation algorithms that have been presented in the literature. Key Words & Phrases: scheduling, parallel processors, communication delays, lgorithms, complexity.

Original language	English
Place of Publication	Eindhoven
Publisher	Technische Universiteit Eindhoven
Number of pages	11
Publication status	Published - 1990

Publication series

Name	Memorandum COSOR
Volume	9033
ISSN (Print)	0926-4493

Access to Document

338195Final published version, 765 KB

Cite this

@book{6f56a142b9fb46ed899b687fff1d5be3,

title = "Multiprocessor scheduling with communication delays",

abstract = "This paper addresses certain types of scheduling problems that arise when a parallel computation is to be executed on a multiprocessor. We define a model that allows for communication delays between precedence-related tasks, and propose a classification of various submodels. We also review complexity results and optimization and approximation algorithms that have been presented in the literature. Key Words \& Phrases: scheduling, parallel processors, communication delays, lgorithms, complexity.",

author = "B. Veltman and B.J. Lageweg and J.K. Lenstra",

year = "1990",

language = "English",

series = "Memorandum COSOR",

publisher = "Technische Universiteit Eindhoven",

}

TY - BOOK

T1 - Multiprocessor scheduling with communication delays

AU - Veltman, B.

AU - Lageweg, B.J.

AU - Lenstra, J.K.

PY - 1990

Y1 - 1990

N2 - This paper addresses certain types of scheduling problems that arise when a parallel computation is to be executed on a multiprocessor. We define a model that allows for communication delays between precedence-related tasks, and propose a classification of various submodels. We also review complexity results and optimization and approximation algorithms that have been presented in the literature. Key Words & Phrases: scheduling, parallel processors, communication delays, lgorithms, complexity.

AB - This paper addresses certain types of scheduling problems that arise when a parallel computation is to be executed on a multiprocessor. We define a model that allows for communication delays between precedence-related tasks, and propose a classification of various submodels. We also review complexity results and optimization and approximation algorithms that have been presented in the literature. Key Words & Phrases: scheduling, parallel processors, communication delays, lgorithms, complexity.

M3 - Report

T3 - Memorandum COSOR

BT - Multiprocessor scheduling with communication delays

PB - Technische Universiteit Eindhoven

CY - Eindhoven

ER -

Multiprocessor scheduling with communication delays

Abstract

Publication series

Access to Document

Fingerprint

Cite this