By Topic

Determining update latency bounds in Galactica Net

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Clayton, S. ; Worcester Polytech. Inst., MA, USA ; Duckworth, R.J. ; Michalson, W. ; Wilson, A.

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

Published in:

High-Performance Distributed Computing, 1992. (HPDC-1), Proceedings of the First International Symposium on

Date of Conference:

9-11 Sep 1992