Abstract
The paper deals with some aspects or parallel data processing In multiprocessor systems. Two problems are taken into account: - structure analysis of the algorithm, - task allocation procedure. The presented method is based on the Petri net model of the algorithm. Then the net is analysed with PERT methods to reveal its intrinsic parallelism. Formalization or the problem is also proposed. The task allocation procedure based on path generation in the modelling net is described and tested. It is very convenient for computer implementation. The article describes also two structures of simple multiprocessor systems for control appllcations - one with a "mail-box" in the shared memory and another with a main processor managing information interchanges within the entire system. The second system may be used as a programmable multiprocessor control system with fault-tolerant and adoptive properties. Presented structures are described in the PMS notation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
