A case study of task priority effects in GA for cluster based DAG scheduling

Hongliang Lu, Jiannong Cao, Shaohe Lv, Xiaodong Wang, Juan Liu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

1 Citation (Scopus)

Abstract

Directed acyclic graph (DAG) has been widely used in parallel and distributed applications. It is made up by the tasks that are decomposed from the complex application processes. To reduce the intra-tasks dependency time and the total workflow processing time, a promising design named cluster based schedule was put forward. The most popular way for generating the clusters is the genetic algorithm (GA) based method. However, in the GA based clustering processes, different priorities calculation methods lead to totally different results. Aiming at having a deep cognition of the effects of the priorities, this paper comparatively studied the tasks schedule performance with different priorities calculation methods. The experiment results show that the longest path priority can lead to a better schedule performance compared with the other ones.
Original languageEnglish
Title of host publicationInternational Conference on Information Society, i-Society 2015
PublisherIEEE
Pages157-162
Number of pages6
ISBN (Electronic)9781908320483
DOIs
Publication statusPublished - 28 Dec 2015
EventInternational Conference on Information Society, i-Society 2015 - London, United Kingdom
Duration: 9 Nov 201511 Nov 2015

Conference

ConferenceInternational Conference on Information Society, i-Society 2015
Country/TerritoryUnited Kingdom
CityLondon
Period9/11/1511/11/15

Keywords

  • cluster based schedule
  • critical path
  • genetic algorithm
  • priority

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Networks and Communications
  • Information Systems

Cite this