ACM Home Page
Please provide us with feedback. Feedback
GRAPE-DR: 2-Pflops massively-parallel computer with 512-core, 512-Gflops processor chips for scientific computing
Full text PdfPdf (227 KB)
Source
Conference on High Performance Networking and Computing archive
Proceedings of the 2007 ACM/IEEE conference on Supercomputing - Volume 00 table of contents
Reno, Nevada
SESSION: System architecture table of contents
Article No. 18  
Year of Publication: 2007
ISBN:978-1-59593-764-3
Authors
Junichiro Makino  National Astronomical Observatory of Japan, Tokyo, Japan
Kei Hiraki  The University of Tokyo, Tokyo, Japan
Mary Inaba  The University of Tokyo, Tokyo, Japan
Sponsors
IEEE-CS\DATC : IEEE Computer Society
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 70,   Citation Count: 1
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1362622.1362647
What is a DOI?

ABSTRACT

We describe the GRAPE-DR (Greatly Reduced Array of Processor Elements with Data Reduction) system, which will consist of 4096 processor chips each with 512 cores operating at the clock frequency of 500 MHz. The peak speed of a processor chip is 512Gflops (single precision) or 256 Gflops (double precision).

The GRAPE-DR chip works as an attached processor to standard PCs. Currently, a PCI-X board with single GRAPE-DR chip is in operation. We are developing a 4-chip board with PCI-Express interface, which will have the peak performance of 1 Tflops. The final system will be a cluster of 512 PCs each with two GRAPE-DR boards. We plan to complete the final system by early 2009.

The application area of GRAPE-DR covers particle-based simulations such as astrophysical many-body simulations and molecular-dynamics simulations, quantum chemistry calculations, various applications which requires dense matrix operations, and many other compute-intensive applications.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J. Barnes and P. Hut. A hiearchical o(nlogn) force calculation algorithm. Nature, 324:446--449, 1986
 
2
W. J. Bouknight, S. A. Denenberg, D. E. Mclntyre, J. M. Randall, A. H. Sameh and D. L. Slotnick, TheąąIlliac IV system, Proc. IEEE, vol. 60, no. 4, April 1972, pp. 369--388
 
3
T. Fukushige, J. Makino, and A. Kawai. GRAPE-6A: A Single-Card GRAPE-6 for Parallel PC-GRAPE Cluster Systems. Publ. Astr. Soc. Japan, 57:1009--1021, Dec. 2005.
 
4
 
5
T. Hamada, T. Fukuishige, and J. Makino. Pgpg: An automatic generator of pipeline design for programmable grape systems. Publ. Astr. Soc. Japan, 57:799--813 2005.
 
6
 
7
T. Nishikawa, M. Inaba, and K. Hiraki. flat-c: An implementation of c language for highly-parallel computers (in Japanese). In Proceedings of SWoPP2005. IPSJ, 2005.
 
8
 
9
D. Sugimoto, Y. Chikada, J. Makino, T. Ito, T. Ebisuzaki, and M. Umemura. A special-purpose computer for gravitational many-body problems. Nature, 345:33--35, 1990.

Collaborative Colleagues:
Junichiro Makino: colleagues
Kei Hiraki: colleagues
Mary Inaba: colleagues