An optimal algorithm for scheduling interval ordered tasks with communication on \(N\) processors
type: Item
instance of: scholarly article
title: An optimal algorithm for scheduling interval ordered tasks with communication on \(N\) processors
zbMATH Open document ID: 0830.68007
author: Hesham H. Ali
author: Hesham El-Rewini
published in: Journal of Computer and System Sciences
publication date: 1995-12-03T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 809421
zbMATH Keywords: multiprocessor systems
zbMATH Keywords: scheduling problem
MaRDI profile type: Publication
full work available at URL: jcss.1995.1068
OpenAlex ID: W1970631330
DOI: 10.1006/JCSS.1995.1068
Recommended article: Scheduling an interval ordered precedence graph with communication delays and a limited number of processors
Recommended article: Q4813028
Recommended article: Scheduling interval-ordered tasks with non-uniform deadlines subject to non-zero communication delays
Recommended article: An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
Recommended article: An efficient parallel algorithm for scheduling interval ordered tasks
Recommended article: Q4536418
Recommended article: Scheduling interval orders with communication delays in parallel
Recommended article: Scheduling with Interjob Communication on Parallel Processors
Recommended article: Scheduling with interjob communication on parallel processors
Recommended article: On the minimum number of processors for scheduling problems with communication delays
description: scientific article; zbMATH DE number 809421