Energy‐aware online non‐clairvoyant multiprocessor scheduling: multiprocessor priority round robin

Singh, Pawan; Hailu, Nirayo

doi:10.1049/iet-cdt.2016.0097

Cited by 3 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the contrary, energy efficient computing is an important issue in amortizing the costs associated with data computation, especially in large scale cluster environments. A lot of previous works, [24], [28]- [34], [47]- [49], tried to provision some techniques that amortize the energy costs associated with intensive computation in large data centers. Works such as [47]- [49] achieved the benefits of combining scheduling and power management, but the drawback is that they assumed this job scheduling and power management in a uni-processor environment.…”

Section: Related Workmentioning

confidence: 99%

“…A lot of previous works, [24], [28]- [34], [47]- [49], tried to provision some techniques that amortize the energy costs associated with intensive computation in large data centers. Works such as [47]- [49] achieved the benefits of combining scheduling and power management, but the drawback is that they assumed this job scheduling and power management in a uni-processor environment. Most of the other works [24], [28]- [34], tried to leverage on idle time slots, which might be challenging to obtain in situations where there is scarcity of idle times.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Towards an Energy Efficient Computing With Coordinated Performance-Aware Scheduling in Large Scale Data Clusters

et al. 2019

View full text Add to dashboard Cite

Many prior works have investigated on how to increase the job processing performance and energy efficient computing in large scale clusters. However, they employ serialized scheduling approaches encompassed with task straggler ''hunting'' techniques which launches speculative tasks after detecting slow tasks. These slow tasks are detected through node instrumentation which collects system level information whilst tracking the task execution progress. Such approaches are however detrimental towards achieving maximum processing performance and preserving cluster energy as they increase communication overheads. In this paper, we observe that node instrumentation and serialized scheduling in existing works does not only degrade the job processing performance, but also increase cluster energy consumption. To alleviate this, we propose EPPADS, a light-weight scheduler which eradicates the need for instrumentation modules for job scheduling purposes. EPPADS schedules tasks in two stages, the slow-start phase (SSP) and accelerate phase (AccP). The SSP schedules initial tasks in the queue using baseline FIFO scheduling and records the initial execution times of the processing nodes, whilst tagging the effective and straggling nodes. The AccP uses the initial execution times to compute the processing nodes task distribution ratio of remaining tasks and schedules them in parallel using a single scheduling I/O, boosting up the processing performance. To amortize the computing energy costs, EPPADS implements a power management module that coordinates with the scheduling module and leverage on node tagging information, to place nodes in two different power transition pools, i.e., high and low state power pools. A single power transition signal per pool is then broadcasted to lower or raise the energy state in the low-power state pool and high-power state pool. Our evaluation using a Hadoop cluster shows that EPPADS achieves 30% and 22% performance improvement and 15% to 20% energy savings as compared to the FIFO and DynMon schedulers, respectively. INDEX TERMSDistributed processing, energy efficiency, scheduling. PRINCE HAMANDAWANA received the B.Sc. degree (Hons.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Towards an Energy Efficient Computing With Coordinated Performance-Aware Scheduling in Large Scale Data Clusters

et al. 2019

View full text Add to dashboard Cite

show abstract

“…The scheduling problems under the non-clairvoyant settings are more difficult and practical than the clairvoyant setting. In the last decade, the non-clairvoyant scheduling problems for the objective of minimising the magnitude-based/weighted flow time plus energy have been studied less extensively than others; few results for this objective are [18][19][20][21][22][23].…”

Section: Introductionmentioning

confidence: 99%