Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Optimizing job scheduling on cloud resources using the first-come, first-served-SlotFree method

Bulletin of Electrical Engineering and Informatics · Vol. 14 No. 5 (2025) · hlm. 3683–3691

DOI
10.11591/eei.v14i5.9681
ISSN
2089-3191, 2302-9285
Terbit
2025-10-01
Penerbit
Institute of Advanced Engineering and Science (IAES)
Bahasa
en
Lisensi
creativecommons.org/licenses/by-sa/4.0/

Abstrak

Cloud computing environments encounter significant challenges in job scheduling, particularly due to excessive waiting times and inefficient resource utilization associated with conventional algorithms such as first-come, first-served (FCFS) and backfilling. This study introduces FCFS-SlotFree, a novel scheduling algorithm that enhances resource allocation efficiency by dynamically sorting jobs based on their arrival times and workloads, and subsequently assigning them to a fixed set of virtual machines (VMs) without relying on rigid time-slot constraints. This flexible scheduling approach facilitates better adaptation to heterogeneous workloads. Extensive experiments conducted under realistic cloud scenarios demonstrate that FCFS-SlotFree significantly reduces average waiting time (AWT) by approximately 32.78% compared to FCFS and by 9.68% compared to backfilling, while concurrently improving resource utilization by 3.58% and 1.27%, respectively. The results substantiate the algorithm’s effectiveness in optimizing scheduling performance and resource efficiency within complex cloud environments.

Kata kunci

Jaringan kolaborasi para penulis

9 penulis · 16 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Universitas Ahmad Dahlan
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Zahrul MufrodiUniversitas Ahmad Dahlan1
Bambang Robi’inAfiliasi tidak diketahui1
Sunardi SunardiUniversitas Ahmad Dahlan1
Son Ali AkbarUniversitas Ahmad Dahlan1
Aulia Naufal AfifUniversitas Ahmad Dahlan1
Eko AribowoUniversitas Ahmad Dahlan1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OpenAlex API (jurnal SINTA, ADR 0048) https://openalex.org/S2765016208, pertama di-harvest 19 Nov 2026, terakhir terlihat 19 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title xml:lang="en">Optimizing job scheduling on cloud resources using the first-come, first-served-SlotFree method</dc:title><dc:creator>Ardi Pujiyanta</dc:creator><dc:creator>Fiftin Noviyanto</dc:creator><dc:creator>Taufiq Ismail</dc:creator><dc:subject>cloud job scheduling</dc:subject><dc:subject>first-come-first-served scheduling</dc:subject><dc:subject>backfilling</dc:subject><dc:subject>virtual machine placement</dc:subject><dc:subject>resource utilization</dc:subject><dc:subject>average waiting time</dc:subject><dc:subject>heterogeneous workloads</dc:subject><dc:description xml:lang="en">Cloud computing environments encounter significant challenges in job scheduling, particularly due to excessive waiting times and inefficient resource utilization associated with conventional algorithms such as first-come, first-served (FCFS) and backfilling. This study introduces FCFS-SlotFree, a novel scheduling algorithm that enhances resource allocation efficiency by dynamically sorting jobs based on their arrival times and workloads, and subsequently assigning them to a fixed set of virtual machines (VMs) without relying on rigid time-slot constraints. This flexible scheduling approach facilitates better adaptation to heterogeneous workloads. Extensive experiments conducted under realistic cloud scenarios demonstrate that FCFS-SlotFree significantly reduces average waiting time (AWT) by approximately 32.78% compared to FCFS and by 9.68% compared to backfilling, while concurrently improving resource utilization by 3.58% and 1.27%, respectively. The results substantiate the algorithm’s effectiveness in optimizing scheduling performance and resource efficiency within complex cloud environments.</dc:description><dc:publisher>Institute of Advanced Engineering and Science (IAES)</dc:publisher><dc:date>2025-10-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/eei.v14i5.9681</dc:identifier><dc:identifier>10.11591/eei.v14i5.9681</dc:identifier><dc:source>Bulletin of Electrical Engineering and Informatics; Vol 14 No 5 (2025); 3683-3691</dc:source><dc:source>2089-3191</dc:source><dc:source>2302-9285</dc:source><dc:language>en</dc:language><dc:relation>https://beei.org/index.php/EEI/article/download/9681/4384</dc:relation><dc:rights>https://creativecommons.org/licenses/by-sa/4.0/</dc:rights></oai_dc:dc>