A heuristic for the maximum processor requirement for scheduling layered task graphs with cloning
type: Item
instance of: scholarly article
title: A heuristic for the maximum processor requirement for scheduling layered task graphs with cloning
zbMATH Open document ID: 0909.68015
author: K. Appert
published in: Journal of Parallel and Distributed Computing
publication date: 1999-03-22T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 1216787
zbMATH Keywords: optimally scheduling
MaRDI profile type: Publication
full work available at URL: jpdc.1997.1416
OpenAlex ID: W2016818801
DOI: 10.1006/JPDC.1997.1416
Recommended article: A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
Recommended article: Q4450046
Recommended article: Heuristic algorithms for task assignment and scheduling in a processor network
Recommended article: A heuristic for scheduling task graphs with communication delays onto multiprocessors
Recommended article: Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication
Recommended article: Parallel Processing and Applied Mathematics
Recommended article: A Heuristic of Scheduling Parallel Tasks and Its Analysis
description: scientific article; zbMATH DE number 1216787