Efficient Load Balancing Grouping based Job Scheduling Algorithm in Grid Computing

Size: px
Start display at page:

Download "Efficient Load Balancing Grouping based Job Scheduling Algorithm in Grid Computing"

Transcription

1 Efficient Load Balancing Grouping based Job Scheduling Algorithm in Grid Computing Sandeep Kaur 1, Sukhpreet kaur 2 1,2 Sri Guru Granth Sahib World University Fatehgarh Sahib, India Abstract: Grid computing is a high performance computing environment to solve large-scale computational demands. Computational grids emerged as a next generation computing platform which is a collection of heterogeneous computing resources connected by a network across dynamic and geographically dispersed organizations, to form a distributed high performance computing infrastructure. In computational computational grid main emphasis is given on resource management and job scheduling. Job scheduling is a decision process by which application components are assigned to available resources to optimize various performance metrics. The main goal of scheduling is to maximize the resource utilization and minimize processing time of the jobs. Various research works has been done on job scheduling problem in grid, but still further analysis and research needs to be done to improve the performance of scheduling algorithm in computational grid. Different scheduling algorithms are suitable in different situation based on specific requirement. User jobs might be small and of varying lengths according to their requirements. Certainly, it is a real challenge to design an efficient scheduling strategy to achieve high performance in grid computing. Grouping strategy reduce the communication time of small scale jobs, but allocation of large number of jobs to one resource will increase the processing time and leads unbalancing processing load among the resources in grid computing environment. In this paper, an Efficient Load Balancing Dynamic Grouping based Job Scheduling (ELBDGBJS) approach has been proposed for grouping the fine-grained jobs in grid computing environment. In this scheduling algorithm jobs are scheduled based on number of jobs at particular time and resources capability. Independent fine-grained jobs are grouped together based on the dynamically specified group size and resources characteristics, for all resource utilization and minimize processing time. Hence in this paper, we have specifically focused on improving computational grid performance in terms of equal load balance and total computation time. A comparison of our proposed approach with other existing fine-grained job scheduling strategies is provided. Experimental results show, proposed algorithm (ELBDGBJS) performs better. Keywords: Grid computing, Job scheduling algorithm, Grouping Strategy, Load Balancing. 1. INTRODUCTION The popularity of the Internet and the availability of powerful computers and high-speed networks as low cost commodity components are changing the way we use computers today. These technical opportunities have led to the possibility of using geographically distributed and multi-owner resources to solve large-scale problems in science, engineering, and commerce. Recent research on these topics has led to the emergence of a new paradigm known as Grid computing [7] Grid computing is a high performance computing environment to solve large scale computational demands. The computational speed of individual computers has rapidly increased in the past thirty years. However, they are still not faster enough for large-scale scientific problems. This is why universities around the world are leading the development of the Grid computing which aims to link hundreds of major computing centers around the world. The term grid computing originated in the early 1990s as a metaphor for making computer power as easy to access as an electric power grid. The job scheduling and resource management is the central component of a grid system. However, grid performance can be improved in terms of job processing time by making sure all the resource available in the grid are utilized optimally using a good job scheduling algorithm [13]. An improved scheduling and efficient load balancing algorithm across the grid may lead to improve the overall system performance with less execution time. Although Grids have been used extensively for executing intensive jobs, but there are also exist several applications with a large number of lightweight jobs which needs small processing requirements. Sending/receiving each small job individually to/from the resources will increase the total communication time and cost. These applications involve high overhead time and cost in terms of job transmission to and from Grid resources and, job processing at the Grid resources. Therefore, there is a need for an efficient job grouping-based scheduling system to dynamically assemble the lightweight jobs of an application into a group of jobs, and send these grouped jobs to the grid resources. The dynamic grouping should be done based on the computational requirements of each job with respect to availability, processing capability of computational grid resources. 2. LITERATURE SURVEY The author has [7] proposed an algorithm that combines the advantages of three algorithms first shortest processing time, second, longest processing time, and third, earliest deadline first. The author realize that virtualization technique is required to address the problem of resource unavailability and software mismatch, With the help of virtualization a dynamic user Volume 2, Issue 4 July August 2013 Page 138

