next up previous contents
Next: The user interface to Up: Implementation on the Cray Previous: Introduction

The Implementation

The nodes in the data structure are named using Path s, a doubly-linked list of integers that represent the branches. Each processor stores a hash table linking the paths to the global pointers that describe to which processor a node belongs.



Timothy Lewis
11/12/1997