A parallel implemenation of bin sort.

This is an annotated version of a mock "predator/prey" model that was used to study the use of Z-ordering for 2-dimensional data and to show that UPC facilitates reading and writing random scalar data into a large shared array.

The fish and sharks application above motivated a separate study of the problem of computing large sparse histograms. By sparse we mean that the histogram table is large enough that the probability that two threads try to update the same cell at the same time is small.

A library that can be used for converting cartesian indices to Z-order indices for 2-dimensional arrays.

A study of different implementations of parallel hash tables

Last modified 3/3/06