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

The Fork95 parallel programming language: Design, implementation, application

INTERNATIONAL JOURNAL OF parallel programming 1997年第1期25卷 17-50页

作者： Kessler, CW Seidl, H Fachbereich IV-Informatik Universität Trier Trier Germany

Fork95 is an imperative parallel programming language intended to express algorithms for synchronous shared memory machines (PRAMs). It is based on ANSI C and offers additional constructs to hierarchically divide processor groups into subgroups and manage shared and private address subspaces. Fork95 makes the assembly-level synchronicity of the underlying hardware available to the programmer at the language level. Nevertheless, it supports locally asynchronous computation where desired by the programmer. We present a one pass compiler, fee, which compiles Fork95 and C programs to the SB-PRAM machine. The SB-PRAM is a lock-step synchronous, massively parallel multiprocessor currently being built at Saarbrucken University, with a physically shared memory and uniform memory access time. We examine three important types of parallel computation Frequently used for the parallel solution of real-world problems. While farming and parallel divide-and-conquer are directly supported by Fork95 language constructs, pipelining can be easily expressed using existing language Features;an additional language construct for pipelining is not required.

关键词： Fork95 parallel programming language synchronous program execution PRAM parallel programming paradigms

来源：评论

学校读者我要写书评

暂无评论

Compositional high-level Petri net semantics of a parallel programming language with procedures

引用

SCIENCE OF COMPUTER programming 2001年第3期41卷 195-240页

作者： Klaudel, H Univ Paris 12 F-94010 Creteil France

This paper exhibits the extension of a formal semantics of a parallel programming language, based on high-level Petri nets, in order to cope with procedures. The solution is based on refinement and synchronization operations of high-level Petri nets. It inherits thus properties of the Petri net model, in particular the coherence with elementary Petri nets on which verification techniques are based. Furthermore, the approach formalizes nicely the intuition behind procedures and their parameters, while in the absence of procedures, our definition and the existing semantics coincide. (C) 2001 Published by Elsevier Science B.V.

关键词： high-level Petri nets M-nets parallel programming language procedures refinement semantics

来源：评论

学校读者我要写书评

暂无评论

THE BLAZE language - A parallel language FOR SCIENTIFIC programming

引用

parallel COMPUTING 1987年第3期5卷 339-361页

作者： MEHROTRA, P VANROSENDALE, J UNIV UTAH DEPT COMP SCISALT LAKE CITYUT 84112

programming multiprocessor parallel architectures is a complex task. This paper describes a block-structured scientific programming language, BLAZE, designed to simplify this task. BLAZE contains array arithmetic, ‘forall’ loops, and APL-style accumulation operators, which allow natural expression of fine grained parallelism. It also employs an applicative or functional procedure invocation mechanism, which makes it easy for compilers to extract coarse grained parallelism using machine specific program restructuring. Thus BLAZE should allow one to achieve highly parallel execution on multiprocessor architectures, while still providing the user with conceptually sequential control flow. A central goal in the design of BLAZE is portability across a broad range of parallel architectures. The multiple levels of parallelism present in BLAZE code, in principle, allow a compiler to extract the types of parallelism appropriate for the given architecture, while neglecting the remainder. This paper describes the features of BLAZE, and show how this language would be used in typical scientific programming.

关键词： compiler MIMD architectures multiprocessors parallel programming language restructuring of conventional sequential languages The BLAZE language

来源：评论

学校读者我要写书评

暂无评论

ZPL: A machine independent programming language for parallel computers

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2000年第3期26卷 197-211页

作者： Chamberlain, BL Choi, SE Lewis, EC Lin, C Snyder, L Weathersby, WD Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA Los Alamos Natl Lab Adv Comp Lab Los Alamos NM 87545 USA Univ Texas Dept Comp Sci Austin TX 78712 USA Metris Co Champaign IL 61820 USA

The goal of producing architecture-independent parallel programs is complicated by the competing need for high performance. The ZPL programming language achieves both goals by building upon an abstract parallel machine and by providing programming constructs that allow the programmer to "see" this underlying machine. This paper describes ZPL and provides a comprehensive evaluation of the language with respect to its goals of performance, portability, and programming convenience. In particular, we describe ZPL's machine-independent performance model, describe the programming benefits of ZPL's region-based constructs, summarize the compilation benefits of the language's high-level semantics, and summarize empirical evidence that ZPL has achieved both high performance and portability on diverse machines such as the IBM SP-2, Gray T3E, and SGI Power Challenge.

