2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC)最新文献_第10页

GROPHECY: GPU performance projection from CPU code skeletons GROPHECY: CPU代码骨架的GPU性能投影

2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC) Pub Date : 2011-11-12 DOI: 10.1145/2063384.2063402

Jiayuan Meng, V. Morozov, Kalyan Kumaran, V. Vishwanath, T. Uram

引用次数: 102

Physis: An implicitly parallel programming model for stencil computations on large-scale GPU-accelerated supercomputers 物理:用于大规模gpu加速超级计算机的模板计算的隐式并行编程模型

2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC) Pub Date : 2011-11-12 DOI: 10.1145/2063384.2063398

N. Maruyama, Tatsuo Nomura, Kento Sato, S. Matsuoka

引用次数: 173

Topology-aware data movement and staging for I/O acceleration on Blue Gene/P supercomputing systems Blue Gene/P超级计算系统I/O加速的拓扑感知数据移动和分级

2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC) Pub Date : 2011-11-12 DOI: 10.1145/2063384.2063409

V. Vishwanath, M. Hereld, V. Morozov, M. Papka

引用次数: 90

Sustained systems performance monitoring at the U.S. Department of Defense High Performance Computing Modernization Program 美国国防部高性能计算现代化项目的持续系统性能监测

2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC) Pub Date : 2011-11-12 DOI: 10.1145/2063348.2063352

P. Bennett

引用次数: 8

Parallel random numbers: As easy as 1, 2, 3 并行随机数:就像1、2、3一样简单

2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC) Pub Date : 2011-11-12 DOI: 10.1145/2063384.2063405

J. Salmon, Mark A. Moraes, R. Dror, D. Shaw

引用次数: 242

GreenSlot: Scheduling energy consumption in green datacenters greenlot:绿色数据中心能耗调度

2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC) Pub Date : 2011-11-12 DOI: 10.1145/2063384.2063411

Íñigo Goiri, Ryan Beauchea, Kien Le, Thu D. Nguyen, Md. E. Haque, Jordi Guitart, J. Torres, R. Bianchini

引用次数: 319

Reducing electricity cost through virtual machine placement in high performance computing clouds 通过在高性能计算云中放置虚拟机来降低电力成本

2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC) Pub Date : 2011-11-12 DOI: 10.1145/2063384.2063413

Kien Le, R. Bianchini, Jingru Zhang, Y. Jaluria, J. Meng, Thu D. Nguyen

引用次数: 221

Challenges of HPC monitoring HPC监控的挑战

2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC) Pub Date : 2011-11-12 DOI: 10.1145/2063348.2063378

W. Allcock, Evan Felix, Mike Lowe, Randal Rheinheimer, Joshi Fullop

{"title":"Challenges of HPC monitoring","authors":"W. Allcock, Evan Felix, Mike Lowe, Randal Rheinheimer, Joshi Fullop","doi":"10.1145/2063348.2063378","DOIUrl":"https://doi.org/10.1145/2063348.2063378","url":null,"abstract":"At a recent meeting of monitoring experts from nine large supercomputing centers, there was a broad divergence of opinion on what monitoring in our environment actually is, what ought to be monitored, what technology should be used, etc. Broad consensus can be summarized in a couple of key points: Data management is increasingly a problem. As a result, historical information is rarely kept, or, if kept, rarely accessed. A proliferation of e-mails is ignored, and slow database interfaces are not used. At least some portion of the HPC Monitoring solution at each site can be summarized as \"Scripts written by smart personnel over the years\". An example is the \"Is this node ready to run?\" script developed essentially in isolation at each site. Given this environment of supercomputing centers trying to solve a seemingly simple, common problem with largely divergent technologies, philosophies, and problem definitions, we feel that a public conversation will be of value to the supercomputing community as a whole. This report outlines the general positions with regard to monitoring of five experienced supercomputing personnel, and is intended to be of benefit to the general community by revealing a variety of opinions on the following topics: What do you understand the monitoring of supercomputing to be? What are the most difficult problems in monitoring today, and which of the problems of five years ago have been put to rest? What areas of supercomputer monitoring are you most focused on at your site? Are there any particularly promising technologies you're using? If you could have the vendor community do one thing in this area, what would it be?","PeriodicalId":358797,"journal":{"name":"2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113997120","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}

引用次数: 12

Scaling lattice QCD beyond 100 GPUs 扩展晶格QCD超过100个gpu

2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC) Pub Date : 2011-09-13 DOI: 10.1145/2063384.2063478

R. Babich, M. Clark, B. Joó, Guochun Shi, R. Brower, S. Gottlieb

引用次数: 134

Parallel breadth-first search on distributed memory systems 分布式存储系统的并行宽度优先搜索

2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC) Pub Date : 2011-04-22 DOI: 10.1145/2063384.2063471

A. Buluç, Kamesh Madduri

{"title":"Parallel breadth-first search on distributed memory systems","authors":"A. Buluç, Kamesh Madduri","doi":"10.1145/2063384.2063471","DOIUrl":"https://doi.org/10.1145/2063384.2063471","url":null,"abstract":"Data-intensive, graph-based computations are pervasive in several scientific applications, and are known to to be quite challenging to implement on distributed memory systems. In this work, we explore the design space of parallel algorithms for Breadth-First Search (BFS), a key subroutine in several graph algorithms. We present two highly-tuned parallel approaches for BFS on large parallel systems: a level-synchronous strategy that relies on a simple vertex-based partitioning of the graph, and a two-dimensional sparse matrix partitioning-based approach that mitigates parallel communication overhead. For both approaches, we also present hybrid versions with intra-node multithreading. Our novel hybrid two-dimensional algorithm reduces communication times by up to a factor of 3.5, relative to a common vertex based approach. Our experimental study identifies execution regimes in which these approaches will be competitive, and we demonstrate extremely high performance on leading distributed-memory parallel systems. For instance, for a 40,000-core parallel execution on Hopper, an AMD MagnyCours based system, we achieve a BFS performance rate of 17.8 billion edge visits per second on an undirected graph of 4.3 billion vertices and 68.7 billion edges with skewed degree distribution.","PeriodicalId":358797,"journal":{"name":"2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128860772","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}

引用次数: 230