Mathematical Studies of Information Processing
Volume 75 of the series Lecture Notes in Computer Science pp 67105
Synchronized parallel computation and slowdown of translators
 Karel ČulikAffiliated withThe Pennsylvania State University
Abstract
The underlying parallel computers are assumed to be MIMD machines [Ku] with m≥1 synchronized and independent homogeneous processors [Ba], and parallel program schemes for them are introduced and studied. In section 1 usual (serial) program schemes and their function equivalence are introduced. In section 2 parallel program schemes are introduced as extensions of [Ma] and the main theorem is proved that each parallel program scheme can be translated into an mparallel one where m≥1 is prescribed. In section 3 variablefree permit schemes without tests [Cu5] are introduced, and in section 4 their addressings are admitted. The functionality of permit schemes is investigated expecially for nonterminating processes (controlled by "semaphors" [Di], [LS]). In section 5 the parallel defect and the slowdown of a translator are introduced in all generality for arbitrary time unbounded program schemes.
 Title
 Synchronized parallel computation and slowdown of translators
 Book Title
 Mathematical Studies of Information Processing
 Book Subtitle
 Proceedings of the International Conference Kyoto, Japan, August 23–26, 1978
 Pages
 pp 67105
 Copyright
 1979
 DOI
 10.1007/3540095411_23
 Print ISBN
 9783540095415
 Online ISBN
 9783540350101
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 75
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 Karel Čulik ^{(1)}
 Author Affiliations

 1. The Pennsylvania State University, 16802, University Park, PA
Continue reading...
To view the rest of this content please follow the download PDF link above.