Scheduling series-parallel task graphs to minimize peak memory
DOI10.1016/j.tcs.2017.09.037zbMath1383.68013OpenAlexW2685149245MaRDI QIDQ1685958
Bora Uçar, Thomas Lambert, Loris Marchal, Enver Kayaaslan
Publication date: 20 December 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01891937/file/seriesElsevierSecondSubmission.pdf
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Min Cut is NP-complete for edge weighted trees
- Parallel recognition of series-parallel graphs
- Scheduling UET-UCT series-parallel graphs on two processors
- Memory-optimal evaluation of expression trees involving large objects
- ON SCHEDULING SERIES-PARALLEL DAGs TO MAXIMIZE AREA
- Encyclopedia of Parallel Computing
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- On the storage requirement in the out-of-core multifrontal method for sparse factorization
- A polynomial algorithm for the min-cut linear arrangement of trees
- An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
- An Adaptive General Sparse Out-Of-Core Cholesky Factorization Scheme
- Sequencing with Series-Parallel Precedence Constraints
- The Pebbling Problem is Complete in Polynomial Space
- The Recognition of Series Parallel Digraphs
- Inapproximability of Treewidth and Related Problems
- Cutwidth I: A linear time fixed parameter algorithm
- The Generation of Optimal Code for Arithmetic Expressions
This page was built for publication: Scheduling series-parallel task graphs to minimize peak memory
