Optimal Replication of Series-Parallel Graphs for Computation-Intensive Applications

Sheng Tzong Cheng, Ashok K. Agrawala

研究成果: Article同行評審

摘要

We consider the replication problem of series-parallel (SP) task graphs where each task may run on more than one processor. The objective of the problem is to minimize the total cost of task execution and interprocessor communication. We call it the minimum cost replication problem for SP graphs (MCRP-SP). In this paper, we adopt a new communication model where the purpose of replication is to reduce the total cost. The class of applications we consider is computation-intensive applications in which the execution cost of a task is greater than its communication cost. The complexity of MCRP-SP for such applications is proved to be NP-complete. We present a branch-and-bound method to find an optimal solution as well as an approximation approach for a suboptimal solution. The numerical results show that such replication may lead to a lower cost than the optimal assignment problem (in which each task is assigned to only one processor) does. The proposed optimal solution has complexity O(n22nM), while the approximation solution has O(n4M2), where n is the number of processors in the system and M is the number of tasks in the graph.

原文English
頁(從 - 到)113-129
頁數17
期刊Journal of Parallel and Distributed Computing
28
發行號2
DOIs
出版狀態Published - 1995 八月 1

All Science Journal Classification (ASJC) codes

  • 軟體
  • 理論電腦科學
  • 硬體和架構
  • 電腦網路與通信
  • 人工智慧

指紋

深入研究「Optimal Replication of Series-Parallel Graphs for Computation-Intensive Applications」主題。共同形成了獨特的指紋。

引用此