关键词： portable efficient parallel programming language

来源：评论

学校读者我要写书评

暂无评论

Evaluation of XcalableACC with tightly coupled accelerators/InfiniBand hybrid communication on accelerated cluster

引用

INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS 2019年第5期33卷 869-884页

作者： Nakao, Masahiro Odajima, Tetsuya Murai, Hitoshi Tabuchi, Akihiro Fujita, Norihisa Hanawa, Toshihiro Boku, Taisuke Sato, Mitsuhisa RIKEN Ctr Computat Sci Kobe Hyogo Japan Fujitsu Labs Ltd Kawasaki Kanagawa Japan Univ Tsukuba Grad Sch Syst & Informat Engn Tsukuba Ibaraki Japan Univ Tsukuba Ctr Computat Sci Tsukuba Ibaraki Japan Univ Tokyo Informat Technol Ctr Tokyo Japan

Accelerated clusters, which are cluster systems equipped with accelerators, are one of the most common systems in parallel computing. In order to exploit the performance of such systems, it is important to reduce communication latency between accelerator memories. In addition, there is also a need for a programming language that facilitates the maintenance of high performance by such systems. The goal of the present article is to evaluate XcalableACC (XACC), a parallel programming language, with tightly coupled accelerators/InfiniBand (TCAs/IB) hybrid communication on an accelerated cluster. TCA/IB hybrid communication is a combination of low-latency communication with TCA and high bandwidth with IB. The XACC language, which is a directive-based language for accelerated clusters, enables programmers to use TCA/IB hybrid communication with ease. In order to evaluate the performance of XACC with TCA/IB hybrid communication, we implemented the lattice quantum chromodynamics (LQCD) mini-application and evaluated the application on our accelerated cluster using up to 64 compute nodes. We also implemented the LQCD mini-application using a combination of CUDA and MPI (CUDA + MPI) and that of OpenACC and MPI (OpenACC + MPI) for comparison with XACC. Performance evaluation revealed that the performance of XACC with TCA/IB hybrid communication is 9% better than that of CUDA + MPI and 18% better than that of OpenACC + MPI. Furthermore, the performance of XACC was found to further increase by 7% by new expansion to XACC. Productivity evaluation revealed that XACC requires much less change from the serial LQCD code to implement the parallel LQCD code than CUDA + MPI and OpenACC + MPI. Moreover, since XACC can perform parallelization while maintaining the sequential code image, XACC is highly readable and shows excellent portability due to its directive-based approach.

关键词： parallel programming language interconnect heterogeneous system GPU lattice quantum chromodynamics

来源：评论

学校读者我要写书评

暂无评论

High Performance Fortran for practical scientific algorithms: An up-to-date evaluation

引用

FUTURE GENERATION COMPUTER SYSTEMS 1999年第3期15卷 343-352页

作者： Ding, CHQ Univ Calif Berkeley Lawrence Berkeley Lab Natl Energy Res Sci Comp Ctr Berkeley CA 94720 USA

A suite of High Performance Fortran (HPF) coding examples of practical scientific algorithms are examined in detail, with the idea that on these simple but non-trivial examples, we can fairly well understand issues related to different data distributions, different parallel constructs, and different programming styles (static Versus dynamic allocations). Coding examples include 2D stencils solution of PDEs, N-body problem, LU factorization, several vector/matrix library routines, 2D and 3D array redistribution. Performances of HPF codes are compared to hand-written Fortran codes with message passing libraries. From 1997 to 1998, HPF compilers are improved significantly such that HPF codes perform as well as Fortran+MPI codes for all the examples investigated here. However, many important peculiarities of HPF coding still exist. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： HPF distributed-memory architecture parallel programming language MPI stencils computation N-body problem LU factorization array redistribution FFT

来源：评论

学校读者我要写书评

暂无评论

DATA-parallel programming ON MIMD COMPUTERS

引用

IEEE TRANSACTIONS ON parallel AND DISTRIBUTED SYSTEMS 1991年第3期2卷 377-383页

作者： HATCHER, PJ QUINN, MJ LAPADULA, AJ SEEVERS, BK ANDERSON, RJ JONES, RR OREGON STATE UNIV DEPT COMP SCICORVALLISOR 97331

