An Efficient Algorithm for Real-Time Divisible Load Scheduling

Mamat, Anwar; Lü, Ying; Deogun, Jitender S.; Goddard, Steve

doi:10.1109/rtas.2010.29

Cited by 4 publications

(2 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Because the multipliers u i (i = 1, 2, · · · , n) satisfy (18), and the speed of the processor can be formulated as (19), we derive from (13) that…”

Section: Analytical Solution With Kuhn-tucker Conditionsmentioning

confidence: 99%

“…Other similar applications include database search problems , linear algebra , and multimedia broadcasting . Because of the ideal characteristics of divisible loads, they are widely used in many parallel and distributed systems based on interconnected networks, such as cloud computing , computational grids , parallel clusters , wireless sensor networks , and other heterogeneous distributed systems . It is very meaningful to use DLT when studying an energy‐aware scheduling algorithm, and we investigate divisible loads in this paper.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An energy‐aware scheduling algorithm for divisible loads in a bus network

Duan-yang

Yang

Cheng

2015

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYThe schedule of divisible loads is one of the most typical problems in the research and application of parallel and distributed systems. For these large-scale systems, the energy consumption problem has drawn great attention in recent years because of falling hardware costs and the growing concern of energy costs. In computing-intensive systems, energy is primarily consumed by CPUs, and dynamic voltage-frequency scaling technology is capable of adjusting CPUs' speed as well as saving energy. In this paper, we focus on computing-intensive applications and study the energy-aware scheduling problem for divisible loads in a bus network. The energy-speed model is introduced to characterize the problem based on dynamic voltage scaling, and the energy-aware scheduling problem is analyzed in the application layer above the operating system. The problem can be formulated mathematically as a nonlinear programming problem, and the solution is achieved using the Lagrange multiplier method under Kuhn-Tucker conditions. Based on the analytical results, an energy-aware scheduling scheme called ENERG for divisible loads is presented. Finally, the energy-aware scheme is compared with two other schemes to show the effectiveness and efficiency of the energy savings of our algorithm. Additionally, the experimental results illustrate the influence of network transmission delay on energy consumption.

show abstract

“…Because the multipliers u i (i = 1, 2, · · · , n) satisfy (18), and the speed of the processor can be formulated as (19), we derive from (13) that…”

Section: Analytical Solution With Kuhn-tucker Conditionsmentioning

confidence: 99%