ADA multitasking and the single source shortest path problem

Abstract

This paper examines the implementation in ADA of several parallel algorithms for solving the single source shortest path problem. The algorithm favor certain parallel architectures: vector machine, tree machine, and a distributed processor environment. The paper gives ADA implementations of the algorithms that attempt to retain the preferential treatment to the particular hardware, and discusses whether with proper translation, preferential efficiency can be maintained.