Two optimal parallel algorithms on the commutation class of a word
Theoretical Computer Science - Words, languages and combinatorics
| Hi-index | 0.00 |
Establishes a connection between a tool of trace theory able to split a parallel process into sequential ones verifying synchronising conditions and techniques for automatic extraction of parallelism. This tool is called Foata normal form. It theoretically affirms that the execution of a sequential process, under Foata normal form, can be considered as the fastest one. It gives a sequential program, as a Pascal program, a representation in which all the equivalent parallel executions of sequential ones appear in order to facilitate code generation of a compiler restructuring sequential programs.