Premium
A method of program transformation between variable sharing and message passing
Author(s) -
Hikita Teruo,
Ishihata Kiyoshi
Publication year - 1985
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380150706
Subject(s) - computer science , semaphore , transformation (genetics) , program transformation , synchronization (alternating current) , inter process communication , variable (mathematics) , parallel computing , sorting , message passing , nondeterministic algorithm , theoretical computer science , distributed computing , programming language , algorithm , mathematics , computer network , biochemistry , chemistry , channel (broadcasting) , mathematical analysis , gene
There have been proposed and used many programming concepts for realizing interprocess communication and synchronization, and two fundamental categories among them are variable sharing (e.g. semaphores) and message passing (signals, input/output in CSP and redezvous in Ada). The aim of this paper is to investigate the relationship between these two mechanisms, and in particular, program transformation between them. We here propose a transformation method between parallel programs written in each of these two, which uses transformation schemes named monitor transformations. We exhibit the method by showing through a chain of program transformations the equivalence of two versions of a parallel algorithm called dynamic sorting array.