This article focuses on algorithm representation by means of Petri nets and data dependence graphs. In order to detect antidependencies and output dependencies in Petri net representation we have introduced a term IP-dependencies (instruction-pointer-related data interactions). This original approach allows us to put knowledge of automatic parallelization via data dependence graphs and Petri nets onto the same theoretical platform and to join the two scientific branches.
Published in:
Systems, Man, and Cybernetics, 1998. 1998 IEEE International Conference on
(Volume:1
)
Date of Conference: 11-14 Oct 1998