Minimum Dependencies Energy-Efficient Scheduling in Data Centers

Mateusz Żotkiewicz , Guzek Mateusz , Dzmitry Kliazovich , Pascal Bouvry


This work presents an on-line, energy- and communication-aware scheduling strategy for SaaS applications in data centers. The applications are composed of various services and represented as workflows. Each workflow consists of tasks related to each other by precedence constraints and represented by Directed Acyclic Graphs (DAGs). The proposed scheduling strategy combines advantages of state-of-the-art workflow scheduling strategies with energy-aware independent task scheduling approaches
Author Mateusz Żotkiewicz (FEIT / IT)
Mateusz Żotkiewicz,,
- The Institute of Telecommunications
, Guzek Mateusz - Uniwersytet w Luxemburgu (UL)
Guzek Mateusz,,
, Dzmitry Kliazovich - [University of Luxembourg (LU)]
Dzmitry Kliazovich,,
- Universitéit vu Lëtzebuerg
, Pascal Bouvry - Uniwersytet w Luxemburgu (UL)
Pascal Bouvry,,
Journal seriesIEEE Transactions on Parallel and Distributed Systems, ISSN 1045-9219
Issue year2016
Publication size in sheets0.85
Keywords in EnglishWorkflow scheduling, DAG scheduling, energy-efficient, dynamic scheduling
ASJC Classification1703 Computational Theory and Mathematics; 1708 Hardware and Architecture; 1711 Signal Processing
ProjectThe Develpment of Digital Communicatios. Project leader: Siuzdak Jerzy, , Phone: +48 22 234-7868, start date 27-04-2015, end date 31-12-2016, IT/2015/statut, Completed
WEiTI Działalność statutowa
Languageen angielski
2016 Żotkiewicz Minimum Dependencies.pdf 949.53 KB
Score (nominal)40
Score sourcejournalList
ScoreMinisterial score = 40.0, 02-02-2020, ArticleFromJournal
Ministerial score (2013-2016) = 40.0, 02-02-2020, ArticleFromJournal
Publication indicators WoS Citations = 6; Scopus SNIP (Source Normalised Impact per Paper): 2016 = 3.33; WoS Impact Factor: 2016 = 4.181 (2) - 2016=4.3 (5)
Citation count*
Share Share

Get link to the record

* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Are you sure?