DOCSLIB.ORG

Download the Full-Text of This Chapter

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Download the Full-Text of This Chapter Index ADVC, 138 BEM-FEM coupling, 5 ADVC code, 164, 165 Benson, M.W., 205 advection-diffusion-reaction, 131 Benzi, M., 205 ADVENTURE, 165, 182, 184 BiCGStab, see stabilized bi-conjugate ADVENTURE project, 138 gradient affine transformation, 231, 235, 237 Blue Gene/L, 20, 167 AIAC, see asynchronous iteration asyn- Bonnet, M., 230 chronous communication boundary conditions, 5, 230 AISM, see approximate inverse with the essential, 248 Sherman-Morrison periodic, 251, 254 Akiba, H., 9, 137 slip, 249 application layer, 125 Burger’s equation, 23 approximate inverse, 204 Burrage, K., 20 approximate inverse with the Sherman- Morrison, 203, 205, 211, 215 CG, see conjugate gradient asynchronous iteration asynchronous CGCG, see coarse grid conjugate gradient communication, 106, 107, 112, Cholesky factorization, 204 113, 122, 125, 126, 130, 134 Cnaga, M.E., 172 asynchronous iteration model, 105 coarse grid, 3, 150, 158, 162, 180 asynchronous methods, 71–73, 76–79 coarse grid conjugate gradient, 10, 137– asynchronous model, 9 170 coarse grid correction, 171 Bahi, J.M., 8, 105 coarse grid problem, 137 balancing domain decomposition, 9–11, coarse grid projection, 4 137, 138, 157, 158, 160–169, coarse propagator, 34 171, 173–175, 177, 179–183, coarse simulation, 27 187, 189, 194, 198 coarse solver, 25 balancing domain decomposition by con- coarse spacial grid, 30 straints, 3 coarsening, 29 bandwidth, 72 communication layer, 125 Bavestrello, H., 174 complexity, 24, 39 BDD, see domain decomposition balanc- complexity analysis, 26 ing compressed row storage, 256, 258 BDDC, see balancing domain decomposi- congruent subdomains, 229, 236, 237, tion by constraints 255 267 268 Substructuring Techniques and Domain Decompostion Methods conjugate gradient, 10, 127, 128, 130 Fagakis, Y., 175 conjugate gradient method, 148 Farhat, C., 9, 174, 180 conjugate projected gradient method, 148, fault tolerant, 71 149, 161, 171 FETI, see finite element tearing and inter- contact, 5, 190, 197 connecting convergence, 101 finite element, 2, 138, 171, 229, 231 analysis, 27, 79 vector-valued, 234 condition, 83 finite element tearing and interconnecting, detection, 96, 112 3, 4, 9, 10, 138, 139, 168, 173– global, 97 175 local, 96 finite element tearing and interconnecting properties, 27 - dual primal, 174 Courant-Friedrichs-Lewy, 31 Frobenius norm, 205 Couturier, R., 8, 105 Fujitsu GP7000F, 264 CPG, see conjugate projected gradient method Gander, M., 21 CSR, see compressed row storage Gander, M.J., 48 Gauss Seidel method, 48, 73 daemon, 123 generalised minimal residual method, De Roeck, Y.-H., 180 203–205, 214, 217, 218, 221, 223 deadlock, 125 generalised minimal residuals, 12 decomposer, 3 GMRES, see generalised minimal resid- see decomposition congruent, 255 uals, generalised minimal residual method decoupled parametric systems, 51 greedy algorithm, 12, 204–207 Dirichlet boundary conditions, 179, 230 grid computing, 7, 105 discrete harmonic expansion, 144 grid environment, 134 distributed algorithms, 45 Grid’5000, 107, 126, 128, 133, 134 distributed computing, 7, 71 Grid’5000 architecture, 9 divide and conquer, 2 G´eradin, M., 180 domain decomposition, 2, 137, 173–202, 229 Hackbush, W., 21 balancing, 3 harmonic analysis, 4 overlapping, 33 heterogeneous problems, 4 Dryja, M., 180 dual-primal, 5 I/O functions, 184 dual-primal FETI, 10 IBM Blue Gene/L, 137, 166 dynamic substructuring, 2, 3 interface conditions, 3 interface nodes, 179 Earth Simulator, 175 interface problem, 2, 177 efficiency, 231 inverse preconditioners, 11, 204 elliptic problems, 6 iterative algorithms, 107 Euler’s method, 7 iterative coefficient, 60 European Option example, 57 iterative methods, 71 eXtended finite element method, 5 iterative solvers, 2, 32, 113, 229 Index 269 iterative substructuring method, 137, 138, meta-cluster, 106, 109–111, 130, 134 149 Metis, 183, 197 minimum residual scheme, 203–205, 210, JACE, 8, 9, see Java asynchronous com- 211, 215, 217, 218, 221, 223, 225 puting environment Miranker, W.L., 47 JACK library, 8, 71, 93 Miyamura, T., 5, 10, 171 Jacobi iterative, 48 model reduction, 29 Jacobi method, 8, 73, 75 Montero, G., 205 Java, 8, 105, 128 Moriya, K., 11, 203, 205 Java asynchronous computing environ- mortar interfaces, 5 ment, 105, 107, 122–125, 128 MPC, see multi-point constraints Klawonn, A., 175 MPI Library, 8, 93, 94 Krylov solvers, 204 MTBF, see mean time between failure Krylov subspace, 203, 231 multi-models, 4 Krylov subspace methods, 12 multi-physics, 4 Krylov subspace solvers, 204 multi-point constraints, 5, 10 multi-splitting algorithm, 8, 9 Lagrange multiplier, 11 multi-step methods, 7 Lagrangian method, 173 multigrid, 4, 21 Lai, C.-H., 7, 45 multipoint constraint, 171–174, 176, 177, Laiymani, D., 8, 105 179, 181, 183–185, 187, 189, Lapalace equation, 144 194, 197, 198 Laplace transform, 46, 50, 53, 61, 63, 64 multipoint constraints, 180 large scale analysis, 137 multishooting technique, 21 latency, 72, 95 multisplitting algorithms, 105, 113 Le Tallec, P., 180 multisplitting Newton algorithm, 121, 131 Lelarasmee, E., 21 Linger, W., 47 Nakajima, K., 173 LINPACK benchmark, 166 NAS benchmark, 9 Lions, J.-L., 6, 19, 47 NAS parallel benchmark, 126, 127 local cluster, 108 Navier equations, 13, 235 local solver, 3 Neuman condition, 145 local space, 153 Neumann method, 155 LU decomposition, 148 Neumann preconditioner, 137, 161 LU preconditioner, 204 Neumann-Neumann preconditioner, 180 lump-scaling, 4 Newton iteration, 12 Maday, Y., 6, 19, 47 Newton method, 215 Magoul`es, F., 1, 8, 71 Newton scheme, 205, 215, 217 Mandel, J., 9 Newton’s linearisation, 61 master DOFs, 173 Newton’s method, 63 master-slave method, 173 Nikishn, A.A., 205 matrix-vector multiplication, 254 NIO protocol, 125 mean time between failure, 72 Nodera, T., 11, 203 message passing, 106 nonlinear parabolic problem, 54 270 Substructuring Techniques and Domain Decompostion Methods nonlinear problems, 7 coarse, 34 fine, 34 O’Leary, D.P., 114, 115 propagators, 28 Ogino, M., 180 OpenMP library, 13, 230, 231, 262, 264 reduced system, 204, 214 optimal control, 7 remote method invocation, 125 order reduction, 2 rigid body motion, 10 ordinary differential equations, 19 Rixen, D., 1, 174 orthogonal decomposition, 145, 147, 162 Ruehli, A.E., 21 orthogonal projection, 229, 248, 251, 254 Runge Kutta methods, 7 orthogonal transformation, 229, 231, 240 Runge-Kutta methods, 20 P-FETI method, see primal substructuring Saad, Y., 204, 205 Papadrakakis, M., 175 Saint-Georges, S., 172 parallel algorithms, 45 Sangiovanni-Vincentelli, A.L., 21 parallel architectures, 108 scalability, 21 parallel computing, 71, 171 scaling techniques, 4 parallel machines, 108 Schnabel, R.B., 204 parallel processing, 137 Schultz, M.H., 204 parallel structural analysis, 138 Schur parallelism efficiency, 24, 39 complement, 2, 12, 148, 180, 203– parareal, 19–44, 47 205, 207, 214, 217, 223 Parmetis, 197 dual, 4 partial differential equations, 19 primal, 4 PC cluster, 11, 12, 204 Schwarz iteration, 2 PCPG, see preconditioned conjugate pro- Schwarz method, 2, 137–139, 143, 144, jected gradient method 148, 149, 152, 155, 156, 161, penalty method, 173 164, 168 periodicity, 230 Sherman-Morrison formula, 205 Perron-Frobenius theorem, 80 Shioya, R., 175 Picard-Lindel¨of iteration, 48 SIAC, see synchronous iterations- Poisson equation, 144, 230 asynchronous communications Poisson problem, 8 similarity transformation methods, 51 poro-elastic models, 5 similarity transforms, 49 preconditioned conjugate projected gradi- Simonicini, V., 204 ent method, 178 SISC, see synchronous iterations- preconditioner, 3–5, 171, 204, 205 synchronous communications preconditioning, 173, 204 slave DOFs, 173 predictor, 6 sparseness, 148 predictor corrector approach, 19 sparsity, 204 primal substructuring, 173, 175 spawner, 124 programming environment, 92 SPOOLES, 182 project gradient methods, 172 stability, 40 projections, 3 stabilized bi-conjugate gradient, 12 propagator, 27 Stokes problem, 4 Index 271 structural analysis, 138 subdomains non-overlapping, 3, 237 overlapping, 3 transformed, 230 substructuring, 3 asynchronous, 84 iterative, 139–143 methods, 71–104 synchronous, 84 Suzuki, A., 12, 229 synchronous communications, 106 synchronous iteration, 105 synchronous iterations-synchronous com- munications, 111 synchronous methods, 73, 75–77 synchronous model, 9 Szyld, D.B., 204 Tabata, M., 12, 229 temporal domain, 7 temporal integration, 45, 47 time-marching scheme, 46 TOP500, 166 transformation methods, 7, 45, 46, 48 transient problems, 7 Turinici, G., 6, 19, 47 user application, 125 Uzawa iteration, 4 Vanderwalle, S., 21 Vandewall, S., 48 Venet,C.,8,71 virtual control, 35 viscosity, 23 waveform relaxation method, 134 weak formulations, 246 White, R.E., 114, 115 Widlund, O.B., 175, 180 worker, 124 Zhang, L., 11, 203 Zienkiewicz, O.C., 230 mmx .
Load more

Recommended publications
  • The Reliability Wall for Exascale Supercomputing Xuejun Yang, Member, IEEE, Zhiyuan Wang, Jingling Xue, Senior Member, IEEE, and Yun Zhou
    . IEEE TRANSACTIONS ON COMPUTERS, VOL. *, NO. *, * * 1 The Reliability Wall for Exascale Supercomputing Xuejun Yang, Member, IEEE, Zhiyuan Wang, Jingling Xue, Senior Member, IEEE, and Yun Zhou Abstract—Reliability is a key challenge to be understood to turn the vision of exascale supercomputing into reality. Inevitably, large-scale supercomputing systems, especially those at the peta/exascale levels, must tolerate failures, by incorporating fault- tolerance mechanisms to improve their reliability and availability. As the benefits of fault-tolerance mechanisms rarely come without associated time and/or capital costs, reliability will limit the scalability of parallel applications. This paper introduces for the first time the concept of “Reliability Wall” to highlight the significance of achieving scalable performance in peta/exascale supercomputing with fault tolerance. We quantify the effects of reliability on scalability, by proposing a reliability speedup, defining quantitatively the reliability wall, giving an existence theorem for the reliability wall, and categorizing a given system according to the time overhead incurred by fault tolerance. We also generalize these results into a general reliability speedup/wall framework by considering not only speedup but also costup. We analyze and extrapolate the existence of the reliability wall using two representative supercomputers, Intrepid and ASCI White, both employing checkpointing for fault tolerance, and have also studied the general reliability wall using Intrepid. These case studies provide insights on how to mitigate reliability-wall effects in system design and through hardware/software optimizations in peta/exascale supercomputing. Index Terms—fault tolerance, exascale, performance metric, reliability speedup, reliability wall, checkpointing. ! 1INTRODUCTION a revolution in computing at a greatly accelerated pace [2].
    [Show full text]
  • LLNL Computation Directorate Annual Report (2014)
    PRODUCTION TEAM LLNL Associate Director for Computation Dona L. Crawford Deputy Associate Directors James Brase, Trish Damkroger, John Grosh, and Michel McCoy Scientific Editors John Westlund and Ming Jiang Art Director Amy Henke Production Editor Deanna Willis Writers Andrea Baron, Rose Hansen, Caryn Meissner, Linda Null, Michelle Rubin, and Deanna Willis Proofreader Rose Hansen Photographer Lee Baker LLNL-TR-668095 3D Designer Prepared by LLNL under Contract DE-AC52-07NA27344. Ryan Chen This document was prepared as an account of work sponsored by an agency of the United States government. Neither the United States government nor Lawrence Livermore National Security, LLC, nor any of their employees makes any warranty, expressed or implied, or assumes any legal liability or responsibility for the accuracy, completeness, or usefulness of any information, apparatus, product, or process disclosed, or represents that its use would not infringe privately owned rights. Reference herein to any specific commercial product, process, or service by trade name, trademark, Print Production manufacturer, or otherwise does not necessarily constitute or imply its endorsement, recommendation, or favoring by the United States government or Lawrence Livermore National Security, LLC. The views and opinions of authors expressed herein do not necessarily state or reflect those of the Charlie Arteago, Jr., and Monarch Print Copy and Design Solutions United States government or Lawrence Livermore National Security, LLC, and shall not be used for advertising or product endorsement purposes. CONTENTS Message from the Associate Director . 2 An Award-Winning Organization . 4 CORAL Contract Awarded and Nonrecurring Engineering Begins . 6 Preparing Codes for a Technology Transition . 8 Flux: A Framework for Resource Management .
    [Show full text]
  • Biomolecular Simulation Data Management In
    BIOMOLECULAR SIMULATION DATA MANAGEMENT IN HETEROGENEOUS ENVIRONMENTS Julien Charles Victor Thibault A dissertation submitted to the faculty of The University of Utah in partial fulfillment of the requirements for the degree of Doctor of Philosophy Department of Biomedical Informatics The University of Utah December 2014 Copyright © Julien Charles Victor Thibault 2014 All Rights Reserved The University of Utah Graduate School STATEMENT OF DISSERTATION APPROVAL The dissertation of Julien Charles Victor Thibault has been approved by the following supervisory committee members: Julio Cesar Facelli , Chair 4/2/2014___ Date Approved Thomas E. Cheatham , Member 3/31/2014___ Date Approved Karen Eilbeck , Member 4/3/2014___ Date Approved Lewis J. Frey _ , Member 4/2/2014___ Date Approved Scott P. Narus , Member 4/4/2014___ Date Approved And by Wendy W. Chapman , Chair of the Department of Biomedical Informatics and by David B. Kieda, Dean of The Graduate School. ABSTRACT Over 40 years ago, the first computer simulation of a protein was reported: the atomic motions of a 58 amino acid protein were simulated for few picoseconds. With today’s supercomputers, simulations of large biomolecular systems with hundreds of thousands of atoms can reach biologically significant timescales. Through dynamics information biomolecular simulations can provide new insights into molecular structure and function to support the development of new drugs or therapies. While the recent advances in high-performance computing hardware and computational methods have enabled scientists to run longer simulations, they also created new challenges for data management. Investigators need to use local and national resources to run these simulations and store their output, which can reach terabytes of data on disk.
    [Show full text]
  • Measuring Power Consumption on IBM Blue Gene/P
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Springer - Publisher Connector Comput Sci Res Dev DOI 10.1007/s00450-011-0192-y SPECIAL ISSUE PAPER Measuring power consumption on IBM Blue Gene/P Michael Hennecke · Wolfgang Frings · Willi Homberg · Anke Zitz · Michael Knobloch · Hans Böttiger © The Author(s) 2011. This article is published with open access at Springerlink.com Abstract Energy efficiency is a key design principle of the Top10 supercomputers on the November 2010 Top500 list IBM Blue Gene series of supercomputers, and Blue Gene [1] alone (which coincidentally are also the 10 systems with systems have consistently gained top GFlops/Watt rankings an Rpeak of at least one PFlops) are consuming a total power on the Green500 list. The Blue Gene hardware and man- of 33.4 MW [2]. These levels of power consumption are al- agement software provide built-in features to monitor power ready a concern for today’s Petascale supercomputers (with consumption at all levels of the machine’s power distribu- operational expenses becoming comparable to the capital tion network. This paper presents the Blue Gene/P power expenses for procuring the machine), and addressing the measurement infrastructure and discusses the operational energy challenge clearly is one of the key issues when ap- aspects of using this infrastructure on Petascale machines. proaching Exascale. We also describe the integration of Blue Gene power moni- While the Flops/Watt metric is useful, its emphasis on toring capabilities into system-level tools like LLview, and LINPACK performance and thus computational load ne- highlight some results of analyzing the production workload glects the fact that the energy costs of memory references at Research Center Jülich (FZJ).
    [Show full text]
  • Blue Gene®/Q Overview and Update
    Blue Gene®/Q Overview and Update November 2011 Agenda Hardware Architecture George Chiu Packaging & Cooling Paul Coteus Software Architecture Robert Wisniewski Applications & Configurations Jim Sexton IBM System Technology Group Blue Gene/Q 32 Node Board Industrial Design BQC DD2.0 4-rack system 5D torus 3 © 2011 IBM Corporation IBM System Technology Group Top 10 reasons that you need Blue Gene/Q 1. Ultra-scalability for breakthrough science – System can scale to 256 racks and beyond (>262,144 nodes) – Cluster: typically a few racks (512-1024 nodes) or less. 2. Highest capability machine in the world (20-100PF+ peak) 3. Superior reliability: Run an application across the whole machine, low maintenance 4. Highest power efficiency, smallest footprint, lowest TCO (Total Cost of Ownership) 5. Low latency, high bandwidth inter-processor communication system 6. Low latency, high bandwidth memory system 7. Open source and standards-based programming environment – Red Hat Linux distribution on service, front end, and I/O nodes – Lightweight Compute Node Kernel (CNK) on compute nodes ensures scaling with no OS jitter, enables reproducible runtime results – Automatic SIMD (Single-Instruction Multiple-Data) FPU exploitation enabled by IBM XL (Fortran, C, C++) compilers – PAMI (Parallel Active Messaging Interface) runtime layer. Runs across IBM HPC platforms 8. Software architecture extends application reach – Generalized communication runtime layer allows flexibility of programming model – Familiar Linux execution environment with support for most
    [Show full text]
  • TMA4280—Introduction to Supercomputing
    Supercomputing TMA4280—Introduction to Supercomputing NTNU, IMF January 12. 2018 1 Outline Context: Challenges in Computational Science and Engineering Examples: Simulation of turbulent flows and other applications Goal and means: parallel performance improvement Overview of supercomputing systems Conclusion 2 Computational Science and Engineering (CSE) What is the motivation for Supercomputing? Solve complex problems fast and accurately: — efforts in modelling and simulation push sciences and engineering applications forward, — computational requirements drive the development of new hardware and software. 3 Computational Science and Engineering (CSE) Development of computational methods for scientific research and innovation in engineering and technology. Covers the entire spectrum of natural sciences, mathematics, informatics: — Scientific model (Physics, Biology, Medical, . ) — Mathematical model — Numerical model — Implementation — Visualization, Post-processing — Validation ! Feedback: virtuous circle Allows for larger and more realistic problems to be simulated, new theories to be experimented numerically. 4 Outcome in Industrial Applications Figure: 2004: “The Falcon 7X becomes the first aircraft in industry history to be entirely developed in a virtual environment, from design to manufacturing to maintenance.” Dassault Systèmes 5 Evolution of computational power Figure: Moore’s Law: exponential increase of number of transistors per chip, 1-year rate (1965), 2-year rate (1975). WikiMedia, CC-BY-SA-3.0 6 Evolution of computational power
    [Show full text]
  • Introduction to the Practical Aspects of Programming for IBM Blue Gene/P
    Introduction to the Practical Aspects of Programming for IBM Blue Gene/P Alexander Pozdneev Research Software Engineer, IBM June 22, 2015 — International Summer Supercomputing Academy IBM Science and Technology Center Established in 2006 • Research projects I HPC simulations I Security I Oil and gas applications • ESSL math library for IBM POWER • IBM z Systems mainframes I Firmware I Linux on z Systems I Software • IBM Rational software • Smarter Commerce for Retail • Smarter Cities 2 c 2015 IBM Corporation Outline 1 Blue Gene architecture in the HPC world 2 Blue Gene/P architecture 3 Conclusion 4 References 3 c 2015 IBM Corporation Outline 1 Blue Gene architecture in the HPC world Brief history of Blue Gene architecture Blue Gene in TOP500 Blue Gene in Graph500 Scientific applications Gordon Bell awards Blue Gene installation sites 2 Blue Gene/P architecture 3 Conclusion 4 References 4 c 2015 IBM Corporation Brief history of Blue Gene architecture • 1999 US$100M research initiative, novel massively parallel architecture, protein folding • 2003, Nov Blue Gene/L first prototype TOP500, #73 • 2004, Nov 16 Blue Gene/L racks at LLNL TOP500, #1 • 2007 Second generation Blue Gene/P • 2009 National Medal of Technology and Innovation • 2012 Third generation Blue Gene/Q • Features: I Low frequency, low power consumption I Fast interconnect balanced with CPU I Light-weight OS 5 c 2015 IBM Corporation Blue Gene in TOP500 Date # System Model Nodes Cores Jun’14 / Nov’14 3 Sequoia Q 96k 1.5M Jun’13 / Nov’13 3 Sequoia Q 96k 1.5M Nov’12 2 Sequoia
    [Show full text]
  • The Blue Gene/Q Compute Chip
    The Blue Gene/Q Compute Chip Ruud Haring / IBM BlueGene Team © 2011 IBM Corporation Acknowledgements The IBM Blue Gene/Q development teams are located in – Yorktown Heights NY, – Rochester MN, – Hopewell Jct NY, – Burlington VT, – Austin TX, – Bromont QC, – Toronto ON, – San Jose CA, – Boeblingen (FRG), – Haifa (Israel), –Hursley (UK). Columbia University . University of Edinburgh . The Blue Gene/Q project has been supported and partially funded by Argonne National Laboratory and the Lawrence Livermore National Laboratory on behalf of the United States Department of Energy, under Lawrence Livermore National Laboratory Subcontract No. B554331 2 03 Sep 2012 © 2012 IBM Corporation Blue Gene/Q . Blue Gene/Q is the third generation of IBM’s Blue Gene family of supercomputers – Blue Gene/L was announced in 2004 – Blue Gene/P was announced in 2007 . Blue Gene/Q – was announced in 2011 – is currently the fastest supercomputer in the world • June 2012 Top500: #1,3,7,8, … 15 machines in top100 (+ 101-103) – is currently the most power efficient supercomputer architecture in the world • June 2012 Green500: top 20 places – also shines at data-intensive computing • June 2012 Graph500: top 2 places -- by a 7x margin – is relatively easy to program -- for a massively parallel computer – and its FLOPS are actually usable •this is not a GPGPU design … – incorporates innovations that enhance multi-core / multi-threaded computing • in-memory atomic operations •1st commercial processor to support hardware transactional memory / speculative execution •… – is just a cool chip (and system) design • pushing state-of-the-art ASIC design where it counts • innovative power and cooling 3 03 Sep 2012 © 2012 IBM Corporation Blue Gene system objectives .
    [Show full text]
  • R00456--FM Getting up to Speed
    GETTING UP TO SPEED THE FUTURE OF SUPERCOMPUTING Susan L. Graham, Marc Snir, and Cynthia A. Patterson, Editors Committee on the Future of Supercomputing Computer Science and Telecommunications Board Division on Engineering and Physical Sciences THE NATIONAL ACADEMIES PRESS Washington, D.C. www.nap.edu THE NATIONAL ACADEMIES PRESS 500 Fifth Street, N.W. Washington, DC 20001 NOTICE: The project that is the subject of this report was approved by the Gov- erning Board of the National Research Council, whose members are drawn from the councils of the National Academy of Sciences, the National Academy of Engi- neering, and the Institute of Medicine. The members of the committee responsible for the report were chosen for their special competences and with regard for ap- propriate balance. Support for this project was provided by the Department of Energy under Spon- sor Award No. DE-AT01-03NA00106. Any opinions, findings, conclusions, or recommendations expressed in this publication are those of the authors and do not necessarily reflect the views of the organizations that provided support for the project. International Standard Book Number 0-309-09502-6 (Book) International Standard Book Number 0-309-54679-6 (PDF) Library of Congress Catalog Card Number 2004118086 Cover designed by Jennifer Bishop. Cover images (clockwise from top right, front to back) 1. Exploding star. Scientific Discovery through Advanced Computing (SciDAC) Center for Supernova Research, U.S. Department of Energy, Office of Science. 2. Hurricane Frances, September 5, 2004, taken by GOES-12 satellite, 1 km visible imagery. U.S. National Oceanographic and Atmospheric Administration. 3. Large-eddy simulation of a Rayleigh-Taylor instability run on the Lawrence Livermore National Laboratory MCR Linux cluster in July 2003.
    [Show full text]
  • IBM Research Report Designing a Highly-Scalable Operating System
    RC24037 (W0608-087) August 28, 2006 Computer Science IBM Research Report Designing a Highly-Scalable Operating System: The Blue Gene/L Story José Moreira1, Michael Brutman2, José Castaños1, Thomas Engelsiepen3, Mark Giampapa1, Tom Gooding2, Roger Haskin3, Todd Inglett2, Derek Lieber1, Pat McCarthy2, Mike Mundy2, Jeff Parker2, Brian Wallenfelt4 1IBM Research Division Thomas J. Watson Research Center P.O. Box 218 Yorktown Heights, NY 10598 2IBM Systems and Technology Group Rochester, MN 55901 3IBM Research Division Almaden Research Center 650 Harry Road San Jose, CA 95120-6099 4GeoDigm Corporation Chanhassen, MN 55317 Research Division Almaden - Austin - Beijing - Haifa - India - T. J. Watson - Tokyo - Zurich LIMITED DISTRIBUTION NOTICE: This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g. , payment of royalties). Copies may be requested from IBM T. J. Watson Research Center , P. O. Box 218, Yorktown Heights, NY 10598 USA (email: [email protected]). Some reports are available on the internet at http://domino.watson.ibm.com/library/CyberDig.nsf/home . Designing a Highly-Scalable Operating System: The Blue Gene/L Story José Moreira*, Michael Brutman**, José Castaños*, Thomas Engelsiepen***, Mark Giampapa*, Tom Gooding**, Roger Haskin***, Todd Inglett**, Derek Lieber*, Pat McCarthy**, Mike Mundy**, Jeff Parker**, Brian Wallenfelt**** *{jmoreira,castanos,giampapa,lieber}@us.ibm.com ***{engelspn,roger}@almaden.ibm.com IBM Thomas J.
    [Show full text]
  • CFD) Applications on HPC Systems
    Performance Portability Strategies for Computational Fluid Dynamics (CFD) Applications on HPC Systems A DISSERTATION SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY Pei-Hung Lin IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF Doctor of Philosophy Professor Pen-Chung Yew, Advisor Professor Paul R. Woodward, Co-Advisor June, 2013 c Pei-Hung Lin 2013 ALL RIGHTS RESERVED Acknowledgements First and foremost, I would like to thank my advisors, professor Paul R. Woodward and professor Pen-Chung Yew for their guidance in my doctoral program. Professor Woodward continuously inspired and encouraged me to pursue my research career. Professor Yew with his solid background in architecture and compiler guided me and taught me in academic research. They selflessly advised me conducting researches and shared their experiences in research, in work, and also in their lives. I also would like to thank my thesis committee members { professor Antonia Zhai and professor Eric Van Wyk for their insight and efforts in reviewing my dissertation. Furthermore, I would like to thank my colleagues and mentors in my graduate study. Dr. Dan Quinlan, and Dr. Chunhua Liao provided me the internship opportunities to work at Lawrence Livermore National Laboratory and will continue to support me in my post-doctoral career. Dr. Jagan Jayaraj (now at Sandia National Laboratory) and Michael Knox were my long-term colleagues in both study and work and we exchanged lots ideas in achieving our research goal. Dr. Ben Bergen and Dr. William Dai at Los Alamos National Laboratory provided me strong support and great assistant during my internship at LANL.
    [Show full text]
  • 2011 INCITE Awards Type: Renewal Title
    Type: Renewal Title: ―Ab Initio Dynamical Simulations for the Prediction of Bulk Properties‖ Principal Investigator: Theresa Windus, Iowa State University Co-Investigators: Brett Bode, Iowa State University Graham Fletcher, Argonne National Laboratory Mark Gordon, Iowa State University Monica Lamm, Iowa State University Michael Schmidt, Iowa State University Scientific Discipline: Chemistry: Physical INCITE Allocation: 10,000,000 processor hours Site: Argonne National Laboratory Machine (Allocation): IBM Blue Gene/P (10,000,000 processor hours) Research Summary: This project uses high-quality electronic structure theory, statistical mechanical methods, and massively parallel computers to address the prediction of bulk properties of water systems that require high fidelity. These molecular-scale problems are of critical importance to national priority scientific issues such as global warming, the environment, and alternative fuels. Many critical problems in the chemical sciences are so computationally demanding that the only perceived option for addressing them is to employ low-level methods whose reliability is suspect. The electronic structure community already has well-established protocols for assessing the reliability of methods applied to small and medium systems, but this project will address extended systems whose sizes require the use of massive computational resources. Driving the need for petascale computing in this community are a vast array of problems, ranging from simulations of liquids with unquestionable accuracy to studies of reaction mechanisms in the condensed phase to ground and excited state studies of polymers, biomolecules, and other extended systems. This work is focusing on understanding the molecular level dynamics of water, the formation of aerosols important in cloud formation, and the interactions of dendrimers with ligands of environmental importance.
    [Show full text]