Paper Title:
Scheduling a Pipelined Operator Graph of Bounded Treewidth
  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.

  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, 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
$32.00
Share

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

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

Authors: Ding De Jiang, Wen Juan Wang, Wei Han Zhang, Peng Zhang, Ya Li
Chapter 3: Information Technologies, WEB and Networks Engineering, Information Security, E-Engineering, Software Application and Development
Abstract:This paper proposes an energy-efficient model to overcome the energy-efficient problem in large-scale IP networks, based on QoS constraints....
1747
Authors: Da Peng Qu, Hui Tu, Tie Sheng Fan
Chapter 3: Signal and Data Processing, Data Mining, Applied and Computational Mathematics
Abstract:There are plenty of intelligence algorithms and heuristic algorithms for TSP (Traveling Salesman Problem). In this paper, local optimization...
1364
Authors: Xu Ying Zhu, Kai Hu Hou, Cheng Chen, Fei Zhang, Li Yin Cao
Chapter 6: Advanced Manufacturing and Industry Engineering, Manufacturing Production, Operations, Quality and Control
Abstract:This paper focuses on the human resource allocation problems in multi-projects.The model of multi-project human resource allocation was...
447