Planning and Scheduling Jobs on Grid Computing

pujiyanta, ardi and Edi Nugroho, Lukito and widyawan, widyawan Planning and Scheduling Jobs on Grid Computing. [Artikel Dosen]

	Text 1580783882_4_2018-Planning_and_Scheduling_Jobs_on_Grid_Computing.pdf Download (527kB)
	Text Hasil cek-planning.pdf Download (2MB)
	Text PEER REVIEW- Planning and Scheduling Jobs on Grid Computing1.pdf Download (248kB)

Abstract

Planning and scheduling in the Grid System allow
applications to request resources from multiple scheduling systems at any given time in the future, by gaining simultaneous access to resources sufficient for their deployment. Existing scheduling strategies will deny incoming jobs if the requested resource is not available on time. Therefore, the job scheduling algorithm is one of the key areas in Grid Computing. This paper first describes the First Come First Serve Ejecting Based Dynamic Scheduling (FCFS-EDS), a job scheduling model used in Grid Computing environments, then discusses proposed job scheduling algorithms and system grid architectures as required. Finally, the proposed algorithm can perform job scheduling, as well as increase execution time for use in Grid Computing environments.

Item Type:	Artikel Dosen
Subjects:	T Technology > T Technology (General)
Divisi / Prodi:	Faculty of Industrial Technology (Fakultas Teknologi Industri) > S1-Informatics Engineering (S1-Teknik Informatika)
Depositing User:	Dr. Ir. Ardi Pujiyanta, M.T.
Date Deposited:	11 Nov 2021 20:43
Last Modified:	11 Nov 2021 20:43
URI:	http://eprints.uad.ac.id/id/eprint/29002

Actions (login required)

View Item