A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
type: Item
instance of: scholarly article
title: A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
zbMATH Open document ID: 1014.90044
author: Takao Tobita
author: Hironori Kasahara
published in: Journal of Scheduling
publication date: 2002-12-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1847200
zbMATH Keywords: multiprocessor scheduling
zbMATH Keywords: task graph
zbMATH Keywords: performance evaluation
zbMATH Keywords: benchmark
zbMATH Keywords: optimization
MaRDI profile type: Publication
full work available at URL: jos.116
OpenAlex ID: W2034919502
cites work: Optimal scheduling for two-processor systems
cites work: Optimal Scheduling Strategies in a Multiprocessor System
cites work: A comparison of list schedules for parallel processing systems
cites work: A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
cites work: Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
cites work: A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
cites work: List scheduling with and without communication delays
DOI: 10.1002/JOS.116
description: scientific article; zbMATH DE number 1847200