检索结果-内蒙古大学图书馆

PEPPHER: EFFICIENT AND PRODUCTIVE USAGE OF HYBRID COMPUTING SYSTEMS

IEEE MICRO 2011年第5期31卷 28-41页

作者： Benkner, Siegfried Pllana, Sabri Traeff, Jesper Larsson Tsigas, Philippas Dolinsky, Uwe Augonnet, Cedric Bachmayer, Beverly Kessler, Christoph Moloney, David Osipov, Vitaly Univ Vienna Fac Comp Sci Res Grp Sci Comp A-1090 Vienna Austria Chalmers Univ Technol Dept Comp Sci Gothenburg Sweden INRIA Bordeaux Runtime Team Bordeaux France Linkoping Univ Dept Comp & Informat Sci Programming Environm Lab Res Grp Compiler Technol & Parallel Comp S-58183 Linkoping Sweden Karlsruhe Inst Technol Karlsruhe Germany

PEPPHER, a three-year European FP7 project, addresses efficient utilization of hybrid (heterogeneous) computer systems consisting of multicore CPUs with GPU-type accelerators. This article outlines the PEPPHER performance-aware component model, performance prediction means, runtime system, and other aspects of the project. A larger example demonstrates performance portability with the PEPPHER approach across hybrid systems with one to four GPUs. [ABSTRACT FROM PUBLISHER]

关键词： CPU Data structures Energy efficiency GPU Graphics processing unit hybrid computing Hybrid intelligent systems multicore Optimization PEPPHER

来源：评论

学校读者我要写书评

暂无评论

Reuse-Aware Modulo Scheduling for Stream Processors

Reuse-Aware Modulo Scheduling for Stream Processors

引用

Design, Automation and Test in Europe Conference and Exhibition (DATE)

作者： Wang, Li Xue, Jingling Yang, Xuejun NUDT Natl Lab Parallel & Distributed Proc Sch Comp Changsha Hunan Peoples R China UNSW Sch Comp Sci & Engn Programming Languages & Compilers Grp Sydney NSW Australia

ISBN: (纸本)9783981080162

This paper presents reuse-aware modulo scheduling to maximizing stream reuse and improving concurrency for stream-level loops running on stream processors. The novelty lies in the development of a new representation for an unrolled and software-pipelined stream-level loop using a set of reuse equations, resulting in simultaneous optimization of two performance objectives for the loop, reuse and concurrency, in a unified framework. We have implemented this work in the compiler developed for our 64-bit FT64 stream processor. Our experimental results obtained on FT64 and by simulation using nine representative stream applications demonstrate the effectiveness of the proposed approach.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Ismat: a virtual machine for compositional parallelism

引用

COMPUTER SCIENCE-RESEARCH AND DEVELOPMENT 2010年第1-2期25卷 51-56页

作者： Cain, Darryl Roe, Paul Queensland Univ Technol Parallel programming models & parallel composit Brisbane Qld Australia Queensland Univ Technol Fac Sci & Technol Brisbane Qld Australia

parallel programming is hard. Developers must not only solve the problem at hand, but do so in a manner which can best utilize the available resources. In this paper we introduce Ismat, a virtual machine which supports parallelism concerns in an abstracted and inherent manner. Ismat endeavors to simplify the transition from a sequential to parallel environment by providing fundamentally sequential semantics in a parallel realm. Developers incrementally introduce parallelism and performance in contrast to parallelism and correctness. Additionally, Ismat provides and promotes parallel composition to solve problems;reducing developer effort and promoting reuse. We present a detailed explanation of the proposed virtual machine including constructs and semantics. We argue that the resulting virtual machine reduces programmer complexity, provides better abstractions and allows for the exploitation of resources on heterogeneous machines for a range of parallel problems.

关键词： parallel computing Virtual machine Composition Determinism Abstraction

来源：评论

学校读者我要写书评

暂无评论

Optimizing an MPI weather forecasting model via processor virtualization

Optimizing an MPI weather forecasting model via processor vi...

引用

17th International Conference on High Performance Computing, HiPC 2010

作者： Rodrigues, Eduardo R. Navaux, Philippe O. A. Panetta, Jairo Mendes, Celso L. Kalé, Laxmikant V. Institute of Informatics Federal University of Rio Grande do Sul Porto Alegre Brazil Center for Weather Forecasts and Climate Studies INPE Cachoeira Paulista Brazil Parallel Programming Laboratory University of Illinois at Urbana-Champaign Urbana IL United States

