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

A high-performance, portable implementation of the MPI message passing interface standard

parallel COMPUTING 1996年第6期22卷 789-828页

作者： Gropp, W Lusk, E Doss, N Skjellum, A ARGONNE NATL LAB DIV MATH & COMP SCIARGONNEIL 60439 MISSISSIPPI STATE UNIV DEPT COMP SCIMISSISSIPPI STATEMS 39762 MISSISSIPPI STATE UNIV NSFENGN RES CTRMISSISSIPPI STATEMS 39762

MPI (Message Passing Interface) is a specification for a standard library for message passing that was defined by the MPI Forum, a broadly based group of parallel computer vendors, library writers, and applications specialists. Multiple implementations of MPI have been developed. In this paper, we describe MPICH, unique among existing implementations in its design goal of combining portability with high performance. We document its portability and performance and describe the architecture by which these features are simultaneously achieved. We also discuss the set of tools that accompany the free distribution of MPICH, which constitute the beginnings of a portable parallel programming environment. A project of this scope inevitably imparts lessons about parallel computing, the specification being followed, the current hardware and software environment for parallel computing, and project management;we describe those we have learned. Finally, we discuss future developments for MPICH, including those necessary to accommodate extensions to the MPI Standard now being contemplated by the MPI Forum.

关键词： message passing interface parallel programming environment benchmark performance portability MPI-2

来源：评论

学校读者我要写书评

暂无评论

Scheduling PVM Tasks

引用

Journal of Computer Science & Technology 1997年第2期12卷 167-176页

作者：鞠九滨王勇尹玉 DepartmentofComputerScience JilinUniversityChangchun130023

This paper describes a PVM task scheduler designed and implemented by the authors. The scheduler supports selecting idle workstations, scheduling pool tasks and dynamically produced subtasks. It can improve resource u... 详细信息

关键词： Workstation cluster parallel programming environment task scheduling idle processor PVM

来源：评论

学校读者我要写书评

暂无评论

OVERVIEW OF THE KOAN programming environment FOR THE IPSC/2 AND PERFORMANCE EVALUATION OF THE BECAUSE TEST PROGRAM-2.51

引用

FUTURE GENERATION COMPUTER SYSTEMS 1994年第4期10卷 391-401页

作者： BODIN, F PRIOL, T IRISA-INRIA Campus de Beaulieu 35042 Rennes Cedex France

In this paper, we describe a Fortran programming environment using the KOAN Shared Virtual Memory on a distributed memory parallel architecture. We then discuss its use for parallelizing a BECAUSE benchmark application and present performance results. Initial findings show that it is possible to obtain good performance without the need for low level parallel programming.

关键词： SHARED VIRTUAL MEMORY parallel programming environment BECAUSE BENCHMARK

来源：评论

学校读者我要写书评

暂无评论

programming environment FOR A TRANSPUTER-BASED COMPUTER

引用

FUTURE GENERATION COMPUTER SYSTEMS 1994年第2-3期10卷 295-299页

作者： LUQUE, E SENAR, MA FRANCO, D HERNANDEZ, P HEYMANN, E MOURE, JC Departament d'Inform&agrave tica Unitat d'Arquitectura d'Ordinadors i Sistemes Operatius Universitat Aut&ograve noma de Barcelona 08193-Bellaterra Barcelona Spain

Despite the availability of parallel computing from the last two decades, there is little use of these systems in production-level environments. One of the factors most commonly blamed for the slow transition to parallelism is the lack of software support. While in serial programming the performance depends basically on the algorithm designed by the user, in parallel programming there are many machine-dependent aspects that have a significant impact on the final performance. Therefore, the user must learn a great deal about machine-dependent aspects like process grain determination, task allocation, message routing, etc. The aim of this project is intended in the design and implementation of a user friendly environment for parallel programming in a Transputer-based system. The environment will free the user of all machine-dependent aspects by means of two system services running on a host computer and a distributed kernel running on the target computer. On one hand, the two system services consist of one tool that is responsible for obtaining clusters of program tasks, and another tool that is responsible for mapping those clusters onto physical processors. On the other hand, the environment has a distributed kernel running on the target machine that hides the physical architecture. It executes user tasks with location transparency, offering a simple and efficient interface for interprocess communication, and monitoring the execution of the user programme. As a consequence, user productivity will be increased because he does not need to be aware of those aspects that are carried out automatically by the environment.

关键词： parallel programming environment DISTRIBUTED KERNEL PROCESSOR ALLOCATION PROBLEM CLUSTERING PROBLEM

来源：评论

学校读者我要写书评

暂无评论

Overcoming performance bottlenecks in using OpenMP on SMP clusters

引用

parallel COMPUTING 2008年第10期34卷 570-592页

作者： Jeun, Woo-Chul Kee, Yang-Suk Ha, Soonhoi Kee, Changdon Univ So Calif Inst Informat Sci Marina Del Rey CA 90292 USA Seoul Natl Univ Seoul 151742 South Korea

This paper presents a new parallel programming environment called ParADE to enable easy. portable, and high-performance computing for SMP clusters. Different from the prior studies, ParADE separates the programming model from the execution model: it enables shared-address-space programming while it realizes hybrid execution of message-passing and shared-address-space. To overcome the poor performance of conventional OpenMP on SDSM (Software Distributed Shared Memory), ParADE implements an intelligent OpenMP translator supporting efficient mutual exclusion and efficient page transmission. The experimental results on a Linux cluster demonstrate that ParADE reduces mutual exclusion overhead and overall execution time. (C) 2008 Elsevier B.V. All rights reserved.

关键词： OpenMP parallel programming environment SMP cluster

来源：评论

学校读者我要写书评

暂无评论

