A Comparison of Random Task Graph Generation Methods for Scheduling Problems

DOI10.1007/978-3-030-29400-7_5zbMath1437.68035arXiv1902.05808OpenAlexW2969469920MaRDI QIDQ3297563

Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam

Publication date: 20 July 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.05808

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Uses Software

• TGFF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random orders
• NP-complete scheduling problems
• A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
• Random Generation of Directed Acyclic Graphs
• A comparison of list schedules for parallel processing systems
• On the Number of Maximal Vertices of a Random Acyclic Digraph
• `` Strong NP-Completeness Results
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Transitive Reduction of a Directed Graph

This page was built for publication: A Comparison of Random Task Graph Generation Methods for Scheduling Problems