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

Compiling High Performance Fortran for distributed-memory architectures

PARALLEL COMPUTING 1999年第13-14期25卷 1785-1825页

作者： Benkner, S Zima, H NEC Europe Ltd C&C Res Labs D-53757 St Augustin Germany Univ Vienna Inst Software Technol & Parallel Syst A-1090 Vienna Austria

High Performance Fortran (HPF) is a data-parallel language that provides a high-level interface for programming scientific applications, while delegating to the compiler the task of generating explicitly parallel message-passing programs. This paper provides an overview of HPF compilation and runtime technology for distributed-memory architectures, and deals with a number of topics in some detail. In particular, we discuss distribution and alignment processing, the basic compilation scheme and methods for the optimization of regular computations. A separate section is devoted to the transformation and optimization of independent loops with irregular data accesses. The paper concludes with a discussion of research issues and outlines potential future development paths of the language. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： High Performance Fortran (HPF) parallel programming parallelization code generation irregular problems distributed-memory architectures

来源：评论

学校读者我要写书评

暂无评论

DEPENDABILITY MODELING FOR MULTIPROCESSORS

引用

COMPUTER 1990年第10期23卷 7-19页

作者： DAS, CR KREULEN, JT THAZHUTHAVEETIL, MJ BHUYAN, LN TEXAS A&M UNIV SYST COMP SCICOLLEGE STNTX 77843

A tutorial on dependability and performance-related dependability models for multiprocessors is presented. Multiprocessors are classified as having shared-memory or distributed-memory architectures, and some fundamental dependability modeling concepts. Reliability models based on four types of reliability evaluation techniques (terminal, multiterminal, task-based, and network reliability) are examined. The status of research efforts on performance-related dependability is discussed, and the models' effectiveness is illustrated with a few numerical examples. A brief survey of software packages for dependability computation in included

关键词： dependability modelling distributed-memory architectures fault tolerant computing multiprocessing systems multiprocessors performance evaluation reliability evaluation shared-memory software packages

来源：评论

学校读者我要写书评

暂无评论

High Performance Fortran: History, status and future

引用

PARALLEL COMPUTING 1998年第3-4期24卷 325-354页

作者： Mehrotra, P Van Rosendale, J Zima, H NASA Langley Res Ctr ICASE Hampton VA 23681 USA Univ Vienna Inst Software Technol & Parallel Syst A-1090 Vienna Austria

High Performance Fortran (HPF) is a data-parallel language that was designed to provide the user with a high-level interface for programming scientific applications, while delegating to the compiler the task of generating an explicitly parallel message-passing program. The main objective of this paper is to study the expressivity of the language and related performance issues. After giving an outline of developments that led to HPF and shortly explaining its major features, we discuss in detail a variety of approaches for solving multiblock problems and applications dealing with unstructured meshes. We argue that the efficient solution of these problems does not only need the full range of the HPF Approved Extensions, but also requires additional features such as the explicit control of communication schedules and support for value-based alignment. The final part of the paper points out some classes of problems that are difficult to deal with efficiently within the HPF paradigm. (C) 1998 Elsevier Science B.V. All rights reserved.

关键词： data parallelism data distribution distributed-memory architectures High Performance Fortran irregular problems

来源：评论

学校读者我要写书评

暂无评论

Processor mapping techniques toward efficient data redistribution

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 1995年第12期6卷 1234-1247页

作者： Kalns, ET Ni, LM MICHIGAN STATE UNIV DEPT COMP SCIE LANSINGMI 48824

Run-time data redistribution can enhance algorithm performance in distributed-memory machines, Explicit redistribution of data can be performed between algorithm phases when a different data decomposition is expected to deliver increased performance for a subsequent phase of computation. Redistribution, however, represents increased program overhead as algorithm computation is discontinued while data are exchanged among processor memories, In this paper, we present a technique that minimizes the amount of data exchange for BLOCK to CY-CLIC (c) (or vice-versa) redistributions of arbitrary number of dimensions, Preserving the semantics of the target (destination) distribution pattern, the technique manipulates the data to logical processor mapping of the target pattern, When implemented on an IBM SP, the mapping technique demonstrates redistribution performance improvements of approximately 40% over traditional data to processor mapping. Relative to the traditional mapping technique, the proposed method affords greater flexibility in specifying precisely which data elements are redistributed and which elements remain on-processor.

关键词： distributed-memory architectures data decomposition data redistribution High Performance Fortran processor mapping data-parallel programming

来源：评论

学校读者我要写书评

暂无评论

Vienna Fortran and the path towards a standard parallel language

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 1997年第4期E80D卷 409-416页

作者： Chapman, BM Mehrotra, P Zima, HP Institute for Software Technology and Parallel Systems University of Vienna A-1090 Vienna Liechtensteinstr. 22 Austria

