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

Language and library support for practical PRAM programming

parallel COMPUTING 1999年第2期25卷 105-135页

作者： Kessler, CW Träff, JL Univ Trier FB Informat 4 D-54286 Trier Germany Tech Univ Munich Lehrstuhl Effiziente Algorithmen D-80290 Munich Germany

We investigate the well-known parallel Random Access Machine (PRAM) model of parallel computation as a practical parallel pl programming model. The two components of this project are a general-purpose PRAM programming language, called Fork95, and a library, called PAD, of fundamental, efficiently implemented parallel algorithms and data structures. We outline the main features of Fork95 as they apply to the implementation of PAD, and describe the implementation of library procedures for prefix-sums and sorting. The Fork95 compiler generates code for the SB-PRAM, a hardware emulation of the PRAM, which is currently being completed at the University of Saarbrucken. Both language and library can immediately be used with this machine. The project is, however, of independent interest. The programming environment can help the algorithm designer to evaluate the practicality of new parallel algorithms, and can furthermore be used as a tool for teaching and communication of parallel algorithms. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： parallel programming languages parallel software libraries programming environments compilers PRAM model

来源：评论

学校读者我要写书评

暂无评论

A cost model for asynchronous and structured message passing

A cost model for asynchronous and structured message passing

引用

5th International Euro-Par Conference

作者： Melin, E Raffin, B Rebeuf, X Virot, B Univ Orleans LIFO F-45067 Orleans 02 France

ISBN: (纸本)3540664432

We present a cost model that relies on an asynchronous and structured parallel execution model for message passing. We show that it is possible to define a complexity function for programs that yields a symbolic date for each communication event. By ordering these dates, an upper bound for the network load can be computed. In contrast to classical approaches this cost computation can handle asynchronism for message passing and communication/computation overlap.

关键词： cost model symbolic date parallel programming languages asynchronous execution structural clock

来源：评论

学校读者我要写书评

暂无评论

Models and languages for parallel computation

引用

ACM COMPUTING SURVEYS 1998年第2期30卷 123-169页

作者： Skillicorn, DB Talia, D Queens Univ Kingston ON K7L 3N6 Canada Univ Calabria DEIS CNR ISI I-87036 Arcavacata Di Rende CS Italy

We survey parallel programming models and languages using six criteria to assess their suitability for realistic portable parallel programming. We argue that an ideal model should be easy to program, should have a software development methodology, should be architecture-independent, should be easy to understand, should guarantee performance, and should provide accurate information about the cost of programs. These criteria reflect our belief that developments in parallelism must be driven by a parallel software industry based on portability and efficiency. We consider programming models in six categories, depending on the level of abstraction they provide. Those that are very abstract conceal even the presence of parallelism at the software level. Such models make software easy to build and port, but efficient and predictable performance is usually hard to achieve. At the other end of the spectrum, low-level models make all of the messy issues of parallel programming explicit (how many threads, how to place them, how to express communication, and how to schedule communication), so that software is hard to build and not very portable, but is usually efficient. Most recent models are near the center of this spectrum, exploring the best tradeoffs between expressiveness and performance. A few models have achieved both abstractness and efficiency. Both kinds of models raise the possibility of parallelism as part of the mainstream of computing.

关键词： general-purpose parallel computation logic programming languages object-oriented languages parallel programming languages parallel programming models software development methods taxonomy

来源：评论

学校读者我要写书评

暂无评论

The design, implementation, and evaluation of Jade

引用

ACM TRANSACTIONS ON programming languages AND SYSTEMS 1998年第3期20卷 483-545页

作者： Rinard, MC Lam, MS MIT Comp Sci Lab Cambridge MA 02139 USA Stanford Univ Dept Comp Sci Stanford CA 94305 USA

