Optimizing the Point-In-Box Search Algorithm for the Cray Y-MP(TM) Supercomputer
Determining the subset of points (particles) in a problem domain that are contained within certain spatial regions of interest can be one of the most time-consuming parts of some computer simulations. Examples where this 'point-in-box' search can dominate the computation time include (1) finite element contact problems; (2) molecular dynamics simulations; and (3) interactions between particles in numerical methods, such as discrete particle methods or smooth particle hydrodynamics. This paper describes methods to optimize a point-in-box search algorithm developed by Swegle that make optimal use of the architectural features of the Cray Y-MP Supercomputer.
- Research Organization:
- Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 2603
- Report Number(s):
- SAND93-0933; ON: DE00002603
- Country of Publication:
- United States
- Language:
- English
Similar Records
Optimizing an air quality model's algorithms for the cray Y-MP and the MASPAR MP-1
Highly vectorizable fault simulation on the Cray X-MP supercomputer
A performance comparison of three supercomputers: Fujitsu VP-2600, NEC SX-3, and CRAY Y-MP
Technical Report
·
Sat Jan 01 00:00:00 EST 1994
·
OSTI ID:2603
Highly vectorizable fault simulation on the Cray X-MP supercomputer
Journal Article
·
Fri Dec 01 00:00:00 EST 1989
· IEEE Transations on Computer-Aided Design of Integrated Circuits and Systems; (USA)
·
OSTI ID:2603
A performance comparison of three supercomputers: Fujitsu VP-2600, NEC SX-3, and CRAY Y-MP
Conference
·
Tue Jan 01 00:00:00 EST 1991
·
OSTI ID:2603
+4 more