Task Resource Allocation in Grid using Swift Scheduler
Keywords:
Grid Computing, Swift Scheduler, Dynamic Scheduling Algorithm, First Come First Serve, Shortest Job FirstAbstract
In nature, Grid computing is the combination of parallel and distributed computing where running computationally intensive applications like sequence alignment, weather forecasting, etc are needed a proficient scheduler to solve the problems awfully fast. Most of the Grid tasks are scheduled based on the First come first served (FCFS) or FCFS with advanced reservation, Shortest Job First (SJF) and etc. But these traditional algorithms seize more computational time due to soar waiting time of jobs in job queue. In Grid scheduling algorithm, the resources selection is NPcomplete. To triumph over the above problem, we proposed a new dynamic scheduling algorithm which is the combination of heuristic search algorithm and traditional SJF algorithm called swift scheduler. The proposed algorithm takes care of Job’s memory and CPU requirements along with the priority of jobs and resources. Our experimental results shows that our scheduler reduces the average waiting time in the job queue and reduces the over all computational time.References
Simple Text Query Form
This form allows individuals to retrieve Crossref Digital Object Identifiers (DOIs) for non-commercial use. Please contact us ( info@crossref.org) if you represent an organization that needs to retrieve Crossref DOIs in quantity.
Important Notice: Simple Text Query users will be required to use a verified email address starting on May 5, 2010. You may sign up for a free account here.
We are taking this action because a number of users are querying this service in very high volumes. The Simple Text Query is not an appropriate tool for high volume operations and monthly usage limits of 1000 references will be put into effect (intended to be a limit on an individual or the organization represented by an individual). Please contact Crossref ( info@crossref.org) to inquire about options appropriate for volumes of use above these limits.
How to use this form
This form allows you to retrieve Digital Object Identifiers (DOIs) for journal articles, books, and chapters by simply cutting and pasting the reference list into the box below. You may use the form with any reference style, although the tool works most reliably if references are formatted in a standard style such as shown in this example:
Clow GD, McKay CP, Simmons Jr. GM, and Wharton RA, Jr. 1988. Climatological observations and predicted sublimation rates at Lake Hoare, Antarctica. Journal of Climate 1:715-728.
To test the interface, simply cut & paste this reference!
Please separate individual references by a blank line. For best results, there should be no line breaks within an individual reference. When submitting multiple references they must be in alphabetical order or presented as a numbered list. For editorial purposes, to check the accuracy of a reference click on the DOI link that is returned with the reference.
eXtyles Logo
Ranganathan,K, and I.Foster, "Decoupling Computation and Data Scheduling in Data Intensive Applications", 11th International Symposium on High Perfromance Distributed Computing, Edinburgh, Scotland, Condor Project, Condor-G, 2002. http://dx.doi.org/10.1109/hpdc.2002.1029935
Mitrani I, Palmer J," Dynamic Server Allocation Heterogenous Clusters ", 1st International working conference on Heterogeneous Networks, Ilkley,UK, 2003.
Foster,I, et al, "The Grid 2003 Production Grid : Principles and Practice", 13th International Symposium on High Performance Distributed Computing, 2004.
Vijay Subramanian, Rajkumar Kettimuthu, et al, "Distributed Job Scheduling on Computational Grids using Multiple Simultaneous Requests", Proceedings 11th IEEE International Symposium on High Performance Distributed Computing, 2002. HPDC-11 2002. Pages: 359- 366 http://dx.doi.org/10.1109/HPDC.2002.1029936
C.Bitten, J. Gehring, et Al, "The NRW - Meta Computer : building block for a worldwide computational Grid", proceeding of the 9th Heterogeneous Computing workshop, pp.31-40, 2000.
C.Ememann, V. Hamscher, et al, "On Advantageous of Grid Computing for parallel job scheduling", proceeding 2nd IEEE/ACM Int'l Symp. On cluster- computing and the Grid (CCGRID 2002), Berlin, 2002, IEEE press.
Stefka Fidanova, "Simulated annealing for Grid Scheduling problem", IEEE International Symposium on International Symposium on Modern Computing, 2006. JVA apos;06 3-6 Oct. 2006 Page(s):41 - 45 http://dx.doi.org/10.1109/jva.2006.44
Marek Mika, GrzegorzWaligora and JanWeglarz, A Meta-Heuristic Approach to schedulingWorkflow jobs on a Grid, Grid resource management: state of the art and future trends, ISBN : 1-4020- 7575-8 , Kluwer Academic Publishers, Norwell, MA, USA; pp : 295 - 318, 2004.
Moreno, R., Alonso-Conde A.B, Job Scheduling and Resource Management Techniques in Dynamic Grid Environments In et al., F.F.R., ed.: Across Grids 2003, Volume 2970 of Lecture Notes in computer science, Springer, pp : 25 - 32, 2004.
Yuan-Shun Dai, Min Xie and Kim-Leng Poh "Availability Modeling and Cost Optimization for the Grid Resource Management System" IEEE Transactions on Systems, Man and Cybernetics, Part A Volume 38, Issue 1, Jan. 2008 Page(s):170 - 179.
Yuan-Shun Dai and Gregory Levitin "Optimal Resource Allocation for Maximizing Performance and Reliability in Tree-Structured Grid Services" IEEE Transactions on Reliability Volume 56, Issue 3, Sept. 2007 Page(s):444 - 453.
Doulamis, N.D.; Doulamis, A.D.; Varvarigos, E.A.; Varvarigou, T.A "Fair Scheduling Algorithms in Grids" IEEE Transactions on Parallel and Distributed Systems, Volume 18, Issue 11, Nov. 2007 Page(s):1630 - 1648
Anthony Sulistio, Uros Cibej, Srikumar Venugopal, Borut Robic and Rajkumar Buyya "A Toolkit for Modelling and Simulating Data Grids: An Extension to GridSim", Concurrency and Computation: Practice and Experience (CCPE), Online ISSN: 1532-0634, Printed ISSN: 1532-0626, 20(13): 1591-1609, Wiley Press, New York, USA, Sep. 2008.
Published
Issue
Section
License
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.
