A formal model of a system for automated program parallelization

Authors:
V. A. Vasenin;A. N. Vodomerov
Affiliations:
Department of Mechanics and Mathematics, Moscow State University, Vorob'evy gory, Moscow, Russia 119992;Department of Mechanics and Mathematics, Moscow State University, Vorob'evy gory, Moscow, Russia 119992
Venue:
Programming and Computing Software
Year:
2007

Citing 10
Cited 0

The semantics of future and its use in program optimization

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
GUM: a portable parallel implementation of Haskell

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
The implementation of the Cilk-5 multithreaded language

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Modern C++ design: generic programming and design patterns applied

Modern C++ design: generic programming and design patterns applied
Foundations of Parallel and Distributed Programming

Foundations of Parallel and Distributed Programming
NeXeme: A Distributed Scheme Based on Nexus

Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
A programming environment for heterogenous distributed memory machines

HCW '97 Proceedings of the 6th Heterogeneous Computing Workshop (HCW '97)
Implementation of multilisp: Lisp on a multiprocessor

LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
The incremental garbage collection of processes

Proceedings of the 1977 symposium on Artificial intelligence and programming languages
OpenTS: an outline of dynamic parallelization approach

PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper, the T-system--an approach to automated program parallelization that has several implementations--is studied. In the absence of formal justification, these implementations have a number of disadvantages, which results in incorrect operation of programs. In the paper, a mathematical model of the T-system is constructed, and, in the framework of this model, correctness of parallelization is proved. The model makes it possible to reveal a number of inaccuracies in the latest version of the T-system OpenTS and suggest ways to eliminate them. The use of the formal model in the development of NewTS, a new version of the T-system, is described.