Scheduling of pipelined operator graphs

DOI10.1007/s10951-011-0225-1zbMath1280.68084WikidataQ59567568 ScholiaQ59567568MaRDI QIDQ2434287

Petra Schuurman, Hans L. Bodlaender, Gerhard J. Woeginger

Publication date: 5 February 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-011-0225-1

zbMATH Keywords

SQL; scheduling; worst case analysis; query optimization; operator graph; pipelined parallelism

Mathematics Subject Classification ID

68P15: Database theory

68R10: Graph theory (including graph drawing) in computer science

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68W25: Approximation algorithms

Related Items

Balanced partitions of trees and applications, Structural parameters, tight bounds, and approximation for \((k, r)\)-center, Balanced tree partition problems with virtual nodes

Cites Work

• Multiprocessor scheduling with communication delays
• Approximation schemes for scheduling on parallel machines
• A partial k-arboretum of graphs with bounded treewidth
• Integer Programming with a Fixed Number of Variables
• Deterministic Dcomposition of Recursive Graph Classes
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Unnamed Item
• Unnamed Item
• Unnamed Item