DocumentCode
3203938
Title
Automatic parallelization of programs with tools of trace theory
Author
Cérin, Christophe
Author_Institution
LRI-CNRS, Univ. de Paris Sud., Orsay, France
fYear
1992
fDate
23-26 Mar 1992
Firstpage
374
Lastpage
378
Abstract
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
Keywords
finite automata; formal languages; parallel programming; programming theory; Foata normal form; automatic parallelization; code generation; compiler; sequential process; synchronising conditions; trace theory tools; Automata; Concurrent computing; Formal languages; Parallel algorithms; Parallel processing; Program processors; Vocabulary;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Symposium, 1992. Proceedings., Sixth International
Conference_Location
Beverly Hills, CA
Print_ISBN
0-8186-2672-0
Type
conf
DOI
10.1109/IPPS.1992.223016
Filename
223016
Link To Document