ISBN: (纸本)9781424485185

Weather forecasting models are computationally intensive applications. These models are typically executed in parallel machines and a major obstacle for their scalability is load imbalance. The causes of such imbalance are either static (e.g. topography) or dynamic (e.g. shortwave radiation, moving thunderstorms). Various techniques, often embedded in the application's source code, have been used to address both sources. However, these techniques are inflexible and hard to use in legacy codes. In this paper, we demonstrate the effectiveness of processor virtualization for dynamically balancing the load in BRAMS, a mesoscale weather forecasting model based on MPI parallelization. We use the Charm++ infrastructure, with its overdecomposition and object-migration capabilities, to move subdomains across processors during execution of the model. Processor virtualization enables better overlap between computation and communication and improved cache efficiency. Furthermore, by employing an appropriate load balancer, we achieve better processor utilization while requiring minimal changes to the model's code. ©2010 IEEE.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

A new technique for data privatization in user-level threads and its use in parallel applications 10

A new technique for data privatization in user-level threads...

引用

25th Annual ACM Symposium on Applied Computing, SAC 2010

作者： Rodrigues, Eduardo R. Navaux, Philippe O. A. Panetta, Jairo Mendes, Celso L. Institute of Informatics Federal University of Rio Grande Do Sul - UFRGS Porto Alegre Brazil Center for Weather Forecasts and Climate Studies National Institute for Space Research - INPE Cachoeira Paulista Brazil Parallel Programming Laboratory University of Illinois at Urbana-Champaign - UIUC Urbana IL United States

ISBN: (纸本)9781605586380

User-level threads have been used to implement migratable MPI processes. This is a better strategy to implement load balancing mechanisms. That is because, in general, these threads are faster to create, manage and migrate than heavy processes and kernel threads. However, they present some issues concerning private data because they break the private address space that MPI programs typically assume. In this paper, we propose a new approach to privatize data in user-level threads. This approach is based on Thread Local Storage, which is used by kernel threads. We apply this technique to enable MPI processes based on user thread to execute a wider range of parallel programs. We show that this alternative has a more efficient context switch and lower migration cost than other approaches. © 2010 ACM.

关键词： Privatization

来源：评论

学校读者我要写书评

暂无评论

Synchronizing the timestamps of concurrent events in traces of hybrid MPI/OpenMP applications

Synchronizing the timestamps of concurrent events in traces ...

引用

作者： Becker, Daniel Geimer, Markus Rabenseifner, Rolf Wolf, Felix German Research School for Simulation Sciences Laboratory for Parallel Programming 52062 Aachen Germany RWTH Aachen University Department of Computer Science 52056 Aachen Germany Forschungszentrum Jülich Jülich Supercomputing Centre 52428 Jülich Germany University of Stuttgart High Performance Computing-Center 70550 Stuttgart Germany

ISBN: (纸本)9780769542201

Event traces are helpful in understanding the performance behavior of parallel applications since they allow the indepth analysis of communication and synchronization patterns. However, the absence of synchronized clocks on most cluster systems may render the analysis ineffective because inaccurate relative event timings may misrepresent the logical event order and lead to errors when quantifying the impact of certain behaviors or confuse the users of time-line visualization tools by showing messages flowing backward in time. In our earlier work, we have developed a scalable algorithm that eliminates inconsistent inter-process timings postmortem in traces of pure MPI applications. Since hybrid programming, the combination of MPI and OpenMP in a single application, is becoming more popular on clusters in response to rising numbers of cores per chip and widening shared-memory nodes, we present an extended version of the algorithm that in addition to message-passing event semantics also preserves and restores shared-memory event semantics. © 2010 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

A comparative analysis of load balancing algorithms applied to aweather forecast model

A comparative analysis of load balancing algorithms applied ...

引用

IEEE International Symposium on Computer Architecture and High Performance Computing

作者： Rodrigues, Eduardo R. Navaux, Philippe O. A. Panetta, Jairo Fazenda, Alvaro Mendes, Celso L. Kale, Laxmikant V. Institute of Informatics Federal University of Rio Grande do Sul Porto Alegre Brazil Center for Weather Forecast and Climate Studies INPE Cachoeira Paulista Brazil Science and Technology Department Federal University of Sao Paulo Sao Jose dos Campos Brazil Parallel Programming Laboratory University of Illinois at Urbana-Champaign Urbana United States

