Topological ordering algorithm for LDAG

Authors:
Guiping Wang;Shuyu Chen;Xiaoqin Zhang;Zhen Zhou
Affiliations:
College of Computer Science, Chongqing University, Chongqing 400044, China;College of Software Engineering, Chongqing University, Chongqing 400044, China;College of Computer Science, Chongqing University, Chongqing 400044, China;College of Computer Science, Chongqing University, Chongqing 400044, China
Venue:
Information Processing Letters
Year:
2012

Citing 5
Cited 0

Introduction to algorithms

Introduction to algorithms
Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs

Information Processing Letters
An O(n2.75) algorithm for incremental topological ordering

ACM Transactions on Algorithms (TALG)
Provenance for the cloud

FAST'10 Proceedings of the 8th USENIX conference on File and storage technologies
On-demand minimum cost benchmarking for intermediate dataset storage in scientific cloud workflow systems

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

Directed Acyclic Graph (DAG) is an important tool for workflow modeling and data provenance management. In these applications, DAG usually performs well. Yet for some workflow applications, except data or control dependencies between atomic tasks, there exists another requirement that each atomic task should be accomplished at an expected stage. Therefore, this paper proposes an improved DAG model - LDAG, in which each vertex has a level. Three cases of the level of vertices are discussed. For a reasonable one of these cases, this paper proposes a topological ordering algorithm and proves its correctness. In addition, it discusses the complexity of the algorithm and some other relevant problems.