PREEMPTIVE JOB SCHEDULING POLICY FOR DISTRIBUTIVELY-OWNED WORKSTATION CLUSTERS

2004 ◽  
Vol 14 (02) ◽  
pp. 255-270 ◽  
Author(s):  
JEMAL H. ABAWAJY
Keyword(s):  
Parallel Processing ◽  
Response Time ◽  
Cluster Computing ◽  
Job Scheduling ◽  
Response Times ◽  
Scheduling Algorithm ◽  
Cost Effective ◽  
Opportunistic Scheduling ◽  
Workstation Clusters ◽  
Scheduling Policy

Cluster computing has come to prominence as a cost-effective parallel processing tool for solving many complex computational problems. In this paper, we propose a new timesharing opportunistic scheduling policy to support remote batch job executions over networked clusters to be used in conjunction with the Condor Up-Down scheduling algorithm. We show that timesharing approaches can be used in an opportunistic setting to improve both mean job slowdowns and mean response times with little or no throughput reduction. We also show that the proposed algorithm achieves significant improvement in job response time and slowdown as compared to exiting approaches and some recently proposed new approaches.

scholarly journals A New Fuzzy-based Job Scheduling Algorithm for Cluster Computing

2013 ◽  
Vol 77 (1) ◽  
pp. 33-36
Author(s):  
Behzad Azizpour ◽  
Mehdi Effatparvar ◽  
Mohammad Sadeq Garshasbi
Keyword(s):  
Cluster Computing ◽  
Job Scheduling ◽  
Scheduling Algorithm ◽  
Job Scheduling Algorithm

scholarly journals ROA-CONS: Raccoon Optimization for Job Scheduling

Symmetry ◽  
2021 ◽  
Vol 13 (12) ◽  
pp. 2270
Author(s):  
Sina Zangbari Koohi ◽  
Nor Asilah Wati Abdul Hamid ◽  
Mohamed Othman ◽  
Gafurjan Ibragimov
Keyword(s):  
User Satisfaction ◽  
High Performance ◽  
Job Scheduling ◽  
Response Times ◽  
Scheduling Algorithm ◽  
Desktop Computer ◽  
Network Heterogeneity ◽  
Parallel Job Scheduling ◽  
Scheduling Method ◽  
And Performance

High-performance computing comprises thousands of processing powers in order to deliver higher performance computation than a typical desktop computer or workstation in order to solve large problems in science, engineering, or business. The scheduling of these machines has an important impact on their performance. HPC’s job scheduling is intended to develop an operational strategy which utilises resources efficiently and avoids delays. An optimised schedule results in greater efficiency of the parallel machine. In addition, processes and network heterogeneity is another difficulty for the scheduling algorithm. Another problem for parallel job scheduling is user fairness. One of the issues in this field of study is providing a balanced schedule that enhances efficiency and user fairness. ROA-CONS is a new job scheduling method proposed in this paper. It describes a new scheduling approach, which is a combination of an updated conservative backfilling approach further optimised by the raccoon optimisation algorithm. This algorithm also proposes a technique of selection that combines job waiting and response time optimisation with user fairness. It contributes to the development of a symmetrical schedule that increases user satisfaction and performance. In comparison with other well-known job scheduling algorithms, the simulation assesses the effectiveness of the proposed method. The results demonstrate that the proposed strategy offers improved schedules that reduce the overall system’s job waiting and response times.

scholarly journals Nudge: Stochastically Improving upon FCFS

2021 ◽  
Vol 5 (2) ◽  
pp. 1-29
Author(s):  
Isaac Grosof ◽  
Kunhe Yang ◽  
Ziv Scully ◽  
Mor Harchol-Balter
Keyword(s):  
Response Time ◽  
Open Problem ◽  
Scheduling Algorithm ◽  
Size Distributions ◽  
Asymptotically Optimal ◽  
Asymptotic Regime ◽  
Scheduling Policy ◽  
Asymptotic Tail

