Show simple item record

Computational Structure of the N-body Problem

dc.date.accessioned2004-10-04T14:36:41Z
dc.date.accessioned2018-11-24T10:11:38Z
dc.date.available2004-10-04T14:36:41Z
dc.date.available2018-11-24T10:11:38Z
dc.date.issued1988-04-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6040
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/6040
dc.description.abstractThis 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.en_US
dc.format.extent52 p.en_US
dc.format.extent5659890 bytes
dc.format.extent2124339 bytes
dc.language.isoen_US
dc.subjectN-body problemen_US
dc.subjectparallel computingen_US
dc.subjectparticle simulationen_US
dc.titleComputational Structure of the N-body Problemen_US


Files in this item

FilesSizeFormatView
AIM-1042.pdf2.124Mbapplication/pdfView/Open
AIM-1042.ps5.659Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record