A new time optimizing probabilistic load balancing algorithm in grid computing
(2010) 2nd International Conference on Computer Engineering and Technology (ICCET) p.232-237- Abstract
- The computing grid is a distributed parallel processing system that share and choosing resources dynamically and provide need of user operation power, cost and quality .grid management resources does as a diagnostic and assigning resources scheduling and resource monitoring in grid . Scheduling process directs tasks to suitable resources. It must take place some how that load work distributed equally on resources to get the maximum interest out of existed resource, establishing load balancing is one the important performance factors in grid resource management efficiency. in this paper , loading indexes and new resource conditions in accordance with synchronous neighbourhood was suggested and also for resource allocation ,a model in... (More)
- The computing grid is a distributed parallel processing system that share and choosing resources dynamically and provide need of user operation power, cost and quality .grid management resources does as a diagnostic and assigning resources scheduling and resource monitoring in grid . Scheduling process directs tasks to suitable resources. It must take place some how that load work distributed equally on resources to get the maximum interest out of existed resource, establishing load balancing is one the important performance factors in grid resource management efficiency. in this paper , loading indexes and new resource conditions in accordance with synchronous neighbourhood was suggested and also for resource allocation ,a model in accordance with tree and probabilistic scheduling algorithm with load balancing purpose was suggested , that in this algorithm workclass, cost, deadline and herd behaviour have considered. Probabilistic algorithm chooses the resources that have better past and least completion time And leave the duties to it, in case of execution or non-execution on the resource the source will give a reward or punishment. The main purpose of this algorithm is establishing load balancing and reducing the response time and task failure percentage. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/f1eba8bd-72be-4a2b-970b-15c67c83b9ea
- author
- Moradi, Mohsen ; Abbasi Dezfuli, Mashaala and Safavi, Mohammadhassan LU
- organization
- publishing date
- 2010-04-16
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- International Conference on Computer Engineering and Technology (ICCET), 2010 2nd
- pages
- 6 pages
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- 2nd International Conference on Computer Engineering and Technology (ICCET)
- conference location
- Chengdu, China
- conference dates
- 2010-08-16 - 2010-08-18
- external identifiers
-
- scopus:77958046507
- ISBN
- 978-1-4244-6349-7
- 978-1-4244-6347-3
- DOI
- 10.1109/ICCET.2010.5486187
- language
- English
- LU publication?
- no
- id
- f1eba8bd-72be-4a2b-970b-15c67c83b9ea
- date added to LUP
- 2016-11-10 15:08:21
- date last changed
- 2024-05-03 13:27:10
@inproceedings{f1eba8bd-72be-4a2b-970b-15c67c83b9ea,
abstract = {{The computing grid is a distributed parallel processing system that share and choosing resources dynamically and provide need of user operation power, cost and quality .grid management resources does as a diagnostic and assigning resources scheduling and resource monitoring in grid . Scheduling process directs tasks to suitable resources. It must take place some how that load work distributed equally on resources to get the maximum interest out of existed resource, establishing load balancing is one the important performance factors in grid resource management efficiency. in this paper , loading indexes and new resource conditions in accordance with synchronous neighbourhood was suggested and also for resource allocation ,a model in accordance with tree and probabilistic scheduling algorithm with load balancing purpose was suggested , that in this algorithm workclass, cost, deadline and herd behaviour have considered. Probabilistic algorithm chooses the resources that have better past and least completion time And leave the duties to it, in case of execution or non-execution on the resource the source will give a reward or punishment. The main purpose of this algorithm is establishing load balancing and reducing the response time and task failure percentage.}},
author = {{Moradi, Mohsen and Abbasi Dezfuli, Mashaala and Safavi, Mohammadhassan}},
booktitle = {{International Conference on Computer Engineering and Technology (ICCET), 2010 2nd}},
isbn = {{978-1-4244-6349-7}},
language = {{eng}},
month = {{04}},
pages = {{232--237}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
title = {{A new time optimizing probabilistic load balancing algorithm in grid computing}},
url = {{http://dx.doi.org/10.1109/ICCET.2010.5486187}},
doi = {{10.1109/ICCET.2010.5486187}},
year = {{2010}},
}