Problem-oriented scheduling of cloud applications: PO-HEFT algorithm case study

E.A. Nepovinnykh; G.I. Radchenko

doi:10.1109/MIPRO.2016.7522134

Problem-oriented scheduling of cloud applications: PO-HEFT algorithm case study

Research output: Contribution to conference (No Proceedings) › Paper › peer-review

Abstract

Today we see a significantly increased use of problem-oriented approach to the development of cloud computing environment scheduling algorithms. There are already several such algorithms. However, a lot of these require that the tasks within a single job are independent and do not account for the execution of each task and the volume of data transmitted. We propose a model of problem-oriented cloud environment. Using this model, we propose a list-based algorithm of problem-oriented planning of execution of applications in a cloud environment that considers the applications' execution profiles, based on a Heterogeneous Earliest-Finish-Time (HEFT) algorithm. © 2016 Croatian Society MIPRO.

Original language	English
Pages	180-185
Number of pages	6
DOIs	https://doi.org/10.1109/MIPRO.2016.7522134
Publication status	Published - 2016
Event	39th International Convention on Information and Communication Technology, Electronics and Microelectronics - Opatija, Croatia Duration: 30 May 2016 → 3 Jun 2016

Conference

Conference	39th International Convention on Information and Communication Technology, Electronics and Microelectronics
Abbreviated title	MIPRO 2016
Country/Territory	Croatia
City	Opatija
Period	30/05/16 → 3/06/16

Keywords

cloud computing
execution planning
grid computing
HEFT
scheduling
Algorithms
Cloud computing
Grid computing
Microelectronics
Scheduling
Cloud applications
Cloud computing environments
Cloud environments
Execution planning
Finish time
Scheduling algorithms

Access to Document

10.1109/MIPRO.2016.7522134

https://www.scopus.com/inward/record.uri?eid=2-s2.0-84983605248&doi=10.1109%2fMIPRO.2016.7522134&partnerID=40&md5=6fac39cdc537353587dfc6b15ee811f5

Cite this

@conference{3584e3858c8e4ed6bbeb8343b6d765a1,

title = "Problem-oriented scheduling of cloud applications: PO-HEFT algorithm case study",

abstract = "Today we see a significantly increased use of problem-oriented approach to the development of cloud computing environment scheduling algorithms. There are already several such algorithms. However, a lot of these require that the tasks within a single job are independent and do not account for the execution of each task and the volume of data transmitted. We propose a model of problem-oriented cloud environment. Using this model, we propose a list-based algorithm of problem-oriented planning of execution of applications in a cloud environment that considers the applications' execution profiles, based on a Heterogeneous Earliest-Finish-Time (HEFT) algorithm. {\textcopyright} 2016 Croatian Society MIPRO.",

keywords = "cloud computing, execution planning, grid computing, HEFT, scheduling, Algorithms, Cloud computing, Grid computing, Microelectronics, Scheduling, Cloud applications, Cloud computing environments, Cloud environments, Execution planning, Finish time, Scheduling algorithms",

author = "E.A. Nepovinnykh and G.I. Radchenko",

note = "Conference code: 123025 Cited By :3 Export Date: 27 August 2021; 39th International Convention on Information and Communication Technology, Electronics and Microelectronics, MIPRO 2016 ; Conference date: 30-05-2016 Through 03-06-2016",

year = "2016",

doi = "10.1109/MIPRO.2016.7522134",

language = "English",

pages = "180--185",

}

TY - CONF

T1 - Problem-oriented scheduling of cloud applications: PO-HEFT algorithm case study

AU - Nepovinnykh, E.A.

AU - Radchenko, G.I.

N1 - Conference code: 123025 Cited By :3 Export Date: 27 August 2021

PY - 2016

Y1 - 2016

N2 - Today we see a significantly increased use of problem-oriented approach to the development of cloud computing environment scheduling algorithms. There are already several such algorithms. However, a lot of these require that the tasks within a single job are independent and do not account for the execution of each task and the volume of data transmitted. We propose a model of problem-oriented cloud environment. Using this model, we propose a list-based algorithm of problem-oriented planning of execution of applications in a cloud environment that considers the applications' execution profiles, based on a Heterogeneous Earliest-Finish-Time (HEFT) algorithm. © 2016 Croatian Society MIPRO.

AB - Today we see a significantly increased use of problem-oriented approach to the development of cloud computing environment scheduling algorithms. There are already several such algorithms. However, a lot of these require that the tasks within a single job are independent and do not account for the execution of each task and the volume of data transmitted. We propose a model of problem-oriented cloud environment. Using this model, we propose a list-based algorithm of problem-oriented planning of execution of applications in a cloud environment that considers the applications' execution profiles, based on a Heterogeneous Earliest-Finish-Time (HEFT) algorithm. © 2016 Croatian Society MIPRO.

KW - cloud computing

KW - execution planning

KW - grid computing

KW - HEFT

KW - scheduling

KW - Algorithms

KW - Cloud computing

KW - Grid computing

KW - Microelectronics

KW - Scheduling

KW - Cloud applications

KW - Cloud computing environments

KW - Cloud environments

KW - Execution planning

KW - Finish time

KW - Scheduling algorithms

U2 - 10.1109/MIPRO.2016.7522134

DO - 10.1109/MIPRO.2016.7522134

M3 - Paper

SP - 180

EP - 185

T2 - 39th International Convention on Information and Communication Technology, Electronics and Microelectronics

Y2 - 30 May 2016 through 3 June 2016

ER -

Problem-oriented scheduling of cloud applications: PO-HEFT algorithm case study

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this