/ Projects / The Problem by D.Mayhill. "Synchronization of the chain of Riflemans". Version 2
(версия для печати)
The Problem by D.Mayhill. "Synchronization of the chain of Riflemans". Version 2
(C) 2003. M.I.Guisov, A.B.Kuznetsov, A.A.Shalyto
Saint-Petersburg State Institute of Fine Mechanics and Optics (Technical University)
This publication demonstrates effectiveness of application object-oriented programming with evident state allocation, which uses both object-oriented and automation programming styles . In publication  the template was proposed for realization of automates that evoke consecutive. Though, it is not applicable for many different tasks with parallel processes, mainly because of an absence of the second state variable. For elimination of this defect we've used following approaches :
During program creation the message exchange mechanism was used for simplification of interaction of parallel-working automates. Mechanism was implemented under another project in "swmem" library .
For the example clearness the D.Mayhill problem (1947) was selected . It's main goal is the riflemans chain synchronization.
The example examined under this project displayed the effectiveness of using mentioned above approaches for implementation of parallel systems. It is important to note, that using built in logging system allows visualization of program operation. It considerably lightens programs debug and, in the end, demonstrates in obvious way accuracy of the program activity.