Scheduling of pipelined operator graphs

DOI10.1007/s10951-011-0225-1zbMath1280.68084OpenAlexW1989674505WikidataQ59567568 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

SQLschedulingworst case analysisquery optimizationoperator graphpipelined parallelism

Mathematics Subject Classification ID

Database theory (68P15) 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) Approximation algorithms (68W25)

Related Items (4)

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

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

This page was built for publication: Scheduling of pipelined operator graphs