Compiling business processes: untangling unstructured loops in irreducible flow graphs

Author： Zhao Wei   Hauser Rainer   Bhattacharya Kamal   Bryant Barrett R.   Cao Fei  

Publisher： Inderscience Publishers

ISSN： 1741-1106

Source： International Journal of Web and Grid Services, Vol.2, Iss.1, 2006-02, pp. : 68-91

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Compiling Affine Nested Loops: How to Optimize the Residual Communications after the Alignment Phase

By Dion M.   Randriamaro C.   Robert Y.  

Journal of Parallel and Distributed Computing, Vol. 38, Iss. 2, 1996-11 ,pp. : 176-187

Academic Press

Access to resources Recommend Favorite

A collocated finite volume method for incompressible flow on unstructured meshes

By Yu Bo   Ozoe Hiroyuki   Tao Wen-Quan  

Progress in Computational Fluid Dynamics, An International Journal, Vol. 5, Iss. 3-4, 2005-04 ,pp. : 181-189

Inderscience Publishers

Access to resources Recommend Favorite

A PROGRAM FOR SIGNAL FLOW GRAPHS: (an alternative to Mason's theorem)

By MIDGLEY D.   RICHARDSON M.D.  

COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 4, Iss. 3, 1993-12 ,pp. : 155-165

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Model checking security properties of control flow graphs

By Besson F.  

Journal of Computer Security, Vol. 9, Iss. 3, 2001-01 ,pp. : 217-250

Ios Press

Access to resources Recommend Favorite

Maximum Flow in Directed Planar Graphs with Vertex Capacities

By Kaplan Haim   Nussbaum Yahav  

Algorithmica, Vol. 61, Iss. 1, 2011-09 ,pp. : 174-189

Springer Publishing Company

Access to resources Recommend Favorite