Critical path based scheduling of multiple applications in heterogeneous distributed computing

Abstract

The paper presents a task allocation technique for multiple applications onto Heterogeneous Distributed Computing System to minimize the overall makespan. An existing critical path based algorithm for scheduling of tasks of single application has been used to allocate tasks of multiple applications onto Heterogeneous Distributed Computing System. The paper discusses how a composite application is given for multiple applications and how critical path based algorithm is applied efficiently for the allocation of tasks of different applications. © 2009 IEEE.