Determining update latency bounds in Galactica Net

This paper looks at the problem of ensuring performance of real-time applications hosted on Galactica Net, a mesh-based distributed cache coherent shared memory multiprocessing system. A method for determining strict upper bounds on worst case latencies in wormhole routed meshes is presented, and it is shown that the update latency of Galactica Net is deterministic. A tool for determining strict upper bounds for shared memory update latencies has been developed so that differing real-time process placements in a Galactica Net system may be compared to minimize update latency bounds