We are convinced that the combination of data-parallel languages and MIMD hardware can make an important contribution to high-speed computing. In this paper, we describe the implementation of two compilers for the data-parallel programming language Dataparallel C. One compiler generates code for Intel and nCUBE hypercube multicomputers;the other generates code for Sequent multiprocessors. We have compiled and executed a suite of Dataparallel C programs, and we present their execution times and speedups on the Intel iPSC/2, the nCUBE 3200, and the Sequent Symmetry.

关键词： COMPILER IMPLEMENTATION DATA-parallel ALGORITHM MULTICOMPUTER MULTIPROCESSOR parallel PROCESSING parallel programming language PERFORMANCE EVALUATION

来源：评论

学校读者我要写书评

暂无评论

Adaptive parallel computing on heterogeneous networks with mpC

引用

parallel COMPUTING 2002年第10期28卷 1369-1407页

作者： Lastovetsky, A Univ Coll Dublin Dept Comp Sci Dublin 4 Ireland

The paper presents a new advanced version of the mpC parallel language. The language was designed specially for programming high-performance parallel computations on heterogeneous networks of computers. The advanced version allows the programmer to define at runtime all the main features of the underlying parallel algorithm, which have an impact on the application execution performance, namely, the total number of participating parallel processes, the total volume of compulations to be performed by each of the processes, the total volume of data to be transferred between each pair of the processes, and how exactly the processes interact during the execution of the algorithm. Such an abstraction of parallel algorithm is called a network type in mpC. Given a network type, the programmer can define a network object of this type and describe in details all the computations and communications to be performed on the network object. The mpC programming system uses the information extracted from the network-type definition together with information about the actual performance of the executing network to map the processes of the parallel program to this network in such a way that leads to its better execution time. In addition, the programmer can use a special operator, time of, which predicts the total time of the algorithm execution on the underlying hardware without its real execution. That feature allows the programmer to write such a parallel program that can follow different parallel algorithms to solve the same problem, making choice at runtime depending on the particular executing network and its actual performance. The paper describes both the language model of parallel algorithm and the model of executing parallel environment used by the mpC programming system. It also discusses principles of the implementation of mapping mpC network objects to the computing network. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： parallel programming language parallel programming system heterogeneous network of computers heterogeneous parallel computing

来源：评论

学校读者我要写书评

暂无评论

Probabilistic guards: A mechanism for increasing the granularity of work-stealing programs

引用

parallel COMPUTING 2019年 82卷 19-36页

作者： Yoritaka, Hiroshi Matsui, Ken Yasugi, Masahiro Hiraishi, Tasuku Umatani, Seiji Kyushu Inst Technol Iizuka Fukuoka 8208502 Japan Kyoto Univ Kyoto 6068501 Japan Ad Sol Nissin Corp Tokyo Japan Nintendo Co Ltd Kyoto Japan

We propose probabilistic guards and analyze their performance. To reduce the total task division cost, probabilistic guards can prevent thief workers from stealing small tasks from victim workers probabilistically. In this study, we have implemented probabilistic guards on a work-stealing framework called Tascell. Without an upper limit to the number of repeated probabilistically prevented steal attempts, a thief may repeat an unbounded number of probabilistically prevented steal attempts until success if a victim uses a probabilistic guard that rejects steal attempts with a non-zero probability. We measured the actual numbers of repeated attempts until success, and evaluated the performance of probabilistic guards with various upper limits. In this paper, we also propose virtual probabilistic guards that act as probabilistic guards without repeating probabilistically prevented steal attempts. Virtual probabilistic guards exhibit superior performance compared to probabilistic guards. Our evaluation is based on parallelized "highly serial" force calculation in a shared memory environment and five Tascell programs in a distributed memory environment. (C) 2018 Elsevier B.V. All rights reserved.

关键词： parallel programming language Work stealing Probability Concurrency Many-core Barnes-Hut algorithm

来源：评论

学校读者我要写书评

暂无评论

Rendezvous Facilities in a Distributed Computer System

引用

Journal of Computer Science & Technology 1995年第2期10卷 188-192页

作者：廖先湜金兰 DepartmentofComputerScience TsinghuaUniversityBeijing100084 DepartmentofComputerScience CaliforniaSt

The distributed computer system described in this paper is a set of computernodes interconnected in an interconnection network via packet-switching *** nodes communicate with each other by means of message-passing protocols. Thispaper presents the implementation of rendezvous facilities as highlevel prhoitives provided by a parallel programming language to support interprocess cornmunication andsynchronisation.

关键词： Rendevous packet-switching interface message-passing protocols interprocess communication and synchronization high-level primitive parallel programming language interconnection network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：