A Self-Modifiable Approach to Scheduling and Mapping Algorithms in Multiprocessor Systems Eugeniusz Eberbach ‡ Jodrey School of Computer Science Acadia University Wolfville, Nova Scotia, Canada B0P 1X0 Tel: (902) 542-2201 x. 1390, Fax: (902) 542-4699 Email: eugene.eberbach@acadiau.ca Waldemar W. Koczkodaj ‡ Department of Mathematics and Computer Science Laurentian University Sudbury, Ontario, Canada P3E 2C6 Tel: (705) 675-1151 x. 2311, Fax: (705) 673-6591 Email: icci@nickel.laurentian.ca Abstract Keywords: Communication, Synchronization and Scheduling, Mapping Algo- rithms on Architectures A formal method for scheduling algorithms in multiprocessor architectures is pre- sented. The approach can be used for synthesis of processes in distributed systems and massively parallel architectures with asynchronous or synchronous parallelism. It is assumed that a global virtual job to be performed is given, and is necessary to subdivide it into subtasks performed by individual processors and to add appro- priate communication and synchronization structure to preserve a final global job intact. This task is performed using a formal environment of the Calculus of Self- Modifiable Algorithms - a generic tool for parallel problem solving. Due to the generality of the approach, it can be used in a majority of parallel environments. ‡ The research of both authors are partially supported by research grants from the Natural Sciences and Engineering Research Council of Canada, OGP0046501 and OGP0036838 respectively. 1