The First-Come First-Served (FCFS) scheduling policy is the most popular scheduling algorithm used in practice. Furthermore, its usage is theoretically validated: for light-tailed job size distributions, FCFS has weakly optimal asymptotic tail of response time. But what if we don't just care about the asymptotic tail? What if we also care about the 99th percentile of response time, or the fraction of jobs that complete in under one second? Is FCFS still best? Outside of the asymptotic regime, only loose bounds on the tail of FCFS are known, and optimality is completely open. In this paper, we introduce a new policy, Nudge, which is the first policy to provably stochastically improve upon FCFS. We prove that Nudge simultaneously improves upon FCFS at every point along the tail, for light-tailed job size distributions. As a result, Nudge outperforms FCFS for every moment and every percentile of response time. Moreover, Nudge provides a multiplicative improvement over FCFS in the asymptotic tail. This resolves a long-standing open problem by showing that, counter to previous conjecture, FCFS is not strongly asymptotically optimal.

scholarly journals Improved fair Scheduling Algorithm for Hadoop Clustering

2017 ◽  
Vol 10 (1) ◽  
pp. 194-200 ◽  
Author(s):  
Sneha Sneha ◽  
Shoney Sebastian
Keyword(s):  
Response Time ◽  
Job Scheduling ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Map Reduce ◽  
Process Data ◽  
Strategy Analysis ◽  
Fair Scheduling ◽  
New Strategy ◽  
And Performance

Traditional way of storing such a huge amount of data is not convenient because processing those data in the later stages is very tedious job. So nowadays, Hadoop is used to store and process large amount of data. When we look at the statistics of data generated in the recent years it is very high in the last 2 years. Hadoop is a good framework to store and process data efficiently. It works like parallel processing and there is no failure or data loss as such due to fault tolerance. Job scheduling is an important process in Hadoop Map Reduce. Hadoop comes with three types of schedulers namely FIFO (First in first out), Fair and Capacity Scheduler. The schedulers are now a pluggable component in the Hadoop Map Reduce framework. This paper talks about the native job scheduling algorithms in Hadoop. Fair scheduling algorithm is analysed with its algorithm considering its response time, throughput and performance. Advantages and drawbacks of fair scheduling algorithm is discussed. Improvised fair scheduling algorithm is proposed with new strategy. Analysis is made with respect to response time, throughput and performance is calculated in naive fair scheduling and improvised fair scheduling. Improvised fair Scheduling algorithms is used in the cases where there is jobs with high and less processing time.

Efficient Schedule of Energy-Constrained UAV Using Crowdsourced Buses in Last-Mile Parcel Delivery

2021 ◽  
Vol 5 (1) ◽  
pp. 1-23
Author(s):  
Yan Pan ◽  
Shining Li ◽  
Qianwu Chen ◽  
Nan Zhang ◽  
Tao Cheng ◽  
...  
Keyword(s):  
Traffic Congestion ◽  
Large Scale ◽  
Load Capacity ◽  
Scheduling Algorithm ◽  
Cost Effective ◽  
Promising Alternative ◽  
Logistics Industry ◽  
Last Mile ◽  
Delivery Scheduling ◽  
Schedule Approach

Stimulated by the dramatical service demand in the logistics industry, logistics trucks employed in last-mile parcel delivery bring critical public concerns, such as heavy cost burden, traffic congestion and air pollution. Unmanned Aerial Vehicles (UAVs) are a promising alternative tool in last-mile delivery, which is however limited by insufficient flight range and load capacity. This paper presents an innovative energy-limited logistics UAV schedule approach using crowdsourced buses. Specifically, when one UAV delivers a parcel, it first lands on a crowdsourced social bus to parcel destination, gets recharged by the wireless recharger deployed on the bus, and then flies from the bus to the parcel destination. This novel approach not only increases the delivery range and load capacity of battery-limited UAVs, but is also much more cost-effective and environment-friendly than traditional methods. New challenges therefore emerge as the buses with spatiotemporal mobility become the bottleneck during delivery. By landing on buses, an Energy-Neutral Flight Principle and a delivery scheduling algorithm are proposed for the UAVs. Using the Energy-Neutral Flight Principle, each UAV can plan a flying path without depleting energy given buses with uncertain velocities. Besides, the delivery scheduling algorithm optimizes the delivery time and number of delivered parcels given warehouse location, logistics UAVs, parcel locations and buses. Comprehensive evaluations using a large-scale bus dataset demonstrate the superiority of the innovative logistics UAV schedule approach.

Sign in / Sign up

Export Citation Format

Share Document