Parallel algorithms that solve problems by communication

Publisher Website
Google Scholar
Abstract
Most current parallel computers are made from tens of processors that may communicate with each other (fairly slowly) by means of static intercommunication paths. However, in the future the use of optical communication media and wafer scale integration will facilitate construction of computers with thousands of simple processors each of which may communicate simultaneously with any other. What will these computers run? The authors present three novel algorithms that solve problems by communication (quicksort, tessellation and fractals). One, fractal image generation, works purely by iterative communication which is interesting because studies of the human brain indicate that the connections between neurons are mainly responsible for our powers of thought. These algorithms combine features of both imperative and connectionist programming styles and arose from a systematic study of goal-directed program transformation, including the target architecture with the program specification. They are examples of a whole class of such algorithms which the authors expect will be developed similarly Author(s) Sharp, D. Dept. of Comput., Imperial Coll. of Sci., Technol. & Med., London, UK Cripps, M.

This publication has 13 references indexed in Scilit: