Redistribution in distributed Ada

Abstract

In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed datedlow application. This relocation mechanism will provide the capability of providing both passive and active fault tolerance. Special care will be taken to demonstrate how errors are trapped and propagated across partitions containing multiple threads of execution.