Research Article
Batch Mode Scheduling- Mid_Max Algorithm
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 49 - Issue 15 |
| Published: July 2012 |
| Authors: Vijay Laxmi, Navdeep Kaur |
10.5120/7707-1070
|
Vijay Laxmi, Navdeep Kaur . Batch Mode Scheduling- Mid_Max Algorithm. International Journal of Computer Applications. 49, 15 (July 2012), 39-41. DOI=10.5120/7707-1070
@article{ 10.5120/7707-1070,
author = { Vijay Laxmi,Navdeep Kaur },
title = { Batch Mode Scheduling- Mid_Max Algorithm },
journal = { International Journal of Computer Applications },
year = { 2012 },
volume = { 49 },
number = { 15 },
pages = { 39-41 },
doi = { 10.5120/7707-1070 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2012
%A Vijay Laxmi
%A Navdeep Kaur
%T Batch Mode Scheduling- Mid_Max Algorithm%T
%J International Journal of Computer Applications
%V 49
%N 15
%P 39-41
%R 10.5120/7707-1070
%I Foundation of Computer Science (FCS), NY, USA
Abstract
In Desktop grid computing environment, range of computing devices coexists starting from personal computers to supercomputers. These devices are inter-connected to provide a variety of computational capabilities in order to execute applications that have diverse requirements. An important decision for such computing infrastructure is how to optimally allocate computational and communication resources to these applications and to schedule their execution in order to maximize performance benefits. In order to utilize the power of desktop grid completely, we need an efficient task scheduling algorithm to assign tasks to resources in a desktop grid. In this paper, we propose a Batch Mode Scheduling (Mid_Max algorithm) for the desktop grid environment. Compared to other methods, it performs well.
References
- I. Foster, C. kesselman The Grid: Blueprint for a New Computing Infrastructure. 2nd Ed, Morgan Kaufmann, 2004.
- S. Ali, T. D. Braun, H. J. Siegel, A. A. Maciejewski, N. Beck, L. Boloni, M. Maheswaran, A. I. Reuther, J. P. Robertson, M. D. Theys, and B. Yao, "Characterizing Resource Allocation Heuristics for Heterogeneous Computing Systems," in Advances in Computers: Volume 63: Parallel, Distributed, and Pervasive Computing, vol. 63, pp. 93- 129, Elsevier, Apr. 2005.
- C. S. Yeo and R. Buyya, "A taxonomy of market-based resource management systems for utility-driven cluster computing," Software:Practice and Experience, vol. 36, issue 13, pp. 1381-1419, Nov. 2006.
- M. Maheswaran, S. Ali, H. J. Siegel, D. Hensgen, and R. F. Freund, "Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems, The 8th Heterogeneous Computing Workshop , pp. 30-44, Apr. 2001.
- T. D. Braun, H. J. Siegel, N. Beck, L. L. Boloni, M. Maheswaran, A. I. Reuther, J. P. Robertson, M. D. Theys, B. Yao, D. Hensgen, and R. F. Freund, "A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems," Journal of Parallel and Distributed Computing, vol. 61, issue 6, pp. 810-837, Jun. 2001.
- K. Krauter, R. Buyya, and M. Maheswaran, "A taxonomy and survey of grid resource management systems for distributed computing,"Software: Practice and Experience, vol. 32, issue 2, pp. 135-164, Feb. 2002.
- J. Yu and R. Buyya, "A Taxonomy of Scientific workflow Systems for Grid Computing," Special Issue on Scientific Workflows, SIMMOD Record, vol. 34, no. 3, pp. 44-49, Sept. 2005.
Index Terms
Keywords