Allocation of Tasks in a DCS Using a Different Approach with A* Considering Load
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E87-D No.7 pp.1859-1866
- Publication Date
- 2004/07/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Hardware/Software Support for High Performance Scientific and Engineering Computing)
- Category
- Distributed, Grid and P2P Computing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Biplab KUMER SARKER, Anil KUMAR TRIPATHI, Deo PRAKASH VIDYARTHI, Laurence T. YANG, Kuniaki UEHARA, "Allocation of Tasks in a DCS Using a Different Approach with A* Considering Load" in IEICE TRANSACTIONS on Information,
vol. E87-D, no. 7, pp. 1859-1866, July 2004, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e87-d_7_1859/_p
Copy
@ARTICLE{e87-d_7_1859,
author={Biplab KUMER SARKER, Anil KUMAR TRIPATHI, Deo PRAKASH VIDYARTHI, Laurence T. YANG, Kuniaki UEHARA, },
journal={IEICE TRANSACTIONS on Information},
title={Allocation of Tasks in a DCS Using a Different Approach with A* Considering Load},
year={2004},
volume={E87-D},
number={7},
pages={1859-1866},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - Allocation of Tasks in a DCS Using a Different Approach with A* Considering Load
T2 - IEICE TRANSACTIONS on Information
SP - 1859
EP - 1866
AU - Biplab KUMER SARKER
AU - Anil KUMAR TRIPATHI
AU - Deo PRAKASH VIDYARTHI
AU - Laurence T. YANG
AU - Kuniaki UEHARA
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E87-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 2004
AB - 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.
ER -
English
