mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Energy-efficient Scheduling of Real-Time Cloud Services Using Task Consolidation and Dynamic Voltage Scaling
Univ Tehran, Sch ECE, Tehran, Iran..
Univ Tehran, Sch ECE, Tehran, Iran..
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0002-1384-5323
Univ Tehran, Sch ECE, Tehran, Iran..
Show others and affiliations
2014 (English)In: 2014 7th International Symposium on Telecommunications (IST), IEEE , 2014, p. 675-682Conference paper (Refereed)
Abstract [en]

Energy consumption has attracted a lot of attention in the past few years, because energy reduction causes a significant mitigation of the negative impact on the environment along with an operational cost reduction. Energy-efficient task scheduling is an effective technique to decrease the energy consumption in the Cloud Computing Systems (CCSs). In this paper, the problem of scheduling a set of precedence-constrained real-time services onto a set of heterogenous servers is investigated. Each service contains a set of tasks bounded with a specific deadline. The main notion applied in this paper is to employ the consolidation approach along with the Dynamic Voltage Scaling (DVS) technique. The proposed scheduler is developed in three phases. Tasks' deadlines and a laxity metric are computed for each service according to the corresponding service deadline prior to the main scheduling phase. Afterwards, in order to consolidate the tasks onto the minimum number of servers, the algorithm estimates the required number of servers. Finally, in the last phase, the tasks are scheduled while the DVS technique is applied with considering the tasks' deadlines. The extensive experimental results clearly demonstrate that the proposed algorithm reduces the energy consumption of a CCS by 14% on average in comparison with beam search algorithm. In addition, it outperforms the non power-aware algorithm by 84%.

Place, publisher, year, edition, pages
IEEE , 2014. p. 675-682
Keyword [en]
precedence-constraint prallel application, energy-efficient scheduling, DVS, task consolidation, real-time services
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:mdh:diva-38395ISI: 000392911900126OAI: oai:DiVA.org:mdh-38395DiVA: diva2:1182148
Conference
7th International Symposium on Telecommunications (IST)
Available from: 2018-02-12 Created: 2018-02-12 Last updated: 2018-02-12Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records BETA

Faragardi, Hamid Reza

Search in DiVA

By author/editor
Faragardi, Hamid Reza
By organisation
Embedded Systems
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf