High-density computing: A 240-processor beowulf in one cubic meter

Proceedings of the International Conference on Supercomputing

Volumn 2002-November, Issue , 2002, Pages

  Warren, Michael S ^a   Weigle, Eric H ^a   Feng, Wu Chun ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Beowulf; Blade server; Cluster; Code morphing; MIPS per watt; Performance per square foot; RLX; Transmeta; VLIW

Indexed keywords

GRAVITATION; PROGRAM PROCESSORS; VERY LONG INSTRUCTION WORD ARCHITECTURE;

BEOWULF; BLADE SERVERS; CLUSTER; CODE MORPHING; MIPS-PER-WATT; PERFORMANCE; PERFORMANCE-PER-SQUARE-FOOT; RLX; TRANSMETA; VLIW;

CHASSIS;

EID: 46049116582     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SC.2002.10010     Document Type: Conference Paper

References (18)

1. W. Feng, M. S. Warren, and E. Weigle, “Honey, I shrunk the Beowulf!,” in Proceedings of ICPP 2002, 2002.
2. D. J. Becker, T. Sterling, D. Savarese, J. E. Dorband, U. A. Ranawake, and C. V. Packer, “BEOWULF: A parallel workstation for scientific computation,” in Proceedings of the 1995 International Conference on Parallel Processing (ICPP), pp. 11-14, 1995.
3. M. S. Warren, J. K. Salmon, D. J. Becker, M. P. Goda, T. Sterling, and G. S. Winckelmans, “Pentium Pro inside: I. A treecode at 430 Gigaflops on ASCI Red, II. Price/performance of $50/Mflop on Loki and Hyglac,” in Supercomputing'97, (Los Alamitos), IEEE Comp. Soc., 1997.
4. M. S. Warren, T. C. Germann, P. S. Lomdahl, D. M. Beazley, and J. K. Salmon, “Avalon: An Alpha/Linux cluster achieves 10 Gflops for $150k,” in Supercomputing'98, (Los Alamitos), IEEE Comp. Soc., 1998.
5. G. Bell and J. Gray, “High performance computing: Crays, clusters and centers. what next?,” Tech. Rep. MSR-TR-2001-76, Microsoft Research, 2001.
6. J. Barnes and P. Hut, “A hierarchical O(NlogN) force-calculation algorithm,” Nature, vol. 324, p. 446, 1986.
7. L. Greengard and V. Rokhlin, “A fast algorithm for particle simulations,” J. Comp. Phys., vol. 73, pp. 325-348, 1987.
8. M. S. Warren, P. J. Quinn, J. K. Salmon, and W. H. Zurek, “Dark halos formed via dissipationless collapse: I. Shapes and alignment of angular momentum,” Ap. J., vol. 399, pp. 405-425, 1992.
9. W. H. Zurek, P. J. Quinn, J. K. Salmon, and M. S. Warren, “Large scale structure after COBE: Peculiar velocities and correlations of cold dark matter halos,” Ap. J., vol. 431, pp. 559-568, 1994.
10. M. S. Warren and J. K. Salmon, “A portable parallel particle program,” Computer Physics Communications, vol. 87, pp. 266-290, 1995.
11. J. K. Salmon, M. S. Warren, and G. S. Winckelmans, “Fast parallel treecodes for gravitational and fluid dynamical N-body problems,” Intl. J. Supercomputer Appl., vol. 8, pp. 129-142, 1994.
12. G. S. Winckelmans, J. K. Salmon, M. S. Warren, and A. Leonard, “The fast solution of three-dimensional fluid dynamical N-body problems using parallel tree codes: vortex element method and boundary element method,” in Seventh SIAM Conference on Parallel Processing for Scientific Computing, (Philadelphia), pp. 301-306, SIAM, 1995.
13. J. K. Salmon, P. J. Quinn, and M. S. Warren, “Using parallel computers for very large N-body simulations: Shell formation using 180k particles,” in Proceedings of 1989 Heidelberg Conference on Dynamics and Interactions of Galaxies (A. Toomre and R. Wielen, eds.), New York: Springer-Verlag, 1990.
14. M. S. Warren and J. K. Salmon, “Astrophysical N-body simulations using hierarchical tree data structures,” in Supercomputing'92, (Los Alamitos), pp. 570-576, IEEE Comp. Soc., 1992.
15. M. S. Warren and J. K. Salmon, “A parallel hashed oct-tree N-body algorithm,” in Supercomputing'93, (Los Alamitos), pp. 12-21, IEEE Comp. Soc., 1993.
16. J. K. Salmon and M. S. Warren, “Skeletons from the treecode closet,” J. Comp. Phys., vol. 111, pp. 136-155, 1994.
17. A. H. Karp, “Speeding Up N-body Calculations on Machines without Hardware Square Root,” Scientific Programming, vol. 1, pp. 133-140, 1993.
18. C. L. Fryer and M. S. Warren, “Modeling core-collapse supernovae in three dimensions,” Ap. J. (Letters), vol. 574, p. L65, 2002.