loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)
Using Dataflow Information to Improve Inter-Workflow Instance Concurrency
Dalian, China
December 05-December 08
ISBN: 0-7695-2405-2
Yang Wang, University of Alberta, Canada
Paul Lu, University of Alberta, Canada
The control-flow-based design of traditional batch scheduling systems (i.e., Job A must finish before Job B is started) can constrain the concurrency in schedulers for high-performance computing (HPC) workloads. There are two main problems. First, the control-flow graph, representing the workflow, may be inherently limited in its degree of concurrency. Second, if the naming strategy of the input and output files of jobs is simplistic, there may be a filename conflict problem when multiple instances of the same workflow run concurrently.
Citation:
Yang Wang, Paul Lu, "Using Dataflow Information to Improve Inter-Workflow Instance Concurrency," pdcat, pp.1078-1082, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.