2012 International Conference for High Performance Computing, Networking, Storage and Analysis最新文献_第2页

Aspen: A domain specific language for performance modeling Aspen:用于性能建模的领域特定语言

2012 International Conference for High Performance Computing, Networking, Storage and Analysis Pub Date : 2012-11-10 DOI: 10.1109/SC.2012.20

Kyle Spafford, J. Vetter

引用次数: 124

SGI® UV2: A fused computation and data analysis machine SGI®UV2:融合计算和数据分析的机器

2012 International Conference for High Performance Computing, Networking, Storage and Analysis Pub Date : 2012-11-10 DOI: 10.5555/2388996.2389138

Gregory Thorson, M. Woodacre

引用次数: 9

High-performance general solver for extremely large-scale semidefinite programming problems 超大规模半定规划问题的高性能通用求解器

2012 International Conference for High Performance Computing, Networking, Storage and Analysis Pub Date : 2012-11-10 DOI: 10.1109/SC.2012.67

K. Fujisawa, Hitoshi Sato, S. Matsuoka, Toshio Endo, M. Yamashita, Maho Nakata

{"title":"High-performance general solver for extremely large-scale semidefinite programming problems","authors":"K. Fujisawa, Hitoshi Sato, S. Matsuoka, Toshio Endo, M. Yamashita, Maho Nakata","doi":"10.1109/SC.2012.67","DOIUrl":"https://doi.org/10.1109/SC.2012.67","url":null,"abstract":"Semidefinite programming (SDP) is one of the most important problems among optimization problems at present. It is relevant to a wide range of fields such as combinatorial optimization, structural optimization, control theory, economics, quantum chemistry, sensor network location and data mining. The capability to solve extremely large-scale SDP problems will have a significant effect on the current and future applications of SDP. In 1995, Fujisawa et al. started the SDPA(Semidefinite programming algorithm) Project aimed at solving large-scale SDP problems with high numerical stability and accuracy. SDPA is one of the main codes to solve general SDPs. SDPARA is a parallel version of SDPA on multiple processors with distributed memory, and it replaces two major bottleneck parts (the generation of the Schur complement matrix and its Cholesky factorization) of SDPA by their parallel implementation. In particular, it has been successfully applied to combinatorial optimization and truss topology optimization. The new version of SDPARA (7.5.0-G) on a large-scale supercomputer called TSUBAME 2.0 at the Tokyo Institute of Technology has successfully been used to solve the largest SDP problem (which has over 1.48 million constraints), and created a new world record. Our implementation has also achieved 533 TFlops in double precision for large-scale Cholesky factorization using 2,720 CPUs and 4,080 GPUs.","PeriodicalId":217221,"journal":{"name":"2012 International Conference for High Performance Computing, Networking, Storage and Analysis","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115456841","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

Bamboo -- Translating MPI applications to a latency-tolerant, data-driven form Bamboo——将MPI应用程序转换为可容忍延迟的数据驱动形式

2012 International Conference for High Performance Computing, Networking, Storage and Analysis Pub Date : 2012-11-10 DOI: 10.1109/SC.2012.23

T. Nguyen, Pietro Cicotti, E. Bylaska, D. Quinlan, S. Baden

引用次数: 31

A study of DRAM failures in the field 现场DRAM故障的研究

2012 International Conference for High Performance Computing, Networking, Storage and Analysis Pub Date : 2012-11-10 DOI: 10.1109/SC.2012.13

Vilas Sridharan, Dean Liberty

{"title":"A study of DRAM failures in the field","authors":"Vilas Sridharan, Dean Liberty","doi":"10.1109/SC.2012.13","DOIUrl":"https://doi.org/10.1109/SC.2012.13","url":null,"abstract":"Most modern computer systems use dynamic random access memory (DRAM) as a main memory store. Recent publications have confirmed that DRAM errors are a common source of failures in the field. Therefore, further attention to the faults experienced by DRAM sub-systems is warranted. In this paper, we present a study of 11 months of DRAM errors in a large high-performance computing cluster. Our goal is to understand the failure modes, rates, and fault types experienced by DRAM in production settings. We identify several unique DRAM failure modes, including single-bit, multi-bit, and multi-chip failures. We also provide a deterministic bound on the rate of transient faults in the DRAM array, by exploiting the presence of a hardware scrubber on our nodes. We draw several conclusions from our study. First, DRAM failures are dominated by permanent, rather than transient, faults, although not to the extent found by previous publications. Second, DRAMs are susceptible to large multi-bit failures, such as failures that affect an entire DRAM row or column, indicating faults in shared internal circuitry. Third, we identify a DRAM failure mode that disrupts access to other DRAM devices that share the same board-level circuitry. Finally, we find that chipkill error-correcting codes (ECC) are extremely effective, reducing the node failure rate from uncorrected DRAM errors by 42x compared to single-error correct/double-error detect (SEC-DED) ECC.","PeriodicalId":217221,"journal":{"name":"2012 International Conference for High Performance Computing, Networking, Storage and Analysis","volume":"165 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129343780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 251

Data-intensive spatial filtering in large numerical simulation datasets 大型数值模拟数据集的数据密集型空间滤波

2012 International Conference for High Performance Computing, Networking, Storage and Analysis Pub Date : 2012-11-10 DOI: 10.1109/SC.2012.41

Kalin Kanov, R. Burns, G. Eyink, C. Meneveau, A. Szalay

引用次数: 9

Designing a unified programming model for heterogeneous machines 为异构机器设计统一的编程模型

2012 International Conference for High Performance Computing, Networking, Storage and Analysis Pub Date : 2012-11-10 DOI: 10.1109/SC.2012.48

M. Garland, M. Kudlur, Yili Zheng

引用次数: 51

The Universe at extreme scale: Multi-petaflop sky simulation on the BG/Q 极端尺度下的宇宙:BG/Q上的千万亿次天空模拟

2012 International Conference for High Performance Computing, Networking, Storage and Analysis Pub Date : 2012-11-10 DOI: 10.1109/SC.2012.106

S. Habib, V. Morozov, H. Finkel, A. Pope, K. Heitmann, Kalyan Kumaran, T. Peterka, J. Insley, David Daniel, P. Fasel, N. Frontiere, Z. Lukic

{"title":"The Universe at extreme scale: Multi-petaflop sky simulation on the BG/Q","authors":"S. Habib, V. Morozov, H. Finkel, A. Pope, K. Heitmann, Kalyan Kumaran, T. Peterka, J. Insley, David Daniel, P. Fasel, N. Frontiere, Z. Lukic","doi":"10.1109/SC.2012.106","DOIUrl":"https://doi.org/10.1109/SC.2012.106","url":null,"abstract":"Remarkable observational advances have established a compelling cross-validated model of the Universe. Yet, two key pillars of this model -- dark matter and dark energy -- remain mysterious. Next-generation sky surveys will map billions of galaxies to explore the physics of the 'Dark Universe'. Science requirements for these surveys demand simulations at extreme scales; these will be delivered by the HACC (Hybrid/Hardware Accelerated Cosmology Code) framework. HACC's novel algorithmic structure allows tuning across diverse architectures, including accelerated and multi-core systems. On the IBM BG/Q, HACC attains unprecedented scalable performance - currently 6.23 PFlops at 62% of peak and 92% parallel efficiency on 786,432 cores (48 racks) - at extreme problem sizes with up to almost two trillion particles, larger than any cosmological simulation yet performed. HACC simulations at these scales will for the first time enable tracking individual galaxies over the entire volume of a cosmological survey.","PeriodicalId":217221,"journal":{"name":"2012 International Conference for High Performance Computing, Networking, Storage and Analysis","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131753923","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 71

MPI runtime error detection with MUST: Advances in deadlock detection 带MUST的MPI运行时错误检测:死锁检测的进步

2012 International Conference for High Performance Computing, Networking, Storage and Analysis Pub Date : 2012-11-10 DOI: 10.3233/SPR-130368

Tobias Hilbrich, Joachim Protze, M. Schulz, B. Supinski, Matthias S. Müller

引用次数: 77

Legion: Expressing locality and independence with logical regions 军团:用逻辑区域表示局部性和独立性

2012 International Conference for High Performance Computing, Networking, Storage and Analysis Pub Date : 2012-11-10 DOI: 10.1109/SC.2012.71

Michael A. Bauer, Sean Treichler, Elliott Slaughter, A. Aiken

引用次数: 562