By Topic

Automatic parallelization of programs with tools of trace theory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Cerin, C. ; LRI-CNRS, Univ. de Paris Sud., Orsay, France

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

Published in:

Parallel Processing Symposium, 1992. Proceedings., Sixth International

Date of Conference:

23-26 Mar 1992