A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS

2004 ◽  
Vol 21 (01) ◽  
pp. 117-125 ◽  
Author(s):  
HARK-CHIN HWANG ◽  
SOO Y. CHANG ◽  
YUSHIN HONG
Keyword(s):  
Greedy Algorithm ◽  
Completion Time ◽  
Scheduling Algorithm ◽  
List Scheduling ◽  
Machine Eligibility ◽  
Identical Machines ◽  
On Line

We consider the on-line problem of scheduling n independent jobs on m identical machines under the machine eligibility constraints, where each job has its own specified subset of machines which are eligible for processing it. We investigate a greedy algorithm LS and prove its posterior competitiveness ratio is [Formula: see text], where λ is the number of machines eligible for processing the job with the latest completion time.

scholarly journals On-line extensible bin packing with unequal bin sizes

2009 ◽  
Vol Vol. 11 no. 1 (Analysis of Algorithms) ◽  
Author(s):  
Deshi Ye ◽  
Guochuan Zhang
Keyword(s):  
Bin Packing ◽  
Analysis Of Algorithms ◽  
Scheduling Algorithm ◽  
Packing Problem ◽  
Complete Analysis ◽  
List Scheduling ◽  
Total Size ◽  
International Audience ◽  
On Line ◽  
Original Size

Analysis of Algorithms International audience In the extensible bin packing problem we are asked to pack a set of items into a given number of bins, each with an original size. However, the original bin sizes can be extended if necessary. The goal is to minimize the total size of the bins. We consider the problem with unequal (original) bin sizes and give the complete analysis on a list scheduling algorithm (LS). Namely we present tight bounds of LS for every collection of original bin sizes and every number of bins. We further show better on-line algorithms for the two-bin case and the three-bin case. Interestingly, it is proved that the on-line algorithms have better competitive ratios for unequal bins than for equal bins. Some variants of the problem are also discussed.

Superposed Redundancy Approach for Building Reliable Communication in Multi-Bus Heterogeneous Systems

2019 ◽  
Vol 10 (1) ◽  
pp. 1-21
Author(s):  
Chafik Arar
Keyword(s):  
Fault Tolerant ◽  
Scheduling Algorithm ◽  
Heterogeneous Systems ◽  
List Scheduling ◽  
Reliable Communication ◽  
Data Scheduling ◽  
New Variant ◽  
Hardware Faults

In this article, the author uses a new variant of passive redundancy, which allows for a fictitious dual assignment by simultaneously scheduling two backup copies that overlap on the same communication bus at a given time. The proposed reliable fault tolerant greedy list scheduling algorithm is based on a superposed backup copy. This scheduling algorithm is considering up to n communication buses faults, caused by hardware faults and compensated by software redundancy solutions. it allows a reliable communication and efficient use of buses. In the experiments, the proposed methods are evaluated in terms of data scheduling length for a set of DSP benchmarks from the DSPstone.

On-Line Distributed Access Scheduling Algorithm for Space-Based Laser Satellite Network

2016 ◽  
Vol 53 (3) ◽  
pp. 030601
Author(s):  
王世超 Wang Shichao ◽  
吴斌 Wu Bin ◽  
汪勃 Wang Bo
Keyword(s):  
Scheduling Algorithm ◽  
Satellite Network ◽  
On Line

Efficient task scheduling on virtual machine in cloud computing environment

2020 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Mahfooz Alam ◽  
Mahak ◽  
Raza Abbas Haidri ◽  
Dileep Kumar Yadav
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Response Time ◽  
Virtual Machine ◽  
Task Allocation ◽  
Completion Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Content Type ◽  
Minimum Completion Time

Purpose Cloud users can access services at anytime from anywhere in the world. On average, Google now processes more than 40,000 searches every second, which is approximately 3.5 billion searches per day. The diverse and vast amounts of data are generated with the development of next-generation information technologies such as cryptocurrency, internet of things and big data. To execute such applications, it is needed to design an efficient scheduling algorithm that considers the quality of service parameters like utilization, makespan and response time. Therefore, this paper aims to propose a novel Efficient Static Task Allocation (ESTA) algorithm, which optimizes average utilization. Design/methodology/approach Cloud computing provides resources such as virtual machine, network, storage, etc. over the internet. Cloud computing follows the pay-per-use billing model. To achieve efficient task allocation, scheduling algorithm problems should be interacted and tackled through efficient task distribution on the resources. The methodology of ESTA algorithm is based on minimum completion time approach. ESTA intelligently maps the batch of independent tasks (cloudlets) on heterogeneous virtual machines and optimizes their utilization in infrastructure as a service cloud computing. Findings To evaluate the performance of ESTA, the simulation study is compared with Min-Min, load balancing strategy with migration cost, Longest job in the fastest resource-shortest job in the fastest resource, sufferage, minimum completion time (MCT), minimum execution time and opportunistic load balancing on account of makespan, utilization and response time. Originality/value The simulation result reveals that the ESTA algorithm consistently superior performs under varying of batch independent of cloudlets and the number of virtual machines’ test conditions.

Sign in / Sign up

Export Citation Format

Share Document