ISBN: (纸本)9780769542164

Among the many reasons for load imbalance in weather forecasting models, the dynamic imbalance caused by localized variations on the state of the atmosphere is the hardest one to handle. As an example, active thunderstorms may substantially increase load at a certain timestep with respect to previous timesteps in an unpredictable manner - after all, tracking storms is one of the reasons for running a weather forecasting model. In this paper, we present a comparative analysis of different load balancing algorithms to deal with this kind of load imbalance. We analyze the impact of these strategies on computation and communication and the effects caused by the frequency at which the load balancer is invoked on execution time. This is done with-out any code modification, employing the concept of processor virtualization, which basically means that the domain is over-decomposed and the unit of rebalance is a sub-domain. With this approach, we were able to reduce the execution time of a full, real-world weather model. © 2010 IEEE.

关键词： Weather forecasting

来源：评论

学校读者我要写书评

暂无评论

EARLY APPLICATION DEVELOPMENT/TUNING AND APPLICATION CHARACTERIZATION/SEGMENTATION

引用

INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS 2009年第4期23卷 411-412页

作者： Kale, Laxmikant Univ Illinois Siebel Ctr Comp Sci Parallel Programming Lab Urbana IL 61801 USA

This position paper makes two separate, only tangentially related points: 1. A research program is necessary to produce tools and techniques that allow application developers to develop and tune applications for future exascale machines, well before the machines are deployed. 2. In order to cope with, or facilitate, segmentation of exascale architectures, it is necessary to carry out an extensive study characterizing the needs and behaviors of applications that are expected to run on exascale machines.

关键词： emulation exascale machines application characterization early application development simulation

来源：评论

学校读者我要写书评

暂无评论

programming MODELS AT EXASCALE: ADAPTIVE RUNTIME SYSTEMS, INCOMPLETE SIMPLE LANGUAGES, AND INTEROPERABILITY

引用

INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS 2009年第4期23卷 344-346页

作者： Kale, Laxmikant Univ Illinois Siebel Ctr Comp Sci Parallel Programming Lab Urbana IL 61801 USA

Applications running on exascale machines will be complex in many ways. They will involve dynamic and adaptive refinements, and will be composed of multiple, independently developed modules, often involving a multiphysics simulation. The programming models of this era must have several characteristics. First, they need to do away with the notion of processors, and automate resource management via adaptive runtime systems. Data structure-specific frameworks and domain-specific environments will be needed to further simplify programming. More importantly, parallel mini-languages need to be developed, such that each language captures only a restricted subset of possible parallel interactions, but allows for a simple expression of them. Coupled with interoperability and parallel composition, which must be supported in many ways, including message-driven runtime systems, this will create a productive ecosystem of parallel programming models for the exascale era.

关键词： parallel programming models exascale adaptive runtime systems interoperability compositionality

来源：评论

学校读者我要写书评

暂无评论

Synchronizing the Timestamps of Concurrent Events in Traces of Hybrid MPI/OpenMP Applications

Synchronizing the Timestamps of Concurrent Events in Traces ...

引用

IEEE International Conference on Cluster Computing

作者： Daniel Becker Markus Geimer Rolf Rabenseifner Felix Wolf Department of Computer Science RWTH Aachen University Aachen Germany German Research School for Simulation Sciences Laboratory for Parallel Programming Aachen Germany Forschungszentrum Jülich Jülich Supercomputing Centre Jülich Germany University of Stuttgart High Performance Computing-Center Stuttgart Germany

Event traces are helpful in understanding the performance behavior of parallel applications since they allow the in-depth analysis of communication and synchronization patterns. However, the absence of synchronized clocks on most cluster systems may render the analysis ineffective because inaccurate relative event timings may misrepresent the logical event order and lead to errors when quantifying the impact of certain behaviors or confuse the users of time-line visualization tools by showing messages flowing backward in time. In our earlier work, we have developed a scalable algorithm that eliminates inconsistent inter-process timings postmortem in traces of pure MPI applications. Since hybrid programming, the combination of MPI and OpenMP in a single application, is becoming more popular on clusters in response to rising numbers of cores per chip and widening shared-memory nodes, we present an extended version of the algorithm that in addition to message-passing event semantics also preserves and restores shared-memory event semantics.

关键词： Clocks Message systems Semantics Synchronization Algorithm design and analysis Interpolation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：