Abstract
Pipelined operator graph (POG) scheduling is an important problem in the area of parallel query optimization. A POG is a graph with vertices representing query operators that can run in parallel and edges representing communication between adjacent operators. The problem is to assign operators to processors so as to minimize the maximum processor load. We present a 2-approximation algorithm for the case where the operator graph has bounded treewidth.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
