An approach towards parallelisation of sequential programs in an interactive environment
Mukherjee, Smt. Nandini
An approach towards parallelisation of sequential programs in an interactive environment
This paper presents an approach for extraction of functional parallelism from sequential programs in an interactive environment. It uses Hierarchical Task Graph (HTG) as an intermediate representation of a parallel program. This graph is constructed starting from the entire sequential program as its root node, considering both loop nodes and conditional nodes as its intermediate nodes and the basic blocks as the leaf nodes. During an interactive session, the user can move across different levels of the HTG and may test whether different nodes can be executed in parallel. The user can even cross the basic block boundary to increase the scope of parallelisation. Once the Control Flow Graph for parallel code generation is decided through such interaction, the Execution Conditions for the nodes of this graph are derived using an efficient method
FUNCTIONAL PARALLELISM
HIERARCHICAL TASK GRAPH
LOOP NODES
CONDITIONAL NODES
INTERACTIVE ENVIRONMENT
DEPENDENCY ANALYSIS
DERIVATION OF EXECUTION CONDITIONS
H004.41 INF
An approach towards parallelisation of sequential programs in an interactive environment
This paper presents an approach for extraction of functional parallelism from sequential programs in an interactive environment. It uses Hierarchical Task Graph (HTG) as an intermediate representation of a parallel program. This graph is constructed starting from the entire sequential program as its root node, considering both loop nodes and conditional nodes as its intermediate nodes and the basic blocks as the leaf nodes. During an interactive session, the user can move across different levels of the HTG and may test whether different nodes can be executed in parallel. The user can even cross the basic block boundary to increase the scope of parallelisation. Once the Control Flow Graph for parallel code generation is decided through such interaction, the Execution Conditions for the nodes of this graph are derived using an efficient method
FUNCTIONAL PARALLELISM
HIERARCHICAL TASK GRAPH
LOOP NODES
CONDITIONAL NODES
INTERACTIVE ENVIRONMENT
DEPENDENCY ANALYSIS
DERIVATION OF EXECUTION CONDITIONS
H004.41 INF