By Topic

Adjacent Matrix Based Deduction for Grid Workflow Applications

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

4 Author(s)
Fan Zhang ; Dept. of Autom., Tsinghua Univ., Beijing, China ; Cao, Junwei ; Lianchen Lu ; Cheng Wu

This paper presents an adjacent matrix based method for verifying and analyzing large scale workflows, which is used to find our three basic prosperities: sequential, parallel and simple mixing. Any workflow with the three characteristics can be grouped and deducted into smaller and even easier workflow. This reduction can also be used to figure out branches in complicated connected workflows. We exemplify our method using a real scientific workflow in our previous work. The analysis of reduced workflow can further facilitate the verification and validating process.

Published in:

Networking and Distributed Computing (ICNDC), 2010 First International Conference on

Date of Conference:

21-24 Oct. 2010