Jade is a portable, implicitly parallel language designed for exploiting task-level concurrency. Jade programmers start with a program written in a standard serial, imperative language, then use Jade constructs to declare how parts of the program access data. The Jade implementation uses this data access information to automatically extract the concurrency and map the application onto the machine at hand. The resulting parallel execution preserves the semantics of the original serial program. We have implemented Jade as an extension to C, and Jade implementations exist for shared-memory multiprocessors, homogeneous message-passing machines, and heterogeneous networks of workstations. Tn this article we discuss the design goals and decisions that determined the final form of Jade and present an overview of the Jade implementation. We also present our experience using Jade to implement several complete scientific and engineering applications. We use this experience to evaluate how the different Jade language features were used in practice and how well Jade as a whole supports the process of developing parallel applications. We find that the basic idea of preserving the serial semantics simplifies the program development process, and that the concept of using data access specifications to guide the parallelization offers significant advantages over more traditional control-based approaches. We also find that the Jade data model can interact poorly with concurrency patterns that write disjoint pieces of a single aggregate data structure, although this problem arises in only one of the applications.

关键词： parallel computing parallel programming languages

来源：评论

学校读者我要写书评

暂无评论

A NOTATION FOR DETERMINISTIC COOPERATING PROCESSES

引用

IEEE TRANSACTIONS ON parallel AND DISTRIBUTED SYSTEMS 1995年第8期6卷 863-871页

作者： CHANDY, KM FOSTER, I ARGONNE NATL LAB DIV MATH & COMP SCIARGONNEIL 60439

This paper proposes extensions of sequential programming languages for parallel programming that have the following features: 1) Dynamic Structures: The process structure is dynamic, Processes and variables can be created and deleted. 2) Paradigm Integration: The programming notation supports shared memory and message passing models. 3) Determinism: Demonstrating that a program is deterministic-all executions with the same input produce the same output-is straightforward. Programs can be written so that compilers can verify that the programs are deterministic. Nondeterministic constructs can be introduced in a sequence of refinement steps to obtain greater efficiency if required. The ideas have been incorporated in an extension of Fortran, but the underlying sequential imperative language is not central to the ideas described here. A compiler for the Fortran extension, called Fortran M, is available by anonymous ftp from Argonne National Laboratory. Fortran M has been used for a variety of parallel applications.

关键词： parallel programming languages DETERMINISM FUNCTIONAL programming MULTICOMPUTERS DEBUGGING

来源：评论

学校读者我要写书评

暂无评论

GRAPH-BASED SOFTWARE CONSTRUCTION FOR parallel MESSAGE-PASSING PROGRAMS

引用

INFORMATION AND SOFTWARE TECHNOLOGY 1994年第7期36卷 405-411页

作者： WIRTZ, G FB Elektrotechnik und Informatik Universit&auml t-GHS-Siegen H&ouml lderlinstraβe 3 57068 Siegen Germany

A programming language which supports the adequate specification of both parallel and sequential aspects of a program establishes the optimal basis for a parallel programming methodology. parallel languages that are entirely based on textual representations are not the best choice for describing paralellism. The main drawbacks stem from the fact that the sequential order of textual representations hides the parallel structure of a program. We propose a new programming methodology and language (called Meander), integrating textual and graphical descriptions, which is much better suited for parallel programming. parallel aspects are formulated by means of a specification graph which is annotated by sequential code. Program design, coding and visualization can then be performed in one single formalism which is suitable for all phases.

关键词： parallel programming ENVIRONMENTS SPECIFYING parallelISM parallel programming languages VISUAL programming

来源：评论

学校读者我要写书评

暂无评论

IMPLEMENTING OBJECT-BASED DISTRIBUTED SHARED MEMORY ON TRANSPUTERS

IMPLEMENTING OBJECT-BASED DISTRIBUTED SHARED MEMORY ON TRANS...

引用

1994 World Transputer Congress (WTC 94) - Transputer Applications and Systems 94

作者： HEINZLE, HP BAL, HE LANGENDOEN, K FREE UNIV AMSTERDAM DEPT MATH & COMP SCI1007 MC AMSTERDAMNETHERLANDS

来源：评论

学校读者我要写书评

暂无评论

