Yi Gu
ABSTRACT
We consider six classes of linear pipeline configuration problems with different mapping objectives and network constraints in distributed heterogeneous computing environments. We prove that two of them are polynomially solvable and the rest are NP-complete, for each of which, an optimal or heuristic algorithm based on dynamic programming is designed. Extensive simulation results illustrate the efficacy of these algorithms in comparison with existing methods.
- Y. Gu, Q. Wu, M. Zhu, and N. Rao. Complexity analysis of pipeline mapping problems in distributed heterogeneous networks. In Proc. of The International Symposium on Computer and Sensor Networks and Systems, Zhengzhou, China, April 7-11 2008.Google Scholar
- Q. Wu, Y. Gu, M. Zhu, and N. Rao. Optimizing network performance of computing pipelines in distributed environments. In Proc. of 22nd IEEE International Parallel and Distributed Processing Symposium, Miami, Florida, April 14-18 2008.Google ScholarCross Ref
Index Terms
- Efficient pipeline configuration in distributed heterogeneous computing environments
Recommendations
Generalized hypertree decompositions: np-hardness and tractable variants
PODS '07: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsThe generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergraphs have bounded GHW are known to be solvable in polynomial time. However,...
Supporting Distributed Application Workflows in Heterogeneous Computing Environments
ICPADS '08: Proceedings of the 2008 14th IEEE International Conference on Parallel and Distributed SystemsNext-generation computation-intensive applications in various fields of science and engineering feature large-scale computing workflows with complex structures that are often modeled as directed acyclic graphs. Supporting such task graphs and optimizing ...
The Complexity of Planar Counting Problems
We prove the #P-hardness of the counting problems associated with various satisfiability, graph, and combinatorial problems, when restricted to planar instances. These problems include 3Sat, 1-3Sat, 1-Ex3Sat, Minimum Vertex Cover, Minimum Dominating Set,...
Comments