2 defined environment is created, so there is less possibility of rejecting a job due to unavailability of resource. Since this is the hybrid of virtual and physical machine scheduling, overhead in creating virtual machine in the presence of physical resource is reduced. The author in [2] proposed ORC scheduling strategy in Grid environment which includes the best fit followed by round robin scheduling for distribute the jobs among the available processors. The remaining un-allotted jobs are queued for next execution. Thus the order of jobs execution increases the performance of the processor and distribute load effectively across the network. This will reduce the waiting time of jobs in the queue and avoid the starvation. Many developed algorithms either considered the resource characteristics or application characteristics. But the adaptive fine grained job scheduling algorithm considered both characteristics. The authors in [3] feel there is a need to reduce the communication time, processing time and enhance resource utilization in case of scheduling the light-weight or small jobs. There are many applications in which Consist a large number of lightweight or less processing requirement jobs. Scheduling with light weight gives low performance in terms of processing time and communication time. So to achieve high Performance, less processing requirement jobs are grouped before allocation of resource. This grouping algorithm integrated Greedy algorithm and FCFS algorithm to improve the processing undertake of fine-grained jobs. The algorithm considers the dynamic characteristic of the grid environment. The time complexity scheduling algorithm is very high. It does not pay any attention to memory size constraint and pre-processing time of job grouping is high. The proposed a Dynamic Job Grouping-Based scheduling [4] maximizes the utilization of resource, and reduces the overhead time. This strategy dynamically assembles the individual Fine-grained jobs of an application into a group, and sends these coarse-grained jobs to the Grid resources. This dynamic grouping strategy based on the processing requirements of each application, Grid resources s availability and their processing capability and granularity size. Granularity size is the job processing time at the resources is used to measure the total amount of jobs that can be completed within a specified time in a particular resource. Relationship between the total number of jobs, processing requirements of those jobs, total number of available Grid resources, processing capabilities of those resources and the granularity size should be determined in order to achieve the minimum processing time. The author described a framework which is [5] comparatively better than nonbandwidth- aware job grouping scheduling framework. After creation a list of jobs, sent to the job scheduler for scheduling arrangement. The job scheduler obtains information on available resources and their network information from the Grid Information Service (GIS), and routing information from routers. Based on the information, the job scheduling algorithm is used to determine the job grouping and resource selection for grouped jobs. Once all the jobs are put into groups with selected resources, the grouped jobs are dispatched to their corresponding resources for computation. The bandwidth aware algorithm [6] improves the performance by reducing the delaying factors in network environment and maximizing the utilization of grid resources. Bandwidth-awareness strategy combined with the dynamic job grouping strategy to improve transmission delay and overhead. After knowing the processing capability and the bottleneck bandwidth, the scheduler selects the resource with the largest bottleneck bandwidth and started grouping independent fine-grained jobs together based on the chosen resource`s processing capability. Job groups are sent based on Largest Job First (LJF) manner to the corresponding resource. Longer execution time jobs executed concurrently with shorter execution time jobs. This strategy improves the overall execution time of the jobs. The grouping depends on a granularity size. It is the time within which a job is processed at the resources. This value is used to measure the total amount of jobs that can be completed within a specified time in a certain resource. It is one of the main factors in job grouping strategy that influences the way of job grouping to achieve the minimum job execution time and maximum utilization of the Grid resources. The author in [8] calculated the percentage of the processing capability of a resource on the total processing capability of all the resources. Using this percentage, the processing capability of a resource based on the total length of all tasks to be scheduled is calculated. The scheduler groups the jobs according to the calculated processing capability. The new job group is scheduled to execute in the available resources. This process of grouping and scheduling is repeated until all the user jobs are grouped and assigned to selected grid resources. Due to job grouping this approach optimizes computation/communication ratio and enhances utilization of resources. The Authors state that [12] allocating large number of jobs to one resource will increase the processing time. So to avoid this situation during job grouping activity, the total number of jobs group should be created such that the processing loads among the selected resource are balanced. There are some defects in the above scheduling algorithms. First, the algorithms don t take the dynamic resource characteristics into account. Second, the grouping strategy can t utilize resource sufficiently. And finally, it doesn t pay attention to the network bandwidth and memory size. To solve the problems mentioned above in [9] an adaptive fine grained job scheduling mechanism is presented. This algorithm is divided into two parts. In the first part, the In the second part after gathering the details of user jobs and the available resources, the system selects Jobs in FCFS Volume 2, Issue 4 July August 2013 Page 139

3 order to form different job groups. The scheduler selects resources in FCFS order after sorting them in descending order of their MIPS. Jobs are put into a job group one after another until sum of the resource requirements of the jobs in that group is less than or equal to amount of resource available at the selected resource site. A described model in [11] obtains the information about resources and job. This information is used for job grouping and for resource selection. When the jobs are put into a group according to the selected resources, the grouped job is dispatched to resources for computation. GBJS gives better performance than AFJS and DJGBSDA in terms of processing time. The proposed TMDGJS in [15] terms of processing time and overhead time, gives better performance, by minimizing overhead time and computation time. This strategy play important role in reducing overall processing time of jobs. Jobs are put alternatively from shortest list and added into job group according to the processing capability of the selected resource. Various job grouping based scheduling algorithms in [16] grid computing has been surveyed. A Grouping strategy based on the processing capability of selected resource plays a vital role to improve the overall performance of grid computing environment. However allocation of large number of jobs to one resource will increase the processing time and leads unbalancing processing load among the resources in grid computing environment. So, there is an efficient job grouping-based scheduling strategy is required during the job grouping activity, so that the processing loads among the selected resource are balanced. The term "load balancing in [17] refers to the technique that tries to distribute work load between several computers, network links, CPUs, hard drives, or other resources, in order to get optimal resource utilization, throughput, or response. To minimize the time needed to perform all tasks, the workload has to be evenly distributed over all nodes which are based on their processing capabilities. This is why load balancing is needed. The load balancing problem is closely related to scheduling and resource allocation. Grouping strategy based on the processing capability of selected resource. After resource selection, Jobs are started to put into the group. This process continues until the resource capability is less to the sum of grouped job requirement. This technique is also useful in maximum resource utilization, as jobs are grouped based on resource capability, but some system are fully occupied whereas other might be remains unutilized or idle in grid environment. 3. GROUPING STRATEGY Jobs are received and stored in job list. Then resources are sorted out in descending order of their processing capabilities in MIPS and jobs according to the job length.after that total number of jobs and resources are calculated and number of jobs in each group is specified. G_size = JList_Size / RList_Size Jobs are added into group based on group size by alternatively taking jobs from front end i.e. job with highest length and then rear end of the job list i.e. job with smallest length in job list. While grouping the jobs taken in order of the grouping strategy from the job list, the above strategy falls into cases given below. G (i) _size<=g_size When above condition fails while adding a job alternatively from job list during the grouping operation, then it stops grouping and job group send to the corresponding resource for computation. The above job grouping process is repeated as long as jobs exist. The advantage of this grouping strategy is as follows. 1) Balance the processing load among the selected resources. 2) To start the grouping process with the addition of a job that involves bigger computational need. 3) To ensure a well combination of bigger and smaller jobs added into the group. 4. SCHEDULING FRAMEWORK The scheduling framework illustrated in Figure 1 depicts the design of the job scheduler and its interactions with other entities. Therefore, when the user creates a list of jobs, these jobs are sent to the job scheduler for scheduling arrangement. The job scheduler obtains information on available resources. After gathering details, the scheduler specifies the group size based on job_count and resource_count. Based on the information, the job scheduling algorithm is used to determine the job grouping. Then scheduler submits the job groups to their respective resources for computation. After executing the group job, results goes to back to the corresponding users and the resource is again available to scheduler system. Figure 1 Job Grouping-based Scheduling Framework 5. EFFICIENT LOAD BALANCING DYNAMIC GROUPING BASED JOB SCHEDULING ALGORITHM 1. The scheduler receives the job _List created by the user. 2. Sort the job_list, according to their MI in decreasing order. 3. Count the jobs and store in variable JList_Size. Volume 2, Issue 4 July August 2013 Page 140

4 4. The scheduler receives the Resource_List, R [j]. 5. Count the number of resources and store in RList_Size variable. 6. Sort the Resources in decreasing order according to their MIPS. 7. Get the MIPS of the Resource j. 8. Resource_MI=R[j] x Chunk_Size. 9. Define the total size of each group TG_size = JList_Size / RList_Size 10. Set the Group (i) _size to zero. (i=0, 1, 2, 3 n) 11. Set the Grouped_Gridlet_Length to zero. If Group (i) _size<=tg_size and Grouped_Gridlet_Length is less than Resource[j] _MI Job are selected from sorted out job_list alternatively and added to summation of previous Grouped_Gridlet_Length and Group (i) _size is increment Else Deduct the last job added to Group (i) _size 12. Submit the Group (i) _size to Resource, R[j]. 13. Increment i (for next group) 14. Increment j (for next resource in Resource-List) and goto step10. Algorithm Description In this section we describe a Load Balancing Dynamic Grouping based Job Scheduling algorithm. The algorithm mainly consists of two phases: (1) Create available resource list and job list (2) Job grouping and scheduling. Grouping of job is done based on the total group size and available resources. First user submitted jobs are collected and one job list is created, then scheduler collects available resource characteristics. And then jobs are sorted out. After that group size is calculated based on job count and available resource.scheduler select job alternatively and job group are created for scheduling based on group size. The proposed job grouping and scheduling algorithm presented next is illustrated through an example. In this example 15 user jobs with varying processing requirements (MI) are grouped into five job groups taking into account the number of jobs group and according to the processing capabilities (MIPS) of the available resources and the Chunk_size. Resource MI is calculated as: RMI=MIPS*Chunk_Size and the Chunk_Size is taken as 10. Before grouping, the group_size is specified. The jobs are added into according to the grouping strategy as mentioned and (the first job is always taken from the front end of the reverse sorted job list. Then, the next job is added from the rear end of the list. 6. EXAMPLE Job_list with job length (MI Table 1: User Jobs R_list with MIPS Table 2: Resource List Chunk Size=10 RMI=MIPS*chunk size Table 3: Comparison of TMDGJS and ELBDGJS based on processing load Figure 2 Comparison of TMDGJS and ELBDGJS based On processing load Volume 2, Issue 4 July August 2013 Page 141

5 7. SCHEDULING ACTIVITY Figure 3 Activity Diagram for Job Grouping-based Scheduling Framework execution time, memory-size requirement. In this experiment, jobs and resources are randomly generated and the number of jobs varies from 100 to 500. The processing time is taken into account to analyze the feasibility of the proposed scheduling algorithm. Our algorithm can reduce the execution time and also the job completion success rate is high. The results are obtained through various observations with different Chunk_Size. Simulation Environment :-( Jobs are created with deviation of 20%) In this simulation jobs are created with average MI of 200 and deviation of 20%. Chunk_Size of 10, 20 and 30 are taken for observation 1, observation 2 and observation 3 respectively to analyze the processing time of submitted jobs. Observation:-1 The Figure-4 given below represents the processing time of two algorithms for the Chunk_Size 10 with different user jobs of average MI 200 with deviation of 20%... Observation:-2 The Figure-5 corresponds to the processing time of two algorithms for the Chunk_Size 20 with different user jobs of average MI 200 with a deviation of 20%. Observation:-3 The observation in Figure-6 signifies the processing time of two algorithms for the Chunk_Size 30 with different user jobs of average MI 200 with deviation of 20%. 8. SIMULATION AND RESULT Extensive simulation has created. The inputs to the simulations are total number of randomly generated jobs with MI deviation percentage, resource MIPS and different Chunk_Size. Simulations are conducted using ten resources of different MIPS. Resources associated with different Chunk_Size such as 10, 20, and 30. The details of the resource list are shown in Table 4. Table 4 Resource List Figure 4 Processing time with Chunk_Size=10 In this simulation, the total processing time is obtained in seconds. The purpose of this Simulation is to analyze and compare the performance difference between two scheduling algorithms: A Time-Minimization Dynamic Job Grouping-Based Scheduling algorithm (TMDGBJS), and proposed An Efficient Load balancing Dynamic Job Groupong-Based Scheduling algorithm. The scheduling and grouping strategy of TMDGBJS is adopted from [15]. Simulation: In our simulation, each resource is characterized by its MIPS and chunk_size. The jobs are characterized by their amount of computations, expected Figure 5 Processing time with Chunk_Size=20 Figure 6 Processing time with Chunk_Size=30 Volume 2, Issue 4 July August 2013 Page 142

6 9. Conclusion and Future Scope Extensive simulation environments are conducted to study and compare the behavior of the proposed TMDGJS and ELBDJGBS. The simulation results have shown that the proposed scheduling algorithm is able to achieve the desired objectives in grid environment. The comparative study done through various observations shows that the proposed ELBDGJS gives better performance than TMDGJS. The proposed Scheduling is a grouping based job scheduling strategy that has taken Group size constraint for grouping the jobs into account. The grouping algorithm improves the processing time of fine grained jobs. Experimental result demonstrates efficiency and effectiveness of the proposed algorithm. This scheduling algorithm balances the processing load among the resource and gives the better result in execution time. Advantages of this algorithm compared with other are: It reduces the total processing time of jobs. Grouping the jobs fine-grained into group will reduce the network latencies. Balance the processing load among the selected resource. To further test and improve the algorithm, some dynamic factors such as network delay and QoS constraints can be taken into account. References [1] Ian Foster, Carl Kesselman, Jefrey M. Nick, and Steven Tuecke, Grid services for distributed system integration. Computer, 35:37 46, June (journal [2] K.Somasundaram, and S.Radhakrishnan (2008), Node Allocation In Grid Computing Using Optimal Resource Constraint (ORC) Scheduling, IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.6, June (journal [3] Q. Liu, Y. Liao, Grouping-Based Fine- grained Job Scheduling in Grid Computing, Vol.1, pp , IEEE First International Workshop on Education Technology and Computer Science, (journal [4] N. Muthuvelu, J. Liu, N.L Soe, S.Venugopal, A. Sulistio,A and R.Buyya, A Dynamic Job Grouping- Based Scheduling for Deploying Applications with Fine-Grained Tasks on Global Grids, Conferences in Research and Practice in Information Technology, Vol. 44. (conference [5] N.W keat, A.T Fong, L.T Chaw, L.C Sun, Scheduling Framework for Bandwidth-Aware Job Grouping-Based Scheduling in Grid Computing Malaysian Journal of Computer Science, Vol. 19(2), (Journal [6] T.F Ang, W.K Ng, T.C. Ling, L.Y. Por and C.W Liew, A Bandwidth -Aware Job Grouping Based Scheduling in Grid Environment. InformationTechnology Journal, 8: Information Technology Journal, 8: (Journal [7] S.T Selvi, P.R SathiaBham, S. Architha, T. Kaarunya and K.Vinothini, "Scheduling In Virtualized Grid Environment Using Hybrid Approach", International Journal of Grid Computing & Applications Vol.1. No.1, September (Journal [8] S.Selvarani, and G.S.Sadhasivam, Improved Job Groupin based PSO Algorithm for Task Scheduling in Grid Computing International Journal of Engineering Science and Technology Vol. 2(9), 2010, (Journal [9] S. Gomathi, and D.Manimegalai, An Analysis of MIPS Group Based Job Scheduling Algorithm with other Algorithms in Grid Computing IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 6, No 3, November (Journal [10] R.Sharma, V.K. Soni, M.K Mishra, P. Bhuya A Survey of Job Scheduling and Resource Management in Grid Computing World Academy of Science, Engineering and Technology (conference [11] V.K Soni, R.Sharma, M.K Mishra, Grouping-Based Job Scheduling Model in Grid Computing. World Academy of Science, Engineering and Technology (conference [12] P. Rosemarry, R.Singh, P.Singhal, And D. Sisodia, Grouping Based Job Scheduling Algorithm Using Priority Queue And Hybrid Algorithm in Grid Computing. International Journal of Grid Computing & Applications (IJGCA) Vol.3, No.4, December (Journal [13] A. Mukherjee and P.M.Khilar, An Efficient Job- Grouping Based Scheduling Algorithm for Fine- Grained Jobs in Computational Grids (Thesis l [14] G.Sharma, and J.K Bhatia, A Review on Different Approaches for Load Balancing in Computational Grid Journal of Global Research in Computer Volume 2, Issue 4 July August 2013 Page 143

7 Science, Volume 4, No. 4, April (Journal [15] M.K.Mishra, P. Mohanty, G.B Mund, (2012) A Time-minimization Dynamic Job Grouping based scheduling in Grid Computing, International Journal of Computer Applications ( ) Volume 40 No.16, February (Journal [16] K.Sandeep, K.Sukhpreet, Survey of Resource and Grouping Based Job Scheduling Algorithm in Grid Computing, International Journal of Computer Science and Mobile Computing, IJCSMC, Vol. 2, Issue. 5, May 2013, pg (Journal [17] A.Revar, M.Andhariya, D.Sutariya, Prof. M.Bhavsar, Load Balancing in Grid Environment using Machine Learning Innovative Approach, International Journal of Computer Applications ( ) Volume 8 No.10, October (Journal Volume 2, Issue 4 July August 2013 Page 144

Cost-based Job Grouping and Scheduling Algorithm for Grid Computing Environments

Cost-based Job Grouping and Scheduling Algorithm for Grid Computing Environments Cost-based Job Grouping and Scheduling Algorithm for Grid Computing Environments Sonal Yadav M.Tech (CSE) Sharda University Greater Noida, India Amit Agarwal, Ph.D Associate Professor University of Petroleum

More information

Node Allocation In Grid Computing Using Optimal Resouce Constraint (ORC) Scheduling

Node Allocation In Grid Computing Using Optimal Resouce Constraint (ORC) Scheduling IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.6, June 2008 309 Node Allocation In Grid Computing Using Optimal Resouce Constraint (ORC) Scheduling K.Somasundaram 1, S.Radhakrishnan

More information

Chapter 6: CPU Scheduling. Basic Concepts. Histogram of CPU-burst Times. CPU Scheduler. Dispatcher. Alternating Sequence of CPU And I/O Bursts

Chapter 6: CPU Scheduling. Basic Concepts. Histogram of CPU-burst Times. CPU Scheduler. Dispatcher. Alternating Sequence of CPU And I/O Bursts Chapter 6: CPU Scheduling Basic Concepts Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation Maximum CPU utilization obtained

More information

Intro to O/S Scheduling. Intro to O/S Scheduling (continued)

Intro to O/S Scheduling. Intro to O/S Scheduling (continued) Intro to O/S Scheduling 1. Intro to O/S Scheduling 2. What is Scheduling? 3. Computer Systems Scheduling 4. O/S Scheduling Categories 5. O/S Scheduling and Process State 6. O/S Scheduling Layers 7. Scheduling

More information

Scheduling I. Today. Next Time. ! Introduction to scheduling! Classical algorithms. ! Advanced topics on scheduling

Scheduling I. Today. Next Time. ! Introduction to scheduling! Classical algorithms. ! Advanced topics on scheduling Scheduling I Today! Introduction to scheduling! Classical algorithms Next Time! Advanced topics on scheduling Scheduling out there! You are the manager of a supermarket (ok, things don t always turn out

More information

Roadmap. Tevfik Koşar. CSE 421/521 - Operating Systems Fall Lecture - V CPU Scheduling - I. University at Buffalo.

Roadmap. Tevfik Koşar. CSE 421/521 - Operating Systems Fall Lecture - V CPU Scheduling - I. University at Buffalo. CSE 421/521 - Operating Systems Fall 2011 Lecture - V CPU Scheduling - I Tevfik Koşar University at Buffalo September 13 th, 2011 1 Roadmap CPU Scheduling Basic Concepts Scheduling Criteria & Metrics Different

More information

Batch Resizing Policies and Techniques for Fine- Grain Grid Tasks: The Nuts and Bolts

Batch Resizing Policies and Techniques for Fine- Grain Grid Tasks: The Nuts and Bolts Journal of Information Processing Systems, Vol.7, No.2, June 2011 DOI : 10.3745/JIPS.2011.7.2.299 Batch Resizing Policies and Techniques for Fine- Grain Grid Tasks: The Nuts and Bolts Nithiapidary Muthuvelu*,

More information

Comparative Analysis of Scheduling Algorithms of Cloudsim in Cloud Computing

Comparative Analysis of Scheduling Algorithms of Cloudsim in Cloud Computing International Journal of Computer Applications (975 8887) Comparative Analysis of Scheduling Algorithms of Cloudsim in Cloud Computing Himani Department of CSE Guru Nanak Dev University, India Harmanbir

More information

Motivation. Types of Scheduling

Motivation. Types of Scheduling Motivation 5.1 Scheduling defines the strategies used to allocate the processor. Successful scheduling tries to meet particular objectives such as fast response time, high throughput and high process efficiency.

More information

Queue based Job Scheduling algorithm for Cloud computing

Queue based Job Scheduling algorithm for Cloud computing International Research Journal of Applied and Basic Sciences 2013 Available online at www.irjabs.com ISSN 2251-838X / Vol, 4 (11): 3785-3790 Science Explorer Publications Queue based Job Scheduling algorithm

More information

Resource Allocation Strategies in a 2-level Hierarchical Grid System

Resource Allocation Strategies in a 2-level Hierarchical Grid System st Annual Simulation Symposium Resource Allocation Strategies in a -level Hierarchical Grid System Stylianos Zikos and Helen D. Karatza Department of Informatics Aristotle University of Thessaloniki 5

More information

Optimized Virtual Resource Deployment using CloudSim

Optimized Virtual Resource Deployment using CloudSim Optimized Virtual Resource Deployment using CloudSim Anesul Mandal Software Professional, Aptsource Software Pvt. Ltd., A-5 Rishi Tech Park, New Town, Rajarhat, Kolkata, India. Kamalesh Karmakar Assistant

More information

QoS-based Scheduling for Task Management in Grid Computing

QoS-based Scheduling for Task Management in Grid Computing QoS-based Scheduling for Task Management in Grid Computing Xiaohong Huang 1, Maode Ma 2, Yan Ma 1 Abstract--Due to the heterogeneity, complexity, and autonomy of wide spread Grid resources, the dynamic

More information

Principles of Operating Systems

Principles of Operating Systems Principles of Operating Systems Lecture 9-10 - CPU Scheduling Ardalan Amiri Sani (ardalan@uci.edu) [lecture slides contains some content adapted from previous slides by Prof. Nalini Venkatasubramanian,

More information

Motivating Examples of the Power of Analytical Modeling

Motivating Examples of the Power of Analytical Modeling Chapter 1 Motivating Examples of the Power of Analytical Modeling 1.1 What is Queueing Theory? Queueing theory is the theory behind what happens when you have lots of jobs, scarce resources, and subsequently

More information

10/1/2013 BOINC. Volunteer Computing - Scheduling in BOINC 5 BOINC. Challenges of Volunteer Computing. BOINC Challenge: Resource availability

10/1/2013 BOINC. Volunteer Computing - Scheduling in BOINC 5 BOINC. Challenges of Volunteer Computing. BOINC Challenge: Resource availability Volunteer Computing - Scheduling in BOINC BOINC The Berkley Open Infrastructure for Network Computing Ryan Stern stern@cs.colostate.edu Department of Computer Science Colorado State University A middleware

More information

Lecture 11: CPU Scheduling

Lecture 11: CPU Scheduling CS 422/522 Design & Implementation of Operating Systems Lecture 11: CPU Scheduling Zhong Shao Dept. of Computer Science Yale University Acknowledgement: some slides are taken from previous versions of

More information

CPU Scheduling. Basic Concepts Scheduling Criteria Scheduling Algorithms. Unix Scheduler

CPU Scheduling. Basic Concepts Scheduling Criteria Scheduling Algorithms. Unix Scheduler CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms FCFS SJF RR Priority Multilevel Queue Multilevel Queue with Feedback Unix Scheduler 1 Scheduling Processes can be in one of several

More information

Roadmap. Tevfik Ko!ar. CSC Operating Systems Spring Lecture - V CPU Scheduling - I. Louisiana State University.

Roadmap. Tevfik Ko!ar. CSC Operating Systems Spring Lecture - V CPU Scheduling - I. Louisiana State University. CSC 4103 - Operating Systems Spring 2008 Lecture - V CPU Scheduling - I Tevfik Ko!ar Louisiana State University January 29 th, 2008 1 Roadmap CPU Scheduling Basic Concepts Scheduling Criteria Different

More information

Energy Aware Resource Allocation for Data Center

Energy Aware Resource Allocation for Data Center Advances in Computational Sciences and Technology ISSN 0973-6107 Volume 10, Number 1 (2017) pp. 1-9 Research India Publications http://www.ripublication.com Energy Aware Resource Allocation for Data Center

More information

Operating Systems Process Scheduling Prof. Dr. Armin Lehmann

Operating Systems Process Scheduling Prof. Dr. Armin Lehmann Operating Systems Process Scheduling Prof. Dr. Armin Lehmann lehmann@e-technik.org Fachbereich 2 Informatik und Ingenieurwissenschaften Wissen durch Praxis stärkt Seite 1 Datum 11.04.2017 Process Scheduling

More information

A Paper on Modified Round Robin Algorithm

A Paper on Modified Round Robin Algorithm A Paper on Modified Round Robin Algorithm Neha Mittal 1, Khushbu Garg 2, Ashish Ameria 3 1,2 Arya College of Engineering & I.T, Jaipur, Rajasthan 3 JECRC UDML College of Engineering, Jaipur, Rajasthan

More information

A Survey of Resource Scheduling Algorithms in Green Computing

A Survey of Resource Scheduling Algorithms in Green Computing A Survey of Resource Scheduling Algorithms in Green Computing Arshjot Kaur, Supriya Kinger Department of Computer Science and Engineering, SGGSWU, Fatehgarh Sahib, Punjab, India (140406) Abstract-Cloud

More information

Journal of Global Research in Computer Science

Journal of Global Research in Computer Science Volume 2, No. 5, May 211 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at www.jgrcs.info Weighted Mean Priority Based Scheduling for Interactive Systems H.S.Behera *1,

More information

A TUNABLE WORKFLOW SCHEDULING ALGORITHM BASED ON PARTICLE SWARM OPTIMIZATION FOR CLOUD COMPUTING

A TUNABLE WORKFLOW SCHEDULING ALGORITHM BASED ON PARTICLE SWARM OPTIMIZATION FOR CLOUD COMPUTING San Jose State University SJSU ScholarWorks Master's Projects Master's Theses and Graduate Research Spring 2014 A TUNABLE WORKFLOW SCHEDULING ALGORITHM BASED ON PARTICLE SWARM OPTIMIZATION FOR CLOUD COMPUTING

More information

OPERATING SYSTEMS. Systems and Models. CS 3502 Spring Chapter 03

OPERATING SYSTEMS. Systems and Models. CS 3502 Spring Chapter 03 OPERATING SYSTEMS CS 3502 Spring 2018 Systems and Models Chapter 03 Systems and Models A system is the part of the real world under study. It is composed of a set of entities interacting among themselves

More information

Advanced Types Of Scheduling

Advanced Types Of Scheduling Advanced Types Of Scheduling In the previous article I discussed about some of the basic types of scheduling algorithms. In this article I will discuss about some other advanced scheduling algorithms.

More information

Scheduling and Resource Management in Grids

Scheduling and Resource Management in Grids Scheduling and Resource Management in Grids ASCI Course A14: Advanced Grid Programming Models Ozan Sonmez and Dick Epema may 13, 2009 1 Outline Resource Management Introduction A framework for resource

More information

COMPARING VARIOUS WORKFLOW ALGORITHMS WITH SIMULATED ANNEALING TECHNIQUE

COMPARING VARIOUS WORKFLOW ALGORITHMS WITH SIMULATED ANNEALING TECHNIQUE COMPARING VARIOUS WORKFLOW ALGORITHMS WITH SIMULATED ANNEALING TECHNIQUE Dr.V.Venkatesakumar #1, R.Yasotha #2 # Department of Computer Science and Engineering, Anna University Regional Centre, Coimbatore,

More information

Perspective Study on task scheduling in computational grid

Perspective Study on task scheduling in computational grid Perspective Study on task scheduling in computational grid R. Venkatesan, J. Raj Thilak Abstract Grid computing is a form of distributed computing and task scheduling remains the heart of grid computing.

More information

Integrating New Cost Model into HMA-Based Grid Resource Scheduling

Integrating New Cost Model into HMA-Based Grid Resource Scheduling Integrating New Cost Model into HMA-Based Grid Resource Scheduling Jun-yan Zhang, Fan Min, and Guo-wei Yang College of Computer Science and Engineering, University of Electronic Science and Technology

More information

Efficient Round Robin Scheduling Algorithm with Dynamic Time Slice

Efficient Round Robin Scheduling Algorithm with Dynamic Time Slice I.J. Education and Management Engineering, 2015, 2, 10-19 Published Online June 2015 in MECS (http://www.mecs-press.net) DOI: 10.5815/ijeme.2015.02.02 Available online at http://www.mecs-press.net/ijeme

More information

Clock-Driven Scheduling

Clock-Driven Scheduling Integre Technical Publishing Co., Inc. Liu January 13, 2000 8:49 a.m. chap5 page 85 C H A P T E R 5 Clock-Driven Scheduling The previous chapter gave a skeletal description of clock-driven scheduling.

More information

SELF OPTIMIZING KERNEL WITH HYBRID SCHEDULING ALGORITHM

SELF OPTIMIZING KERNEL WITH HYBRID SCHEDULING ALGORITHM SELF OPTIMIZING KERNEL WITH HYBRID SCHEDULING ALGORITHM AMOL VENGURLEKAR 1, ANISH SHAH 2 & AVICHAL KARIA 3 1,2&3 Department of Electronics Engineering, D J. Sanghavi College of Engineering, Mumbai, India

More information

Planning the Capacity of a Web Server: An Experience Report D. Menascé. All Rights Reserved.

Planning the Capacity of a Web Server: An Experience Report D. Menascé. All Rights Reserved. Planning the Capacity of a Web Server: An Experience Report Daniel A. Menascé George Mason University menasce@cs.gmu.edu Nikki Dinh SRA International, Inc. nikki_dinh@sra.com Robert Peraino George Mason

More information

Smarter Round Robin Scheduling Algorithm for Cloud Computing and Big Data

Smarter Round Robin Scheduling Algorithm for Cloud Computing and Big Data Smarter Round Robin Scheduling Algorithm for Cloud Computing and Big Data Hicham Gibet Tani, Chaker El Amrani To cite this version: Hicham Gibet Tani, Chaker El Amrani. Smarter Round Robin Scheduling Algorithm

More information

Pallab Banerjee, Probal Banerjee, Shweta Sonali Dhal

Pallab Banerjee, Probal Banerjee, Shweta Sonali Dhal Comparative Performance Analysis of Average Max Round Robin Scheduling Algorithm (AMRR) using Dynamic Time Quantum with Round Robin Scheduling Algorithm using static Time Quantum Pallab Banerjee, Probal

More information

General Terms Measurement, Performance, Design, Theory. Keywords Dynamic load balancing, Load sharing, Pareto distribution, 1.

General Terms Measurement, Performance, Design, Theory. Keywords Dynamic load balancing, Load sharing, Pareto distribution, 1. A Dynamic Load Distribution Strategy for Systems Under High Tas Variation and Heavy Traffic Bin Fu Zahir Tari School of Computer Science and Information and Technology Melbourne, Australia {b fu,zahirt}@cs.rmit.edu.au

More information

Operating System 9 UNIPROCESSOR SCHEDULING

Operating System 9 UNIPROCESSOR SCHEDULING Operating System 9 UNIPROCESSOR SCHEDULING TYPES OF PROCESSOR SCHEDULING The aim of processor scheduling is to assign processes to be executed by the processor or processors over time, in a way that meets

More information

Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations

Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations Helen D. Karatza Department of Informatics Aristotle University of Thessaloniki 54006 Thessaloniki, Greece karatza@csd.auth.gr Abstract

More information

In Cloud, Can Scientific Communities Benefit from the Economies of Scale?

In Cloud, Can Scientific Communities Benefit from the Economies of Scale? PRELIMINARY VERSION IS PUBLISHED ON SC-MTAGS 09 WITH THE TITLE OF IN CLOUD, DO MTC OR HTC SERVICE PROVIDERS BENEFIT FROM THE ECONOMIES OF SCALE? 1 In Cloud, Can Scientific Communities Benefit from the

More information

Operations and Production Management GPO300

Operations and Production Management GPO300 Operations and Production Management GPO300 8th January 2013 1 first semester 2012 13 GPO300 Operations and Production Management CLASSROOM CODE OF CONDUCT GROUND RULES: Start and end time No cell phones

More information

Improving Cluster Utilization through Intelligent Processor Sharing

Improving Cluster Utilization through Intelligent Processor Sharing Improving Cluster Utilization through Intelligent Processor Sharing Gary Stiehr and Roger D. Chamberlain Dept. of Computer Science and Engineering, Washington University in St. Louis garystiehr@wustl.edu,

More information

An Experimental System for Grid Meta-Broker Evaluation

An Experimental System for Grid Meta-Broker Evaluation An Experimental System for Grid Meta-Broker Evaluation Yanbin Liu Norman Bobroff Liana Fong Seetharami Seelam IBM T. J. Watson Research, Hawthorne, NY, USA {ygliu, bobroff, llfong, sseelam}@us.ibm.com

More information

Lecture Note #4: Task Scheduling (1) EECS 571 Principles of Real-Time Embedded Systems. Kang G. Shin EECS Department University of Michigan

Lecture Note #4: Task Scheduling (1) EECS 571 Principles of Real-Time Embedded Systems. Kang G. Shin EECS Department University of Michigan Lecture Note #4: Task Scheduling (1) EECS 571 Principles of Real-Time Embedded Systems Kang G. Shin EECS Department University of Michigan 1 Reading Assignment Liu and Layland s paper Chapter 3 of the

More information

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Operations and Supply Chain Management Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture - 24 Sequencing and Scheduling - Assumptions, Objectives and Shop

More information

Workflow Scheduling of Scientific Application in Cloud A Survey

Workflow Scheduling of Scientific Application in Cloud A Survey Workflow Scheduling of Scientific Application in Cloud A Survey Priyanka M. Kadam 1 Priyankakadam222@gmail. com Prof. S. R.Poojara. 2 Assistant Professor shivananda.poojara@ritindi a.edu Prof. N.V.Dharwadkar.

More information

By: Adrian Chu, Department of Industrial & Systems Engineering, University of Washington, Seattle, Washington November 12, 2009.

By: Adrian Chu, Department of Industrial & Systems Engineering, University of Washington, Seattle, Washington November 12, 2009. OPT Report By: Adrian Chu, Department of Industrial & Systems Engineering, University of Washington, Seattle, Washington 98195. November 12, 2009. The Goal Every manufacturing company has one goal to make

More information

1. For s, a, initialize Q ( s,

1. For s, a, initialize Q ( s, Proceedings of the 2006 Winter Simulation Conference L. F. Perrone, F. P. Wieland, J. Liu, B. G. Lawson, D. M. Nicol, and R. M. Fujimoto, eds. A REINFORCEMENT LEARNING ALGORITHM TO MINIMIZE THE MEAN TARDINESS

More information

QUANTITATIVE EVALUATION OF JOB AND RESOURCES FOR BETTER SELECTION TO IMPROVE MAKESPAN IN GRID SCHEDULING

QUANTITATIVE EVALUATION OF JOB AND RESOURCES FOR BETTER SELECTION TO IMPROVE MAKESPAN IN GRID SCHEDULING Journal of Computer Science 10 (5): 774-782, 2014 ISSN: 1549-3636 2014 doi:10.3844/jcssp.2014.774.782 Published Online 10 (5) 2014 (http://www.thescipub.com/jcs.toc) QUANTITATIVE EVALUATION OF JOB AND

More information

Triage: Balancing Energy and Quality of Service in a Microserver

Triage: Balancing Energy and Quality of Service in a Microserver Triage: Balancing Energy and Quality of Service in a Microserver Nilanjan Banerjee, Jacob Sorber, Mark Corner, Sami Rollins, Deepak Ganesan University of Massachusetts, Amherst University of San Francisco,

More information

The Preemptive Stocker Dispatching Rule of Automatic Material Handling System in 300 mm Semiconductor Manufacturing Factories

The Preemptive Stocker Dispatching Rule of Automatic Material Handling System in 300 mm Semiconductor Manufacturing Factories Journal of Physics: Conference Series PAPER OPEN ACCESS The Preemptive Stocker Dispatching Rule of Automatic Material Handling System in 300 mm Semiconductor Manufacturing Factories To cite this article:

More information

Goodbye to Fixed Bandwidth Reservation: Job Scheduling with Elastic Bandwidth Reservation in Clouds

Goodbye to Fixed Bandwidth Reservation: Job Scheduling with Elastic Bandwidth Reservation in Clouds Goodbye to Fixed Bandwidth Reservation: Job Scheduling with Elastic Bandwidth Reservation in Clouds Haiying Shen *, Lei Yu, Liuhua Chen &, and Zhuozhao Li * * Department of Computer Science, University

More information

Recall: FCFS Scheduling (Cont.) Example continued: Suppose that processes arrive in order: P 2, P 3, P 1 Now, the Gantt chart for the schedule is:

Recall: FCFS Scheduling (Cont.) Example continued: Suppose that processes arrive in order: P 2, P 3, P 1 Now, the Gantt chart for the schedule is: CS162 Operating Systems and Systems Programming Lecture 10 Scheduling October 3 rd, 2016 Prof. Anthony D. Joseph http://cs162.eecs.berkeley.edu Recall: Scheduling Policy Goals/Criteria Minimize Response

More information

IBM ICE (Innovation Centre for Education) Welcome to: Unit 1 Overview of delivery models in Cloud Computing. Copyright IBM Corporation

IBM ICE (Innovation Centre for Education) Welcome to: Unit 1 Overview of delivery models in Cloud Computing. Copyright IBM Corporation Welcome to: Unit 1 Overview of delivery models in Cloud Computing 9.1 Unit Objectives After completing this unit, you should be able to: Understand cloud history and cloud computing Describe the anatomy

More information

A Deadline and Budget Constrained Cost-Time Optimisation Algorithm for Scheduling Task Farming Applications on Global Grids

A Deadline and Budget Constrained Cost-Time Optimisation Algorithm for Scheduling Task Farming Applications on Global Grids A and Constrained Cost-Time Optimisation Algorithm for Scheduling Task Farming Applications on Global Grids Rajkumar Buyya, Manzur Murshed *, and David Abramson School of Computer Science and Software

More information

Design and Operational Analysis of Tandem AGV Systems

Design and Operational Analysis of Tandem AGV Systems Proceedings of the 2008 Industrial Engineering Research Conference J. Fowler and S. Mason. eds. Design and Operational Analysis of Tandem AGV Systems Sijie Liu, Tarek Y. ELMekkawy, Sherif A. Fahmy Department

More information

All NEMOs proposal for the price coupling algorithm and for the continuous trading matching algorithm, also incorporating TSO and NEMO proposals for

All NEMOs proposal for the price coupling algorithm and for the continuous trading matching algorithm, also incorporating TSO and NEMO proposals for All NEMOs proposal for the price coupling algorithm and for the continuous trading matching algorithm, also incorporating TSO and NEMO proposals for a common set of requirements, in accordance with Article

More information

LOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS

LOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS Advances in Production Engineering & Management 4 (2009) 3, 127-138 ISSN 1854-6250 Scientific paper LOADING AND SEQUENCING JOBS WITH A FASTEST MACHINE AMONG OTHERS Ahmad, I. * & Al-aney, K.I.M. ** *Department

More information

International Journal of Computer Trends and Technology (IJCTT) volume 10number5 Apr 2014

International Journal of Computer Trends and Technology (IJCTT) volume 10number5 Apr 2014 Survey Paper for Maximization of Profit in Cloud Computing Ms. Honeymol.O Department of Computer Science and Engineering Nehru College of Engineering and Research Centre, Pampady, Thrissur, University

More information

Energy-Efficient Scheduling of Interactive Services on Heterogeneous Multicore Processors

Energy-Efficient Scheduling of Interactive Services on Heterogeneous Multicore Processors Energy-Efficient Scheduling of Interactive Services on Heterogeneous Multicore Processors Shaolei Ren, Yuxiong He, Sameh Elnikety University of California, Los Angeles, CA Microsoft Research, Redmond,

More information

CROSS-DOCKING: SCHEDULING OF INCOMING AND OUTGOING SEMI TRAILERS

CROSS-DOCKING: SCHEDULING OF INCOMING AND OUTGOING SEMI TRAILERS CROSS-DOCKING: SCHEDULING OF INCOMING AND OUTGOING SEMI TRAILERS 1 th International Conference on Production Research P.Baptiste, M.Y.Maknoon Département de mathématiques et génie industriel, Ecole polytechnique

More information

Genetic Based Task Scheduling Algorithms in Distributed Environments- Its Strengths, Weaknesses, Opportunity and Threats

Genetic Based Task Scheduling Algorithms in Distributed Environments- Its Strengths, Weaknesses, Opportunity and Threats Genetic Based Task Scheduling Algorithms in Distributed Environments- Its Strengths, Weaknesses, Opportunity and Threats Sunil Kumar Assistant Professor, Guru Nanak College for Girls, Sri Muktsar Sahib

More information

Justifying Simulation. Why use simulation? Accurate Depiction of Reality. Insightful system evaluations

Justifying Simulation. Why use simulation? Accurate Depiction of Reality. Insightful system evaluations Why use simulation? Accurate Depiction of Reality Anyone can perform a simple analysis manually. However, as the complexity of the analysis increases, so does the need to employ computer-based tools. While

More information

An Agent-Based Scheduling Framework for Flexible Manufacturing Systems

An Agent-Based Scheduling Framework for Flexible Manufacturing Systems An Agent-Based Scheduling Framework for Flexible Manufacturing Systems Iman Badr International Science Index, Industrial and Manufacturing Engineering waset.org/publication/2311 Abstract The concept of

More information

International Journal of Scientific & Engineering Research, Volume 7, Issue 12, December ISSN

International Journal of Scientific & Engineering Research, Volume 7, Issue 12, December ISSN International Journal of Scientific & Engineering Research, Volume 7, Issue 12, December-2016 1 Task Scheduling in Cloud Computing Aakanksha Sharma Research Scholar, Department of Computer Science & Applications,

More information

Job Scheduling Challenges of Different Size Organizations

Job Scheduling Challenges of Different Size Organizations Job Scheduling Challenges of Different Size Organizations NetworkComputer White Paper 2560 Mission College Blvd., Suite 130 Santa Clara, CA 95054 (408) 492-0940 Introduction Every semiconductor design

More information

12 juni 2012 Fort Voordorp. What is Performance? Dependencies in Performance? What is expected? Jan Sterk en Jeroen Kleinnibbelink

12 juni 2012 Fort Voordorp. What is Performance? Dependencies in Performance? What is expected? Jan Sterk en Jeroen Kleinnibbelink EMC CUSTOMER UPDATE 12 juni 2012 Fort Voordorp What is Performance? Dependencies in Performance? What is expected? Jan Sterk en Jeroen Kleinnibbelink 1 Performance Impact Hierarchy Request Application

More information

Review of Round Robin (RR) CPU Scheduling Algorithm on Varying Time Quantum

Review of Round Robin (RR) CPU Scheduling Algorithm on Varying Time Quantum International Journal of Engineering Science Invention ISSN (Online): 2319 6734, ISSN (Print): 2319 6726 Volume 6 Issue 8 August 2017 PP. 68-72 Review of Round Robin (RR) CPU Scheduling Algorithm on Varying

More information

Project Number D2.2 Soft Real-Time Dynamic Resource Allocation. Version December 2014 Final. Public Distribution. University of York

Project Number D2.2 Soft Real-Time Dynamic Resource Allocation. Version December 2014 Final. Public Distribution. University of York Project Number 611411 D2.2 Soft Real-Time Dynamic Resource Allocation Version 1.0 8 December 2014 Final Public Distribution University of York Project Partners: Aicas, Bosch, CNRS, Rheon Media, The Open

More information

LEAST-MEAN DIFFERENCE ROUND ROBIN (LMDRR) CPU SCHEDULING ALGORITHM

LEAST-MEAN DIFFERENCE ROUND ROBIN (LMDRR) CPU SCHEDULING ALGORITHM LEAST-MEAN DIFFERENCE ROUND ROBIN () CPU SCHEDULING ALGORITHM 1 D. ROHITH ROSHAN, 2 DR. K. SUBBA RAO 1 M.Tech (CSE) Student, Department of Computer Science and Engineering, KL University, India. 2 Professor,

More information

Analysis of Adaptive Round Robin Algorithm and Proposed Round Robin Remaining Time Algorithm

Analysis of Adaptive Round Robin Algorithm and Proposed Round Robin Remaining Time Algorithm Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 12, December 2015,

More information

Oracle Real-Time Scheduler Benchmark

Oracle Real-Time Scheduler Benchmark An Oracle White Paper November 2012 Oracle Real-Time Scheduler Benchmark Demonstrates Superior Scalability for Large Service Organizations Introduction Large service organizations with greater than 5,000

More information

Resource Allocation Optimization in Critical Chain Method

Resource Allocation Optimization in Critical Chain Method Annales UMCS Informatica AI XII, 1 (2012) 17 29 DOI: 10.2478/v10065-012-0006-2 Resource Allocation Optimization in Critical Chain Method Grzegorz Pawiński 1, Krzysztof Sapiecha 1 1 Department of Computer

More information

The Contact Center Performance Company WHITE PAPER

The Contact Center Performance Company WHITE PAPER Global Routing and Contact Center Management Modernizing the behavior of legacy systems for today s distributed, outsourced contact centers with the cloud and analytics Arnab Mishra, VP Products Global

More information

Dispatching for order-driven FABs with backward pegging

Dispatching for order-driven FABs with backward pegging PRODUCTION & MANUFACTURING RESEARCH ARTICLE Dispatching for order-driven FABs with backward pegging Yong H. Chung 1, S. Lee 1 and Sang C. Park 1 * Received: 17 May 2016 Accepted: 04 August 2016 First Published:

More information

Optimizing Inplant Supply Chain in Steel Plants by Integrating Lean Manufacturing and Theory of Constrains through Dynamic Simulation

Optimizing Inplant Supply Chain in Steel Plants by Integrating Lean Manufacturing and Theory of Constrains through Dynamic Simulation Optimizing Inplant Supply Chain in Steel Plants by Integrating Lean Manufacturing and Theory of Constrains through Dynamic Simulation Atanu Mukherjee, President, Dastur Business and Technology Consulting,

More information

AGORA: An Architecture for Strategyproof Computing in Grids

AGORA: An Architecture for Strategyproof Computing in Grids AGORA: An Architecture for Strategyproof Computing in Grids Daniel Grosu Department of Computer Science Wayne State University Detroit, Michigan 48202, USA Email: dgrosu@cs.wayne.edu Abstract Grids enable

More information

Dependency-aware and Resourceefficient Scheduling for Heterogeneous Jobs in Clouds

Dependency-aware and Resourceefficient Scheduling for Heterogeneous Jobs in Clouds Dependency-aware and Resourceefficient Scheduling for Heterogeneous Jobs in Clouds Jinwei Liu* and Haiying Shen *Dept. of Electrical and Computer Engineering, Clemson University, SC, USA Dept. of Computer

More information

5 Metrics You Should Know to Understand Your Engineering Efficiency

5 Metrics You Should Know to Understand Your Engineering Efficiency 5 Metrics You Should Know to Understand Your Engineering Efficiency Increase the speed and reliability of your team by understanding these key indicators Table of Contents Commit-to-Deploy Time (CDT) Build

More information

A Lazy Scheduling Scheme

A Lazy Scheduling Scheme A Lazy Scheduling Scheme for Improving Hypercube Performance Prasant Mohapatra, Chansu Yu, Chita R. Das Dept. of Electrical and Computer Engineering The Pennsylvania State University University Park, PA

More information

CHAPTER 4 CONTENT October :10 PM

CHAPTER 4 CONTENT October :10 PM CHAPTER 4 By Radu Muresan University of Guelph Page 1 CHAPTER 4 CONTENT October 30 09 4:10 PM UNIPROCESSOR SCHEDULING Real Time Task Model Concepts Types of Real Time Tasks and Their Characteristics Task

More information

A Survey of Various Workflow Scheduling Algorithms in Cloud Environment

A Survey of Various Workflow Scheduling Algorithms in Cloud Environment A Survey of Various Workflow Algorithms in Anju Bala, Assistant Professor Computer Sci. & Engg.Deptt. Thapar University Patiala-147004 Dr.Inderveer Chana, Associate Professor Computer Sci. & Engg.Deptt.

More information

CLOUD COMPUTING- A NEW EDGE TO TECHNOLOGY

CLOUD COMPUTING- A NEW EDGE TO TECHNOLOGY CLOUD COMPUTING- A NEW EDGE TO TECHNOLOGY Prof. Pragati Goel Asso. Prof. MCA Dept., Sterling Institute of Management Studies, Nerul, Navi Mumbai. Navi Mumbai, India Email: goelpragati78@gmail.com The Cloud

More information

Job Scheduling in Cluster Computing: A Student Project

Job Scheduling in Cluster Computing: A Student Project Session 3620 Job Scheduling in Cluster Computing: A Student Project Hassan Rajaei, Mohammad B. Dadfar Department of Computer Science Bowling Green State University Bowling Green, Ohio 43403 Phone: (419)372-2337

More information

Efficiency of Dynamic Pricing in Priority-based Contents Delivery Networks

Efficiency of Dynamic Pricing in Priority-based Contents Delivery Networks Efficiency of Dynamic Pricing in Priority-based Contents Delivery Networks Noriyuki YAGI, Eiji TAKAHASHI, Kyoko YAMORI, and Yoshiaki TANAKA, Global Information and Telecommunication Institute, Waseda Unviersity

More information

CMS readiness for multi-core workload scheduling

CMS readiness for multi-core workload scheduling CMS readiness for multi-core workload scheduling Antonio Pérez-Calero Yzquierdo, on behalf of the CMS Collaboration, Computing and Offline, Submission Infrastructure Group CHEP 2016 San Francisco, USA

More information

ScienceDirect. Cloud Communication Concept for Bionic Assembly System

ScienceDirect. Cloud Communication Concept for Bionic Assembly System Available online at www.sciencedirect.com ScienceDirect Procedia Engineering 69 ( 2014 ) 1562 1568 24th DAAAM International Symposium on Intelligent Manufacturing and Automation, 2013 Cloud Communication

More information

Towards Autonomic Virtual Applications in the In-VIGO System

Towards Autonomic Virtual Applications in the In-VIGO System Towards Autonomic Virtual Applications in the In-VIGO System Jing Xu, Sumalatha Adabala, José A. B. Fortes Advanced Computing and Information Systems Electrical and Computer Engineering University of Florida

More information

Global position system technology to monitoring auto transport in Latvia

Global position system technology to monitoring auto transport in Latvia Peer-reviewed & Open access journal www.academicpublishingplatforms.com The primary version of the journal is the on-line version ATI - Applied Technologies & Innovations Volume 8 Issue 3 November 2012

More information

CLOUD computing and its pay-as-you-go cost structure

CLOUD computing and its pay-as-you-go cost structure IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 26, NO. 5, MAY 2015 1265 Cost-Effective Resource Provisioning for MapReduce in a Cloud Balaji Palanisamy, Member, IEEE, Aameek Singh, Member,

More information

Test-king.P questions P IBM B2B Integration Technical Mastery Test v1

Test-king.P questions P IBM B2B Integration Technical Mastery Test v1 Test-king.P2060-001.27 questions Number: P2060-001 Passing Score: 800 Time Limit: 120 min File Version: 5.5 P2060-001 IBM B2B Integration Technical Mastery Test v1 This study guides are so comprehensible

More information

Distributed Algorithms for Resource Allocation Problems. Mr. Samuel W. Brett Dr. Jeffrey P. Ridder Dr. David T. Signori Jr 20 June 2012

Distributed Algorithms for Resource Allocation Problems. Mr. Samuel W. Brett Dr. Jeffrey P. Ridder Dr. David T. Signori Jr 20 June 2012 Distributed Algorithms for Resource Allocation Problems Mr. Samuel W. Brett Dr. Jeffrey P. Ridder Dr. David T. Signori Jr 20 June 2012 Outline Survey of Literature Nature of resource allocation problem

More information

Storage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach

Storage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach Storage Allocation and Yard Trucks Scheduling in Container Terminals Using a Genetic Algorithm Approach Z.X. Wang, Felix T.S. Chan, and S.H. Chung Abstract Storage allocation and yard trucks scheduling

More information

A New Hadoop Scheduler Framework

A New Hadoop Scheduler Framework A New Hadoop Scheduler Framework Geetha J 1, N. Uday Bhaskar 2 and P. Chenna Reddy 3 Research Scholar 1, Assistant Professor 2 & 3 Professor 2 Department of Computer Science, Government College (Autonomous),

More information

Sizing SAP Central Process Scheduling 8.0 by Redwood

Sizing SAP Central Process Scheduling 8.0 by Redwood Sizing SAP Central Process Scheduling 8.0 by Redwood Released for SAP Customers and Partners January 2012 Copyright 2012 SAP AG. All rights reserved. No part of this publication may be reproduced or transmitted

More information

Best in Service Program Overview

Best in Service Program Overview Best in Service Program Overview Effective November 1, 2016 Contents Overview... 3 1.1 What is Best in Service?... 3 1.2 Program Goals... 3 1.3 Data Center Considerations... 4 1.4 Designation Types: Orange

More information

New Wayfinding Techniques in Pathfinder and Supporting Research

New Wayfinding Techniques in Pathfinder and Supporting Research New Wayfinding Techniques in Pathfinder and Supporting Research Charles Thornton, Richard O'Konski, Bryan Klein, Brian Hardeman, Daniel Swenson Thunderhead Engineering, 403 Poyntz Ave STE B, Manhattan,

More information

PowrSym4. A Presentation by. Operation Simulation Associates, Inc. February, 2012

PowrSym4. A Presentation by. Operation Simulation Associates, Inc. February, 2012 PowrSym4 A Presentation by Operation Simulation Associates, Inc. February, 2012 1 Presentation Contents History of PowrSym Introduction to OSA The PowrSym3 Model PowrSym4 Enhancements 2 PowrSym Background

More information

A self-optimized job scheduler for heterogeneous server clusters

A self-optimized job scheduler for heterogeneous server clusters A self-optimized job scheduler for heterogeneous server clusters Elad Yom-Tov IBM Haifa Research Lab Haifa 31905, Israel yomtov@il.ibm.com Yariv Aridor IBM Haifa Research Lab Haifa 31905, Israel yariv.aridor@gmail.com

More information