A minimum tardiness and makespan-based scheduling algorithm on the distributed computing systems

Badral Undrakh, Jin Suk Kim

Research output: Contribution to journalArticlepeer-review


There are amount of high performance computing machines connected by network in Distributed Computing System. However we need to manage the resources efficiently. A scheduling algorithm manages the amount of computing machines efficiently [5]. There are two types of scheduling algorithm which are a static algorithm and a dynamic algorithm. The main function of the online scheduling algorithm which is a sort of the dynamic scheduling algorithm is to assign particular tasks into computing machines efficiently. There are several online scheduling algorithms are studied by many researchers [2, 3, 4, 5]. The aims of the previous scheduling algorithms are to reduce only makespan which is the completion time after all tasks have been finished. However, the majority of them have not considered a deadline of the task yet. A tardiness is the late time from the deadline of tasks to execute. In this paper, we have considered the deadlines of tasks and the makespan. We propose new online scheduling algorithm, MTM (Minimum Tardiness and Makespan) for reducing the makespan and total weighted tardiness. Finally, simulation results show that the proposed algorithm not only reduces the makespan, also cuts total weighted tardiness of the task.

Original languageEnglish
Pages (from-to)3441-3446
Number of pages6
Issue number8
StatePublished - Aug 2012


  • Distributed computing system
  • Makespan
  • Online scheduling algorithm
  • Simulation
  • Tardiness


Dive into the research topics of 'A minimum tardiness and makespan-based scheduling algorithm on the distributed computing systems'. Together they form a unique fingerprint.

Cite this