Scalable and Energy-Efficient Scheduling Techniques for Large-Scale Systems

Authors:
Cesar O. Diaz;Mateusz Guzek;Johnatan E. Pecero;Pascal Bouvry;Samee U. Khan
Affiliations:
-;-;-;-;-
Venue:
CIT '11 Proceedings of the 2011 IEEE 11th International Conference on Computer and Information Technology
Year:
2011

Citing 0
Cited 4

Towards secure mobile cloud computing: A survey

Future Generation Computer Systems
Green flexible opportunistic computing with task consolidation and virtualization

Cluster Computing
Review: A survey on resource allocation in high performance distributed computing systems

Parallel Computing
Scalable, low complexity, and fast greedy scheduling heuristics for highly heterogeneous distributed computing systems

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The scalability of a computing system can be identified by at least three components: (a) size, (b) geographical distribution, and (c) administrative constraints. Newer paradigms, such as clouds, grids, and clusters bring in more parameters to the aforementioned list, namely heterogeneity, energy consumption, and transparency. To optimize the performance of a computing system, it is manner that exploits heterogeneity and is scalable. Moreover, newer systems also demand energy efficiency as an integral part of schedulers. In this paper, we evaluate the behavior of low complexity energy-efficient algorithms for scheduling. The set of experimental results showed that the evaluated heuristics perform as efficiently as related approaches, demonstrating their applicability and scalability for the considered problem.