- Sponsor:
- sighpc
Welcome to the Proceedings of the ACM/IEEE SC2001 Conference. These proceedings are nearly a direct (albeit more portable) copy of the conference Web site. The final snapshot for this Proceedings CD-ROM was taken on October 8, 2001. All information contained herein was current as of this date.By mirroring our comprehensive Web site in these Proceedings, we hope to provide you with a result which closely follows the numerous activities of this conference, serves as a complete archive of all related technical material, and accurately represents the spirit of SC2001.To view the technical papers you will need to be able to open Portable Document Format (PDF) files. At the time these papers were formatted for this CD-ROM, version 4 of "Acrobat Reader" from Adobe was the most common and effective reader for PDF files. Additionally, much of the material included in these Proceedings requires a JavaScript-capable Web browser to be viewed as intended.On behalf of the SC2001 Conference Committee, it is my sincere hope that you find the contents of these Proceedings useful. I encourage you to send in any comments or suggestions you have regarding this CD-ROM to [email protected]. Directions for obtaining additional copies of these Proceedings can be found on the ordering information page. Thank you for your support of the SCXY Conference series.
Proceeding Downloads
Scalable atomistic simulation algorithms for materials research
- Aiichiro Nakano,
- Rajiv K. Kalia,
- Priya Vashishta,
- Timothy J. Campbell,
- Shuji Ogata,
- Fuyuki Shimojo,
- Subhash Saini
A suite of scalable atomistic simulation programs has been developed for materials research based on space-time multiresolution algorithms. Design and analysis of parallel algorithms are presented for molecular dynamics (MD) simulations and quantum-...
On-the-fly calculation and verification of consistent steering transactions
Interactive Steering can be a valuable tool for understanding and controlling a distributed computation in real-time. With Interactive Steering, the user may change the state of a computation by adjusting application parameters on-the-fly. In our system,...
Global static indexing for real-time exploration of very large regular grids
In this paper we introduce a new indexing scheme for progressive traversal and visualization of large regular grids. We demonstrate the potential of our approach by providing a tool that displays at interactive rates planar slices of scalar field data ...
Efficient network and I/O throttling for fine-grain cycle stealing
This paper proposes and evaluates a new mechanism, rate windows, for I/O and network rate policing. The goal of the proposed system is to provide a simple, yet effective way to enforce resource limits on target classes of jobs in a system. This work was ...
A distributed memory unstructured gauss-seidel algorithm for multigrid smoothers
Gauss-Seidel is a popular multigrid smoother as it is provably optimal on structured grids and exhibits superior performance on unstructured grids. Gauss-Seidel is not used to our knowledge on distributed memory machines as it is not obvious how to ...
Parallel graphics and interactivity with the scaleable graphics engine
A parallel rendering environment is being developed to utilize the IBM Scaleable Graphics Engine (SGE), a hardware frame buffer for parallel computers. Goals of this software development effort include finding efficient ways of producing and displaying ...
Large scale parallel structured AMR calculations using the SAMRAI framework
This paper discusses the design and performance of the parallel data communication infrastructure in SAMRAI, a software framework for structured adaptive mesh refinement (SAMR) multi-physics applications. We describe requirements of such applications ...
The sun fireplane system interconnect
System interconnect is a key determiner of the cost, performance, and reliability of large cache-coherent, shared-memory multiprocessors. Interconnect implementations have to accommodate ever greater numbers of ever faster processors. This paper ...
A parallel java grande benchmark suite
Increasing interest is being shown in the use of Java for large scale or Grande applications. This new use of Java places specific demands on the Java execution environments that can be tested using the Java Grande benchmark suite [5], [6], [7]. The ...
Coastal ocean modeling of the U.S. west coast with multiblock grid and dual-level parallelism
In coastal ocean modeling, a one-block rectangular grid for a large domain has large memory requirements and long processing times. With complicated coastlines, the number of grid points used in the calculation is often the same or smaller than the ...
A case study in application I/O on Linux clusters
A critical but often ignored component of system performance is the I/O system. Today's applications demand a great deal from underlying storage systems and software, and both high-performance distributed storage and high level interfaces have been ...
Applying scheduling and tuning to on-line parallel tomography
Tomography is a popular technique to reconstruct the three-dimensional structure of an object from a series of two-dimensional projections. Tomography is resource-intensive and deployment of a parallel implementation onto Computational Grid platforms ...
Achieving extreme resolution in numerical cosmology using adaptive mesh refinement: resolving primordial star formation
As an entry for the 2001 Gordon Bell Award in the "special" category, we describe our 3-d, hybrid, adaptive mesh refinement (AMR) code Enzo designed for high-resolution, multiphysics, cosmological structure formation simulations. Our parallel ...
Numerical libraries and the grid: the GrADS experiments with ScaLAPACK
- Antoine Petitet,
- Susan Blackford,
- Jack Dongarra,
- Brett Ellis,
- Graham Fagg,
- Kenneth Roche,
- Sathish Vadhiyar
This paper describes an overall framework for the design of numerical libraries on a computational Grid of processors where the processors may be geographically distributed and under the control of a Grid-based scheduling system. A set of experiments ...
Design and implementation of FMPL, a fast message-passing library for remote memory operations
A fast message-passing library FMPL has been designed and developed to maximize communication performance by utilizing general architectural communication support such as remote memory operations, as well as to maximize total performance by eliminating ...
Scaling irregular parallel codes with minimal programming effort
The long foreseen goal of parallel programming models is to scale parallel code without significant programming effort. Irregular parallel applications are a particularly challenging application domain for parallel programming models, since they require ...
MPI-IO/GPFS, an optimized implementation of MPI-IO on top of GPFS
MPI-IO/GPFS is an optimized prototype implementation of the I/O chapter of the Message Passing Interface (MPI) 2 standard. It uses the IBM General Parallel File System (GPFS) Release 3 as the underlying file system. This paper describes optimization ...
Terascale spectral element dynamical core for atmospheric general circulation models
Climate modeling is a grand challenge problem where scientific progress is measured not in terms of the largest problem that can be solved but by the highest achievable integration rate. These models have been notably absent in previous Gordon Bell ...
Stable, globally non-iterative, non-overlapping domain decomposition parallel solvers for parabolic problems
In this paper, we report a class of stabilized explicit-implicit domain decomposition (SEIDD) methods for the parallel solution of parabolic problems, based on the explicit-implicit domain decomposition (EIDD) methods. EIDD methods are globally non-...
Parallel implementation and performance of fastDNAml: a program for maximum likelihood phylogenetic inference
This paper describes the parallel implementation of fastDNAml, a program for the maximum likelihood inference of phylogenetic trees from DNA sequence data. Mathematical means of inferring phylogenetic trees have been made possible by the wealth of DNA ...
Adapting globus and kerberos for a secure ASCI grid
Porting a complex secure application from one security infrastructure to another is often difficult or impractical. Grid security associated with the Globus toolkit is supported by a Grid Security Infrastructure (GSI) based on a Public Key ...
Stochastic search for signal processing algorithm optimization
This paper presents an evolutionary algorithm for searching for the optimal implementations of signal transforms and compares this approach against other search techniques. A single signal processing algorithm can be represented by a very large number ...
Parallel interval-Newton using message passing: dynamic load balancing strategies
Branch-and-prune and branch-and-bound techniques are commonly used for intelligent search in finding all solutions, or the optimal solution, within a space of interest. The corresponding binary tree structure provides a natural parallelism allowing ...
A Jini-based computing portal system
JiPANG(A Jini-based Portal Augmenting Grids) is a portal system and a toolkit which provides uniform access interface layer to a variety of Grid systems, and is built on top of Jini distributed object technology. JiPANG performs uniform higher-level ...
An automatic design optimization tool and its application to computational fluid dynamics
In this paper we describe the Nimrod/O design optimization tool, and its application in computational fluid dynamics. Nimrod/O facilitates the use of an arbitrary computational model to drive an automatic optimization process. This means that the user ...
An 8.61 Tflop/s molecular dynamics simulation for NaCl with a special-purpose computer: MDM
We performed molecular dynamics (MD) simulation of 33 million pairs of NaCl ions with the Ewald summation and obtained a calculation speed of 8.61 Tflop/s. In this calculation we used a special-purpose computer, MDM, which we have developed for the ...
ORT: a communication library for orthogonal processor groups
Many implementations on message-passing machines can benefit from an exploitation of mixed task and data parallelism. A suitable parallel programming model is a group-SPMD model, which requires a structuring of the processors into subsets and a ...
A hypergraph-partitioning approach for coarse-grain decomposition
We propose a new two-phase method for the coarse-grain decomposition of irregular computational domains. This work focuses on the 2D partitioning of sparse matrices for parallel matrix-vector multiplication. However, the proposed model can also be used ...
Parallel dedicated hardware devices for heterogeneous computations
We describe a design methodology which allows a fast design and prototyping of dedicated hardware devices to be used in heterogeneous computations. The platforms used in heterogeneous computations consist of a general-purpose COTS architecture which ...
Optimisation of component-based applications within a grid environment
Effective exploitation of computational grids can only be achieved when applications are fully integrated with the grid middleware and the underlying computational resources. Fundamental to this exploitation is information. Information about the ...
Index Terms
- Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Recommendations
Acceptance Rates
Year | Submitted | Accepted | Rate |
---|---|---|---|
SC '17 | 327 | 61 | 19% |
SC '16 | 442 | 81 | 18% |
SC '15 | 358 | 79 | 22% |
SC '14 | 394 | 83 | 21% |
SC '13 | 449 | 91 | 20% |
SC '12 | 461 | 100 | 22% |
SC '11 | 352 | 74 | 21% |
SC '10 | 253 | 51 | 20% |
SC '09 | 261 | 59 | 23% |
SC '08 | 277 | 59 | 21% |
SC '07 | 268 | 54 | 20% |
SC '06 | 239 | 54 | 23% |
SC '05 | 260 | 62 | 24% |
SC '04 | 200 | 60 | 30% |
SC '03 | 207 | 60 | 29% |
SC '02 | 230 | 67 | 29% |
SC '01 | 240 | 60 | 25% |
SC '00 | 179 | 62 | 35% |
Supercomputing '95 | 241 | 69 | 29% |
Supercomputing '93 | 300 | 72 | 24% |
Supercomputing '92 | 220 | 75 | 34% |
Supercomputing '91 | 215 | 83 | 39% |
Overall | 6,373 | 1,516 | 24% |