Highly parallel scalable multiprocessing systems (HMPs) are powerful tools for solving large-scale scientific and engineering problems. However, these machines are difficult to program since algorithms must exploit locality in order to achieve high performance. Vienna Fortran was the first fully specified data-parallel language for HMPs that provided features for the specification of data distribution and alignment at a high level of abstraction. In this paper we outline the major elements of Vienna Fortran and compare it to High Performance Fortran (HPF), a de-facto standard in this area. A significant weakness of HPF is its lack of support for many advanced applications, which require irregular data distributions and dynamic load balancing. We introduce HPF+, an extension of HPF based on Vienna Fortran, that provides the required functionality.

关键词： high performance computing distributed-memory architectures data distribution, parallelization Fortran extensions

来源：评论

学校读者我要写书评

暂无评论

DECENTRALIZED SEMAPHORE SUPPORT IN A VIRTUAL SHARED-memory SYSTEM

引用

JOURNAL OF SUPERCOMPUTING 1995年第1-2期9卷 51-70页

作者： RAMACHANDRAN, M SINGHAL, M Department of Computer and Information Science The Ohio State University Columbus

distributed shared memory has increasingly become a desirable programming model on which to program multicomputer systems. Such systems strike a balance between the performance attainable in distributed-memory multiprocessors and the ease of programming on shared-memory systems. In shared-memory systems, concurrent tasks communicate through shared variables, and synchronization of access to shared data is an important issue. Semaphores have been traditionally used to provide this synchronization. In this paper we propose a decentralized scheme to support semaphores in a virtual shared-memory system. Our method of grouping semaphores into semaphore pages and caching a semaphore at a processor on demand eliminates the reliability problems and bottlenecks associated with centralized schemes. We compare the performance of our scheme with a centralized implementation of semaphores and conclude that our system performs better under high semaphore access rates as well as larger numbers of processors.

关键词： OPERATING SYSTEMS PROCESS SYNCHRONIZATION SEMAPHORES distributed-memory architectures distributed SHARED memory

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of enhanced fine-grain multithreaded distributed-memory systems

Performance analysis of enhanced fine-grain multithreaded di...

引用

IEEE International Conference on Systems, Man and Cybernetics (SMC)

作者： Zuberek, WM Mem Univ Newfoundland Dept Comp Sci St John NF A1B 3X5 Canada

ISBN: (纸本)0780370872

In fine-grain multithreading, the thread changes in each processor cycle, consecutive instructions are thus issued from different threads, and no data dependencies stall the pipeline. Enhanced fine-grain multithreading maintains a number of additional threads which are used to replace an active thread when it initiates a long-latency operation. Performance improvements due to enhanced multithreading are studied by analyzing a timed Petri net model of a fine-grain multithreaded architecture at the instruction execution level.

关键词： fine-grain multithreading distributed-memory architectures timed Petri nets performance analysis discrete-event simulation

来源：评论

学校读者我要写书评

暂无评论

Interprocedural Distribution Assignment Placement: More Than Just Enhancing Intraprocedural Placing Techniques 97

Interprocedural Distribution Assignment Placement: More Than...

引用

Proceedings of the 1997 International Conference on Parallel architectures and Compilation Techniques

作者： J. Knoop E. Mehofer

ISBN: (纸本)9780818680908

Avoiding unnecessary remappings at run-time by means of a strategic distribution assignment placement (DAP) is a major means for improving the run-time efficiency of data-parallel programs on distributed-memory architectures. In Proc. Euro-Par '97, pp. 364-73 (1997), we presented a novel and aggressive intraprocedural algorithm achieving this by eliminating partially redundant and partially dead distribution assignments. In this paper, we show how to enhance this approach interprocedurally. Surprisingly at first sight, it turns out that a straightforward adaption of the intraprocedural approach fails because central properties being valid for the intraprocedural case do not carry over to the interprocedural one, revealing severe anomalies. After discussing the essential differences and analogies of DAP in the interprocedural and interprocedural cases, we show how to overcome these anomalies in order to arrive at a powerful and flexible approach for interprocedural DAP (IDAP). As in the interprocedural case, we get a hierarchy of IDAP algorithms of varying power and efficiency supporting user-customized solutions. First practical experiences underline its importance and effectivity.

关键词： unnecessary run-time remappings optimization dynamic data redistribution intraprocedural placing techniques run-time efficiency anomalies partially redundant distribution assignment elimination data-parallel programs High Performance Fortran user-customized solutions parallel programming interprocedural data-flow analysis algorithm hierarchy partially dead distribution assignment elimination interprocedural distribution assignment placement distributed-memory architectures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：