Scheduling a Pipelined Operator Graph of Bounded Treewidth

Abstract:

Article Preview

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.

Info:

Periodical:

Key Engineering Materials (Volumes 467-469)

Edited by:

Dehuai Zeng

Pages:

1102-1107

DOI:

10.4028/www.scientific.net/KEM.467-469.1102

Citation:

S. G. Li and X. Xin, "Scheduling a Pipelined Operator Graph of Bounded Treewidth", Key Engineering Materials, Vols. 467-469, pp. 1102-1107, 2011

Online since:

February 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.