Insertion scheduling: An alternative to list scheduling for modulo schedulers

1996 ◽  
pp. 31-45 ◽  
Author(s):  
Benoît Dupont de Dinechin
Keyword(s):  
List Scheduling

List scheduling bounds for uet systems with resources

1980 ◽  
Vol 10 (1) ◽  
pp. 28-31 ◽  
Author(s):  
Errol L. Lloyd
Keyword(s):  
List Scheduling

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.

QoS-constrained List Scheduling Heuristics for Parallel Applications on Grids

2008 ◽  
Author(s):  
Nicola Tonellotto ◽  
Ranieri Baraglia ◽  
Renato Ferrini ◽  
Laura Ricci ◽  
Ramin Yahyapour
Keyword(s):  
Parallel Applications ◽  
List Scheduling

Online-List Scheduling on a Single Bounded Parallel-Batch Machine to Minimize Makespan

2015 ◽  
Vol 32 (04) ◽  
pp. 1550028
Author(s):  
Wenhua Li ◽  
Jie Gao ◽  
Jinjiang Yuan
Keyword(s):  
Lower Bound ◽  
Competitive Ratio ◽  
Online Algorithm ◽  
Positive Root ◽  
List Scheduling ◽  
Batch Machine

In this paper, we consider the online-list scheduling on a single bounded parallel-batch machine to minimize makespan. In the problem, the jobs arrive online over list. The first unassigned job in the list should be assigned to a batch before the next job is released. Each batch can accommodate up to b jobs. For b = 2, we establish a lower bound 1 + γ of competitive ratio and provide an online algorithm with a competitive ratio of [Formula: see text], where γ is the positive root of γ(γ + 1)2 = 1. For b = 3, we establish a lower bound 1 + α of competitive ratio and provide an online algorithm with a competitive ratio of 2, where α is the positive root of the equation (1 + α)(1 + α2) = 2.

Sign in / Sign up

Export Citation Format

Share Document