parallel programming WITH CONTROL ABSTRACTION

引用

ACM TRANSACTIONS ON programming languages AND SYSTEMS 1994年第3期16卷 524-576页

作者： CROWL, LA LEBLANC, TJ UNIV ROCHESTER DEPT COMP SCIROCHESTERNY 14627

parallel programming involves finding the potential parallelism in an application and mapping it to the architecture at hand. Since a typical application has more potential parallelism than any single architecture can exploit effectively, programmers usually limit their focus to the parallelism that the available control constructs express easily and that the given architecture exploits efficiently. This approach produces programs that exhibit much less parallelism than exists in the application, and whose performance depends critically on the underlying hardware and software. We argue for an alternative approach based on control abstraction. Control abstraction is the process by which programmers define new control constructs, specifying constraints on statement ordering separately from an implementation of that ordering. With control abstraction programmers can define and use a rich variety of control constructs to represent an algorithm's potential parallelism. Since control abstraction separates the definition of a construct from its implementation, a construct may have several different implementations, each exploiting a different subset of the parallelism admitted by the construct. By selecting an implementation for each control construct using annotations, a programmer can vary the parallelism in a program to best exploit the underlying hardware without otherwise changing the source code. This approach produces programs that exhibit most of the potential parallelism in an algorithm, and whose performance can be tuned simply by choosing among the various implementations for the control constructs in use. We use several example applications to illustrate the use of control abstraction in parallel programming and performance tuning and describe our implementation of a prototype programming language based on these ideas on the BBN Butterfly.

关键词： ALGORITHMS DESIGN languages ARCHITECTURAL ADAPTABILITY CLOSURES CONTROL ABSTRACTION DATA ABSTRACTION EARLY REPLY MULTIPROCESSORS parallel programming languages PERFORMANCE TUNING

来源：评论

学校读者我要写书评

暂无评论

PARC PROJECT - PRACTICAL CONSTRUCTS FOR parallel programming-languages 15

PARC PROJECT - PRACTICAL CONSTRUCTS FOR PARALLEL PROGRAMMING...

引用

15TH ANNUAL INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONF ( COMPSAC 91 )

作者： GOVINDARAJAN, R GUO, L YU, S WANG, P Department of Electrical Engineering McGill University Montreal H3A 2A7 PQ Canada Department of Computer Science University of Western Ontario London N6A 5B7 ON Canada Department of Mathematics and Computer Sciences Kent State University Kent 44242 OH United States

ISBN: (纸本)0818621524

In this paper, new constructs for synchronization in parallel programming languages are presented for shared memory multiprocessors. The motivation behind the design of these new constructs is to relieve programmers from the burden of imposing synchronization, requiring them only to specify the necessary constraints. Statement tags are introduced. Synchronization is specified by means of regular expressions of statement tags, termed synchronization expressions. Unlike path expressions, our synchronization expressions demand no structural changes on the base language and allow much more complicated synchronization constraints to be expressed and expressed easily. This is due to the use of statement tags and the presence of guards in the latter. We present a few examples to demonstrate the simplicity and the power of synchronization expressions. © 1991 IEEE.

关键词： Multiprocessors parallel constructs parallel programming languages Statement tags Synchronization expressions

来源：评论

学校读者我要写书评

暂无评论

Networked workstations and parallel processing utilizing functional languages

Networked workstations and parallel processing utilizing fun...

引用

作者： Fox, Stanley L. Naval Postgraduate School

学位级别：硕士

Alternative computer architectures are necessary to replace the traditional 'von Neumann' computer organization in order to obtain large increases in performance. The traditional 'von Neumann' architecture uses a timer based (e. g., the program counter), sequentially programmed, single processor approach to problem solving. Today's new hardware technology allows for the utilization of multiple processors. By programming and operating these processors in parallel, this alternative architecture will provide for greater computing speed, improved system reliability, enhanced software manageability, and a more cost-effective approach than our present computing practices.

关键词： parallel processing distributed computing functional languages parallel programming languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：