Performance Bounds on Scheduling Parallel Tasks with Communication Cost

スポンサーリンク

概要

• 論文の詳細を見る

• This paper investigates the problem of scheduling "parallel tasks" with consideration of communication cost on an m-processor system, where processors are assumed to be identical and tasks being scheduled are independent such that they can run on more than one processor simultaneously. Once a task is processed in parallel, its finish time will be speeded up, but communication cost will also be incurred and should be taken into account. To find a schedule with minimum finish time for the parallel tasks scheduling problem is NP-hard. Therefore, in this paper, we will propose a heuristic algorithm for this kind of problem and derive its performance bounds for two different cases of applications, respectively.

• 社団法人電子情報通信学会の論文
• 1995-03-25

著者

• Chen Sao-jie

  Department Of Electrical Engineering National Taiwan University

• Lin Jiann-fu

  Department Of Management Information System Takming University Of Science And Technology

• Lin Jiann-fu

  Department Of Management Takming Junior College Of Commerce

• See Win-Bin

  Department of Electrical Engineering, National Taiwan University

• See Win-bin

  Department Of Electrical Engineering National Taiwan University

関連論文

• DESC : A Hardware-Software Codesign Methodology for Distributed Embedded Systems
• Hardware-Software Multi-Level Partitioning for Distributed Embedded Multiprocessor Systems
• Hardware-Software Timing Coverification of Distributed Embedded Systems
• MOBnet: An Extended Petri Net Model for the Concurrent Object-Oriented System-Level Synthesis of Multiprocessor Systems
• A Collaborative Knowledge Management Process for Implementing Healthcare Enterprise Information Systems
• A New Approach to the Ball Grid Array Package Routing
• Performance Bounds on Scheduling Parallel Tasks with Communication Cost
• Scheduling Parallel Tasks with Communication Overhead in an Environment with Multiple Machines

スポンサーリンク