Automatic construction of sparse data flow evaluation graphs | Zendy

Jong-Deok Choi | Zendy; Ron K. Cytron | Zendy; Jeanne Ferrante | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Automatic construction of sparse data flow evaluation graphs

Author(s) -

Jong-Deok Choi,

Ron K. Cytron,

Jeanne Ferrante

Publication year - 1991

Publication title -

citeseer x (the pennsylvania state university)

Language(s) - English

Resource type - Conference proceedings

ISBN - 0-89791-419-8

DOI - 10.1145/99583.99594

Subject(s) - watson , ibm , research center , citation , computer science , division (mathematics) , center (category theory) , library science , mathematics , physics , artificial intelligence , political science , arithmetic , chemistry , law , optics , crystallography

In this paper, we present an algorithm that constructs sparse evaluation graphs for forward or backward monotone data flow problems. The sparse graph combines information as early as possible, yet directly connects nodes that generate and use information. This allows problems from the large, general class of monotone data flow problems to err joy the advantages of solutions based on Static Single Assignment (SSA) form.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research