EXTENT - A PORTABLE programming environment FOR DESIGNING AND IMPLEMENTING HIGH-PERFORMANCE BLOCK RECURSIVE ALGORITHMS

EXTENT - A PORTABLE PROGRAMMING ENVIRONMENT FOR DESIGNING AN...

引用

Supercomputing 94

作者： DAI, DL GUPTA, SKS KAUSHIK, SD LU, JH SINGH, RV HUANG, CH SADAYAPPAN, P JOHNSON, RW OHIO STATE UNIV DEPT COMP & INFORMAT SCICOLUMBUSOH 43210

ISBN: (纸本)0818666056

EXTENT is an EXpert system for TENsor product formula Translation. In this paper we present a programming environment for automatic generation of parallel/vector programs from tensor product formulas. A tensor (Kronecker) product based programming methodology is used for designing high performance programs on various architectures. In this programming methodology, block recursive algorithms such as the fast Fourier transform and Strassen's matrix multiplication algorithm are expressed as tensor product formulas involving tensor product and other matrix operations. A tensor product formula can be systematically translated to parallel and/or vector code for various parallel architectures. A prototype system which generates programs for the Cray Y-MP, Cray T3D, and Intel Paragon has been developed. Performance results for some generated programs are presented.

关键词： parallel programming environment TENSOR (KRONECKER) PRODUCT BLOCK RECURSIVE ALGORITHM parallel PROGRAM SYNTHESIS

来源：评论

学校读者我要写书评

暂无评论

Lightweight fault detection for shared virtual memory clusters

Lightweight fault detection for shared virtual memory cluste...

引用

IEEE Region 10 Conference on Analog and Digital Techniques in Electrical Engineering

作者： Kongmunvattana, A Varol, Y Zeng, JT Univ Nevada Dept Comp Sci & Engn Reno NV 89557 USA

ISBN: (纸本)0780385608

Shared virtual memory (SVM) is a practical approach for providing a simple parallel programming environment on a cluster of computers since it permits programmers to assume the existence of a shared memory image across physically distributed memory systems, obviating the need of explicit message passing operations. While several fault-tolerant techniques for crash recovery support in SVM have been proposed and studied extensively, very little attention has been given to fault detection issues. In this paper, we propose and evaluate a new fault detection technique, called lightweight fault detection (LFD). Our experimental results confirmed that LFD provides a swift fault detection support to SVM and incurs very little overhead (1.42% on average) during a failure-free execution. Hence, a combination of LFD with previously proposed crash recovery techniques will make cluster computing on SVM more reliable and attractive.

关键词： parallel programming virtual storage workstation clusters message passing fault tolerant computing distributed shared memory systems system recovery shared virtual memory cluster parallel programming environment distributed memory systems message passing operations fault-tolerant techniques crash recovery lightweight fault detection cluster computing

来源：评论

学校读者我要写书评

暂无评论

MASA-StarPU: parallel Sequence Comparison with Multiple Scheduling Policies and Pruning 32

MASA-StarPU: Parallel Sequence Comparison with Multiple Sche...

引用

32nd IEEE International Symposium on Computer Architecture and High-Performance Computing (SBAC-PAD) / 11th Workshop on Applications for Multi-Core Architectures (WAMCA)

作者： Lopes, Rafael A. Thibault, Samuel Melo, Alba C. M. A. Univ Brasilia UnB Dept Comp Sci Brasilia DF Brazil INRIA Bordeaux Lab Bordeleais Rech Informat Bordeaux France

ISBN: (纸本)9781728199245

Sequence comparison tools based on the Smith-Waterman (SW) algorithm provide the optimal result but have high execution times when the sequences compared are long, since a huge dynamic programming (DP) matrix is computed. Block pruning is an optimization that does not compute some parts of the DP matrix and can reduce considerably the execution time when the sequences compared are similar. However, block pruning's resulting task graph is dynamic and irregular. Since different pruning scenarios lead to different pruning shapes, we advocate that no single scheduling policy will behave the best for all scenarios. This paper proposes MASA-StarPU, a sequence aligner that integrates the domain specific framework MASA to the generic programming environment StarPU, creating a tool which has the benefits of StarPU (i.e., multiple task scheduling policies) and MASA (i.e., fast sequence alignment). MASA-StarPU was executed in two different multicore platforms and the results show that a bad choice of the scheduling policy may have a great impact on the performance. For instance, using 24 cores, the 5M x 5M comparison took 1484s with the dmdas policy whereas the same comparison took 3601s with lws. We also show that no scheduling policy behaves the best for all scenarios.

关键词： parallel sequence comparison parallel programming environment dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Pattern-based parallel programming

Pattern-based parallel programming

引用

31st International Conference on parallel Processing (ICPP 2002)

作者： Bromling, S MacDonald, S Anvik, J Schaeffer, J Szafron, D Tan, K Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada

ISBN: (纸本)0769516777

The advantages of pattern-based programming have been well-documented in the sequential programming literature. However patterns have yet to make their way into mainstream parallel computing, even though several research tools support them. There are two critical shortcomings of pattern (or template) based systems for parallel programming: lack of extensibility and performance. This paper describes our approach for addressing these problems in the CO2P3S parallel programming system. CO2P3S supports multiple levels of abstraction, allowing the user to design an application with high-level patterns, but move to lower levels of abstraction for performance tuning. Patterns are implemented as parameterized templates, allowing the user the ability to customize the pattern to meet their needs. CO2P3S generates code that is specific to the pattern/parameter combination selected by the user The MetaCO(2)P(3)S tool addresses extensibility by giving users the ability to design and add new pattern templates to CO2P3S. Since the pattern templates are stored in a system-independent format, they are suitable for storing in a repository to be shared throughout the user community.

关键词： parallel programming environment design patterns frameworks meta-programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：