Open Access Open Access  Restricted Access Subscription or Fee Access

A Fuzzy Rule Base Technique for Process Grain Scheduling of Parallel Jobs

S.V. Sudha, K. Thanushkodi

Abstract


In this paper, we introduce a fuzzy based engine for the scheduling problem. In real world scheduling problems, due to the synchronization granularity of processes, the scheduling of parallel jobs becomes ineffective. A good way of characterizing a parallel system is to consider the synchronization granularity or frequency of synchronization between processes in a system. The scientific applications of the parallel system consist of multiple processes running on different processors that communicate frequently. The performance evaluation of such systems mainly depends on how the processes are co scheduled. If the processes are not co scheduled properly, then the system will lead to severe performance penalties. The various co scheduling techniques available are First Come First Served, Gang Scheduling and Flexible Co Scheduling and nimble algorithm. The paper focuses on an attempt to develop fuzzy systems based on the scheduling criteria which decides the best scheduling algorithm for parallel jobs.

Keywords


First Come First Served, Gang Scheduling, Nimble Algorithm, Mean Response Time, Turn Around Time.

Full Text:

PDF

References


S.V.Sudha and K.Thanushkodi ,An Approach for parallel Job Scheduling using Nimble Algorithm ,IEEE Catalog Number : CFP0811G, ISBN: 978-1-4244-3595-1, Library of Congress: 2008911559,p:1-9, 2008.

T. B¨ack and H.-P. Schwefel. An Overview of Evolutionary Algorithms for Parameter Optimization. Evolutionary Computation, 1(1):1–23, 1993.

H.-G. Beyer and H.-P. Schwefel. Evolution Strategies – A Comprehensive Introduction. Natural Computing, 1(1):3–52, 2002.

E.Frachtenberg, D.G.Feitelson, F.Petrini and J.Fernandez, “Adaptive parallel job scheduling with flexible coscheduling ,” IEEE Trans.Parallel and Distributed Systems., vol.16, no.11, pp.1066-1077, November 2005.

D.Tsafrir, Y.Etsion and D.G.Feitelson, “Backfilling using system generated predictions rather than user runtime estimates,”IEEE Trans.Parallel and Distributed Systems., vol.18, no.6, pp.789-803, June 2007.

A.Nissimov and D.G.Feitelson ,“ Probabilistic backfilling ,”Proc 13th Job Scheduling Strategies for Parallel Processing , Seattle, WA, USA, pp.102-115,June 2007.

C.Anglano, “A comparative evaluation of implicit coscheduling strategies for network of workstations,” Proc 9th High performance distributed computing Pittsburg, Pennsylvania, USA , pp.221-228, August 2000.

C.D.Antonopoulos ,D.S.Nikolopoulos and T.S.Papatheodorou, “Informing algorithms for efficient scheduling of synchronization threads on multiprogrammed SMPs,” Proc of the 2001 Int’l Conference on Parallel Processing ,Valencia, Spain, pp.123-130,September 2001.

E.Franchtenberg, D.G.Feitelson, J.Fernandez and F.Petrini, “Parallel job scheduling under dynamic workloads,” Proc 9th Job Scheduling Strategies for Parallel Processing, Seattle, WA, USA, pp. 208-227, June 2003.

U.Lublin and D.G.Feitelson, “The workload of super computers: modeling the characteristics of rigid jobs,” Journal of Parallel and Distributed Computing., vol.63, no.11, pp.1105-1122, November 2003.

W.Lee,M.Frank,V.Lee,K.Mackenzia and L.Rudolph, “Implication of I/O for gang scheduled workloads ,”Proc 3rd Job Scheduling Strategies for Parallel Processing, Geneva, Switerland, pp.215-237, 1997.

D.G.Feitelson, Logs of real parallel workloads from production systems, http://www.cs.huji.ac.il/labs/parallel/workloads/logs.html.The access dates are Oct 1994 –Dec 1993 for fine grain workloads. The access dates are Jan 2007 to June 2007 for the medium grain workloads. The access dates are June 2006 to Sep 2006 for coarse grain workloads .The access dates are Aug 2004 to May 2005 for the Independent Workloads.

D.Kerbyson, H.Alme,A.Hoisie ,F.Petrini ,H.Waserman and iggints ,. ”Predictive Performance and Scalability Modeling of a Large –Scale SMP Clusters”,Proc Symp,Frontiers of Massively Parallel Computation ,Feb 1999.

E.Frachtenberg, F.Petrini,J .Fernandez,S.Pakin and S.Coll , ”STROM : Lightning –Fast Resource Management “,Proc Supercomputing conf 2002, Nov 2002.

D.G.Feitelson and L.Rudolph,. ”Metric and Benchmarking for Parallel Job Scheduling “,Job Scheduling Strategies for parallel Processing ,pp 1- 24, 1998.

-


Refbacks

  • There are currently no refbacks.