Table Driven Execution of a Parallel Processable Program.
TEXAS UNIV AUSTIN ELECTRONICS RESEARCH CENTER
Pagination or Media Count:
The parallel execution of independent segments of a sequentially organized program is investigated. A program is represented by means of a directed graph in which nodes represent computational tasks and edges represent transitions between tasks. From the program graph and the input-output requirements of each task the inherent parallelism is detected implicitly by means of a recognizer program. The parallel processable task graph is represented by a table generated by the recognizer in which task names refer to addresses in the object code representation of the source program. The addresses are supplied by the compiler to the recognizer on a request basis during the compilation process. The Task Table serves as an interface between the operating system and the parallel processing functions. Author
- Computer Programming and Software