Allocation of Tasks in a DCS Using a Different Approach with A^* Considering Load(Distributed, Grid and P2P Computing)(<Special Section>Hardware/Software Support for High Performance Scientific and Engineering Computing)

スポンサーリンク

概要

• 論文の詳細を見る

• In a Distributed Computing Systems (DCS) tasks submitted to it, are usually partitioned into different modules and these modules may be allocated to different processing nodes so as to achieve minimum turn around time of the tasks utilizing the maximum resources of the existing system such as CPU speed, memory capacities etc. The problem lies on how to obtain the optimal allocation of these multiple tasks by keeping in mind that no processing node is overloaded due to this allocation. This paper proposes an algorithm A^*RS, using well-known A^*, which aims to reduce the search space and time for task allocation. It aims at minimization of turn around time of tasks in the way so that processing nodes do not become overloaded due to this allocation. Our experimental results justify the claims with necessary supports by comparing it with the earlier algorithm for multiple tasks allocation.

• 社団法人電子情報通信学会の論文
• 2004-07-01

著者

• Kumar Tripathi

  Department Of Computer Engineering I.t. Banaras Hindu University

• KUMER SARKER

  Graduate School of Science and Technology, Kobe University

• PRAKASH VIDYARTHI

  Department of Computer Science, Banaras Hindu University

• YANG Laurence

  Department of Computer Science, St. Francis Xavier University

• UEHARA Kuniaki

  Graduate School of Science and Technology, Kobe University

• Prakash Vidyarthi

  Department Of Computer Science Banaras Hindu University

• Kumer Sarker

  Graduate School Of Science And Technology Kobe University

• Yang Laurence

  Department Of Computer Science St. Francis Xavier University

• Uehara Kuniaki

  Graduate School Of Science And Technology Kobe University

• Uehara Kuniaki

  Research Center For Urban Safety And Security Kobe University

関連論文

• Allocation of Tasks in a DCS Using a Different Approach with A^* Considering Load(Distributed, Grid and P2P Computing)(Hardware/Software Support for High Performance Scientific and Engineering Computing)
• A Performance Study of Task Allocation Algorithms in a Distributed Computing System(DCS)(Special Issue on Parallel and Distributed Computing, Applications and technologies)
• Fast Parallel Solution for Set-Packing and Clique Problems by DNA-Based Computing(Scientific and Engineering Computing with Applications)(Hardware/Software Support for High Performance Scientific and Engineering Computing)
• Mining from Semi-structured Data and Knowledge Integration (データベースシステム 研究報告 特集:空間メディアとGIS,および一般)
• Mutual Knowledge Use between Mining from Semi-Structured Data and Information Extraction Using HMM
• Evaluation of the Feedback Guided Dynamic Loop Scheduling (FGDLS) Algorithms(Distributed, Grid and P2P Computing)(Hardware/Software Support for High Performance Scientific and Engineering Computing)

スポンサーリンク