| 1. |
- Edmundsson, Niklas, et al.
(författare)
-
Design and Evaluation of a TOP100 Linux Super Cluster System
- 2004
-
Ingår i: Concurrency and Computation: Practice & Experiences. - : John Wiley & Sons, Inc.. - 1532-0634 .- 1532-0626. ; 16:8, s. 735-750
-
Tidskriftsartikel (refereegranskat)abstract
- The High Performance Computing Center North (HPC2N) Super Cluster is a truly self-made high-performance Linux cluster with 240 AMD processors in 120 dual nodes, interconnected with a high-bandwidth, low-latency SCI network. This contribution describes the hardware selected for the system, the work needed to build it, important software issues and an extensive performance analysis. The performance is evaluated using a number of state-of-the-art benchmarks and software, including STREAM, Pallas MPI, the Atlas DGEMM, High-Performance Linpack and NAS Parallel benchmarks. Using these benchmarks we first determine the raw memory bandwidth and network characteristics; the practical peak performance of a single CPU, a single dual-node and the complete 240-processor system; and investigate the parallel performance for non-optimized dusty-deck Fortran applications. In summary, this $500 000 system is extremely cost-effective and shows the performance one would expect of a large-scale supercomputing system with distributed memory architecture. According to the TOP500 list of June 2002, this cluster was the 94th fastest computer in the world. It is now fully operational and stable as the main computing facility at HPC2N. The system’s utilization figures exceed 90%, i.e. all 240 processors are on average utilized over 90% of the time, 24 hours a day, seven days a week.
|
|
| 2. |
- Kessler, Christoph
(författare)
-
Managing distributed shared arrays in a bulk-synchronous parallel programming environment
- 2004
-
Ingår i: Concurrency and Computation. - : Wiley. - 1532-0626 .- 1532-0634. ; 16:02-Mar, s. 133-153
-
Tidskriftsartikel (refereegranskat)abstract
- NestStep is a parallel programming language for the BSP (bulk-hronous parallel) programming model. In this article we describe the concept of distributed shared arrays in NestStep and its implementation on top of MPI. In particular, we present a novel method for runtime scheduling of irregular, direct remote accesses to sections of distributed shared arrays. Our method, which is fully parallelized, uses conventional two-sided message passing and thus avoids the overhead of a standard implementation of direct remote memory access based on one-sided communication. The main prerequisite is that the given program is structured in a BSP-compliant way. Copyright (C) 2004 John Wiley Sons, Ltd.
|
|
