Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6040Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Katzenelson, Jacob | - |
| dc.date | 2004-10-04T14:36:41Z | - |
| dc.date | 2004-10-04T14:36:41Z | - |
| dc.date | 1988-04-01 | - |
| dc.date.accessioned | 2013-10-09T02:42:30Z | - |
| dc.date.available | 2013-10-09T02:42:30Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-1042 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6040 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | This work considers the organization and performance of computations on parallel computers of tree algorithms for the N-body problem where the number of particles is on the order of a million. The N-body problem is formulated as a set of recursive equations based on a few elementary functions, which leads to a computational structure in the form of a pyramid-like graph, where each vertex is a process, and each arc a communication link. The pyramid is mapped to three different processor configurations: (1) A pyramid of processors corresponding to the processes pyramid graph; (2) A hypercube of processors, e.g., a connection-machine like architecture; (3) A rather small array, e.g., $2 \\times 2 \\ times 2$, of processors faster than the ones considered in (1) and (2) above. Simulations of this size can be performed on any of the three architectures in reasonable time. | - |
| dc.format | 52 p. | - |
| dc.format | 5659890 bytes | - |
| dc.format | 2124339 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-1042 | - |
| dc.subject | N-body problem | - |
| dc.subject | parallel computing | - |
| dc.subject | particle simulation | - |
| dc.title | Computational Structure of the N-body Problem | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.