Random Articles
Reseach Article
Investigation of the Scheduler for Heterogeneous Distributed Computing Systems based on Minimal Cover Method
by
S. V. Listrovoy,
S. V. Minukhin,
S. V. Znakhur
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 51 - Number 19 |
| Year of Publication: 2012 |
| Authors: S. V. Listrovoy, S. V. Minukhin, S. V. Znakhur |
10.5120/8154-1948
|
S. V. Listrovoy, S. V. Minukhin, S. V. Znakhur . Investigation of the Scheduler for Heterogeneous Distributed Computing Systems based on Minimal Cover Method. International Journal of Computer Applications. 51, 19 ( August 2012), 35-44. DOI=10.5120/8154-1948
@article{
10.5120/8154-1948,
author = {
S. V. Listrovoy,
S. V. Minukhin,
S. V. Znakhur
},
title = { Investigation of the Scheduler for Heterogeneous Distributed Computing Systems based on Minimal Cover Method },
journal = {
International Journal of Computer Applications
},
issue_date = { August 2012 },
volume = { 51 },
number = { 19 },
month = { August },
year = { 2012 },
issn = { 0975-8887 },
pages = {
35-44
},
numpages = {9},
url = {
https://ijcaonline.org/archives/volume51/number19/8154-1948/
},
doi = { 10.5120/8154-1948 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:50:50.660523+05:30
%A S. V. Listrovoy
%A S. V. Minukhin
%A S. V. Znakhur
%T Investigation of the Scheduler for Heterogeneous Distributed Computing Systems based on Minimal Cover Method
%J International Journal of Computer Applications
%@ 0975-8887
%V 51
%N 19
%P 35-44
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract
The article describes the scheduling system for heterogeneous distributed computing systems. The scheduler based on minimal cover method. The analysis of the effectiveness of the scheduling system for tasks with varying intensity, the law of distribution complexity. The advantage of the method of minimal cover compared to FCFS. A system of rules for the optimization of the proposed planning changes in the intensity and complexity of tasks.
References
- M. Maheswaran, S. Ali, H. J. Siegel, D. Hensgen, R. F. Freund. "Dynamic mapping of a class of independent tasks onto heterogeneous computing systems", Journal of Parallel and Distributed Computing, no. 59(2), pp. 107 – 121, 1999.
- F. Xhafa, L. Barolli, A. Durresi. "Batch mode scheduling in grid systems", Int. J. Web and Grid Services, no. 3(1), pp. 19 – 37, 2007.
- F. Xhafa, A. Abraham. "Meta-heuristics for Grid Scheduling Problems", Meta. for Sched. in Distri. Comp. Envi. , SCI 146, pp. 1–37, 2008.
- T. D. Braun, H. J. Siegel, N. Beck, Ladislau L. Boloni, R. F. Freund, D. Hensgen, M. Maheswaran, A. I. Reuther, J. P. Robertson, M. D. Theys, B. Yao. "A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems", Journal of Parallel and Distributed Computing, no. 61(6): pp. 810 – 837, 2001.
- J. Smith, J. Apodaca, Anthony A. Maciejewski, H. J. Siegel. "Batch Mode Stochastic-Based Robust Dynamic Resource Allocation in a Heterogeneous Computing System", In Proceedings of PDPTA'2010, pp. 263 – 269, 2010.
- Ashish Chandak, Bibhudatta Sahoo, Ashok Kumar. Turuk. "An Observation on Performance Analysis of Grid Scheduler", IJCST, no. 2 (4), pp. 516–520, 2011.
- Bibhudatta Sahoo, Aser Avinash Ekka. Performance "Analysis Of Concurrent Tasks Scheduling Schemes In A Heterogeneous Distributed Computing System", In Proceedings of the National Conference on Computer Science and Technology, 11-12 Nov 2006, KIET, Ghaziabad.
- Issam Al-Azzoni, Douglas G. Down. "Dynamic Scheduling for Heterogeneous Desktop Grids", Journal of Parallel and Distributed Computing, no. 70(12), pp. 1231–1240, 2010.
- Jong-Kook Kima, Sameer Shivleb, Howard Jay Siegelb, Anthony A. Maciejewskib, Tracy D. Braunb, Myron Schneiderb, Sonja Tidemanc, Ramakrishna Chittac, Raheleh B. Dilmaghanib, Rohit Joshib, Aditya Kaulb, Ashish Sharmab, Siddhartha Sripadab, Praveen Vangarib, Siva SankarYellampallie. "Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment", J. Parallel Distrib. Comput. , no. 67, pp. 154 – 169, 2007.
- HE Xiaoshan, Xian-He Sun, Gregor von Laszewski. "QoS Guided Min-Min Heuristic for Grid Task Scheduling", Journal of Computer Science and Technology - Grid computing, no 18 (4), pp. 442 – 451, 2003.
- Abdul Aziz, Hesham El-Rewini. "Grid Resource Allocation and Task Scheduling for Resource Intensive Applications",http://www. cecs. uci. edu/~papers/icpp06/ICPPW/papers/008_aaziz-grid. pdf.
- J. Schopf. "Ten Actions When SuperScheduling, document of Scheduling Working Group", Global Grid Forum, July 2001, http://www. ggf. org/documents/GFD. 4. pdf.
- H. Chen and M. Maheswaran. "Distributed Dynamic Scheduling of Composite Tasks on Grid Computing Systems", In Proc. of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), pp. 88–97, Fort Lauderdale, Florida USA, April 2002.
- Fangpeng Dong and Selim G. Akl. "Scheduling Algorithms for Grid Computing: State of the Art and Open Problems", Technical Report No. 2006-504 School of Computing, Queen's University Kingston, Ontario January 2006.
- S. Tuecke, K. Czajkowski, I. Foster, S. Graham, C. Kesselman, P. Vanderbilt and D. Snelling. "Grid Service Specification, Open Grid Service Infrastructure Working Group (OGSI)", Global Grid Forum, http://www. cs. ucy. ac. cy/crossgrid/cygriddl/gsspec. pdf.
- Job Submission Description Language (JSDL) Specification, http://forge. gridforum. org/projects/jsdl-wg.
- S. V. Listrovoy, A. Yu. Gul. "Method of Minimum Covering Problem Solution on the Basis of Rank Approach", Engineering Simulation, 1999, Vol. 17, pp. 73–89.
- S. V. Listrovoy, S. V. Minukhin. "Method for solving the minimum vertex cover in a an arbitrary graph and the problem of the minimal cover", Electronic modeling, no 1 (34), pp. 29–43, 2012.
Index Terms
Computer Science
Information Sciences
Keywords