By Topic

An extension to DAG based scheduling for partial dependent tasks An Approach to optimize partial dependent tasks in a distributed system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shweta, M.A. ; CTDC INDIA TEC, Siemens Technol. & Services Pvt. Ltd., Bangalore, India ; Eeratta, R. ; Shenoy, S.S.

Real time applications are now utilizing the computational power of multiprocessor and distributed systems [1] to improve their performance. Usually, these applications solve either data-intensive or compute-intensive problems. Applications executing on distributed systems provide faster response time than running on a stand-alone machine. For an application to execute on a distributed system it has to be decomposable into small and independent tasks, where a task is a single independent unit of execution. These tasks can be distributed to various nodes on a HPC[2] grid or cluster for faster execution. The task allocation to processors on a distributed or multiprocessor system is an NP hard problem [3] and determining an optimal solution has exponential complexity. Some problems cannot be completely decomposable into independent tasks due to the nature of application; this is due to the interdependencies of the tasks. Even if the application is not completely parallelizable, it will execute faster than executing it sequentially, if some of the tasks execute in parallel. As part of this paper, we describe an approach for scheduling tasks on a distributed environment by resolving the partial dependent tasks using the Directed Acyclic Graphs (DAG) [4] and Matrix Manipulation.

Published in:

India Conference (INDICON), 2012 Annual IEEE

Date of Conference:

7-9 Dec. 2012