Processor networks consisting of a thousand and more processing nodes that interact by sending messages over a communications network are feasible today. They can only meet the market's demand for high-speed, low-cost computing when adequate facilities for the implementation of distributed programs-programs consisting of a collection of processes that communicate and synchronize via the exchange of messages-are offered. This book investigates some of these facilities by viewing both the processor network and the distributed program as a graph. Dr. Hilbers begins by introducing distributed computing with graph theory, and considers processor networks and their price/performance ratios. He goes on to look at obtaining homogeneous distributions of work over networks and considers examples. The author closes by discussing message routing within a processor network. | Processor Networks and Aspects of the Mapping Problem by Peter A. J. Hilbers, Paperback | Indigo Chapters