Authors: Soma Prathibha; B. Latha; G. Sumathi
Addresses: Department of Information Technology, Sri Sai Ram Engineering College, Anna University, Chennai, India ' Department of Computer Science and Engineering, Sri Sai Ram Engineering College, Chennai, India ' Department of Information Technology, Sri Venkateswara College of Engineering, Chennai, India
Abstract: Scientific applications modelled as directed acyclic graphs (DAGs) are composed of complex calculations and a large amount of data transfer. It is very difficult to execute these applications on traditional distributed computing platforms. For such applications, cloud provides a reliable solution due to its unique characteristics, task clustering is performed which combines two or more tasks into a single executable unit. Task clustering can help to reduce the system overheads such as queue delay, engine delay and so on. Existing clustering algorithms in this domain focus more on computational granularity of the tasks without considering the data dependency among the tasks. In this paper, a data aware clustering algorithm has been proposed which combines the tasks depending on the size of data transferred between interdependent tasks. Experiments were conducted to compare the proposed clustering algorithm with the existing baseline and balanced clustering algorithms and it was observed that proposed algorithm gave better makespan and cost for data intensive workflow applications.
Keywords: directed acyclic graphs; DAGs; task clustering; billing model; scheduling.
International Journal of Internet Technology and Secured Transactions, 2019 Vol.9 No.3, pp.260 - 281
Received: 04 Jul 2017
Accepted: 01 Feb 2018
Published online: 28 Aug 2019 *