Designing algorithms and assignments for distributed processing. Final report

This report describes work in two areas. The first develops an automatic procedure called SNONUET which has been coded in Fortran. SNONUET can be used for the high level design of distributed processors and near optimal assignments for strongly synchronous algorithms. The second area deals with techniques and models for developing asynchronous and weakly synchronous replacements for existing algorithms. Several illustrations are included. It is anticipted that the material in the second area will provide greater benefits but they will not be as quickly realized as the benefits from the work in the first area.