Parallel Tree Building on a Range of Shared Address Space Multiprocessors: Algorithms and Application Performance

@inproceedings{Shan1998ParallelTB,
  title={Parallel Tree Building on a Range of Shared Address Space Multiprocessors: Algorithms and Application Performance},
  author={Hongzhang Shan and Jaswinder Pal Singh},
  booktitle={IPPS/SPDP},
  year={1998}
}
Irregular, particle-based applications that use trees, fo r example hierarchical N-body applications, are important consu mers of multiprocessor cycles, and are argued to benefit greatly i n programming ease from a coherent shared address space programming model. As more and more supercomputing platforms that can support different programming models become available to users, from tightly-coupled hardware-coherent machines t o clusters of workstations or SMPs, to truly deliver on its ease of p… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Shast a: A low Overhead, Software-only Approach for supporting Fine-Grained Shared Memory

D.J.Scales, K. Gharachorloo, C.A.Thekkath
International Conference on Architectural Support for programming Languages and Operating systems, • 1996

A.Gupta and J.L.Hennessy, “Load Balancing and Data Locality in Adaptive Hierarchical N-body Methods: Barnes-Hut, Fast Multipole, and Radiosity

JP Singh, C.Holt, T. Totsuka
Journal of Parallel and Distributed Computing, • 1995
View 1 Excerpt

Similar Papers

Loading similar papers…