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

StreamPI: a stream-parallel programming extension for object-oriented programming languages

JOURNAL OF SUPERCOMPUTING 2012年第1期61卷 118-140页

作者： Hong, Jingun Hong, Kirak Burgstaller, Bernd Blieberger, Johann Yonsei Univ Seoul 120749 South Korea Vienna Univ Technol A-1040 Vienna Austria

Because multicore CPUs have become the standard with all major hardware manufacturers, it becomes increasingly important for programming languages to provide programming abstractions that can be mapped effectively onto parallel architectures. Stream processing is a programming paradigm where computations are expressed as independent actors that communicate via FIFO data-channels. The coarse-grained parallelism exposed in stream programs facilitates such an efficient mapping of actors onto the underlying multicore hardware. We propose a stream-parallel programming abstraction that extends object-oriented languages with stream-programming facilities. StreamPI consists of a class hierarchy for actor-specification together with a language-independent runtime system that supports the execution of stream programs on multicore architectures. We show that the language-specific part of StreamPI, i.e., the class hierarchy, can be implemented as a library-level programming language extension. A library-level extension has the advantage that an existing programming language implementation need not be touched. Legacy-code can be mixed with a stream-parallel application, and the use of sequential legacy code with actors is supported. Unlike previous approaches, StreamPI allows dynamic creation and subsequent execution of stream programs. StreamPI actors are typed. Type-safety is achieved through type-checks at stream graph creation time. We have implemented StreamPI's language-independent runtime system and language interfaces for Ada 2005 and C++ for Intel multicore architectures. We have evaluated StreamPI for up to 16 cores on a two CPU 8-core Intel Xeon X7560 server, and we provide a performance comparison with StreamIt (Gordon et al. in International Conference on Architectural Support for Programming Languages and Operating Systems, 2006), which is the de facto standard for stream-parallel programming. Although our approach provides greater programming flexibility than Stre

关键词： Programming language support for multicore architectures Stream-parallel programming abstraction synchronous data-flow Multicore architectures

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of 8(1/2): A declarative data-parallel language

引用

COMPUTER LANGUAGES 1996年第2-3期22卷 165-179页

作者： Michel, O LRI u.r.a. 410 du CNRS Bâtiment 490 Université de Paris-Sud 91405 Orsay Cedex France

In this article we advocate a declarative approach to data-parallelism to provide both parallelism expressiveness and efficient execution of data intensive applications. 8(1/2), an experimental language combining features of collection and stream oriented languages in a declarative framework, is presented. A new structure, the web, allows the programmer to write programmes as mathematical expressions and to implicitly express data and control parallelism. The first part of this paper proposes a classification of the various expressions of parallelism in programming languages. We show that hybrid execution models combining both data and control parallelism are possible and necessary to get an effective speedup. We sketch the advantage of the declarative style with respect to parallelism expression (application side) and exploitation (compiler side). In the second part we describe the 8(1/2) language and the concepts of collection, stream and web. A web is a multi-dimensional object that represents the successive values of a structured set of variables. Some 8(1/2) programmes are given to show the relevance of the web data structure for simulation applications (a resolution of O.D.P.E. and a simulation in artificial life). Examples of 8(1/2) programmes, involving the dynamic creation and destruction of webs, are also given. Such programmes are necessary for simulations of growing systems. In the third part, the implementation of a compiler restricted to the static part of the language is described. We focus on the process of web equations compilation towards a virtual SIMD machine. We also present the clock calculus, the scheduling inference and the distribution of the computations among the processing elements of a parallel computer. Copyright (C) 1996 Elsevier Science Ltd

关键词： data-parallelism declarative languages collection-oriented languages synchronous data-flow recursive collection data-distribution and scheduling

来源：评论

学校读者我要写书评

暂无评论

Graph transformations and derivation of scheduling constraints applied to the mapping of real-time distributed applications 13

Graph transformations and derivation of scheduling constrain...

引用

IEEE 13th International Symposium on Embedded Multicore/Many-Core Systems-on-Chip (MCSoC)

作者： Louise, Stephane CEA LIST PC172Bat 862 F-91191 Gif Sur Yvette France

ISBN: (纸本)9781728148823

synchronous data-flow as a deterministic variation of Khan Process Networks is a good model for distributed applications that allows for verification of the properties of the applications both at the design level and at run-time. Real-Time extensions exist which allow to specify Real-Time clocks for some of the processes in the graph. With the addition of Real-Time clocks, the behavior of the complete system can be easily differentiated from a nominal Real-Time mode where all the required data for processing is available when a clock tick occurs, and an error mode can be triggered when the condition is not met. Our contribution in this paper is -first- to show a set of graph transformations that allow to account for the execution and communication time on a real platform while at the same time maximizing the parallelism of execution and -second-on top of these transformations to provide the execution constraints as a linear program that must be met at run-time to guarantee the real-time requirements. It is illustrated on a subset of a real-life automotive example.

关键词： Distributed and Heterogeneous systems synchronous data-flow Graph Transformations

来源：评论

学校读者我要写书评

暂无评论

CYCLO-STATIC dataflow - MODEL AND IMPLEMENTATION 28

CYCLO-STATIC DATAFLOW - MODEL AND IMPLEMENTATION

引用

28th Asilomar Conference on Signals, Systems and Computers

作者： ENGELS, M BILSEN, G LAUWEREINS, R PEPERSTRAETE, J KATHOLIEKE UNIV LEUVEN DEPT ESATB-3001 LOUVAINBELGIUM

ISBN: (纸本)0818664053

Cyclo-static dataflow (CSDF) is used for specifying digital signal processing algorithms with a cyclically changing, but predefined, behavior. Unlike other models for such applications, CSDF allows for static scheduling and hence a very efJicient implementation. In this paper we review the CSDF paradigm and present the scheduling approach for CSDF graphs that is currently implemented in the Graphical Rapid Prototyping Environment GRAPE. © 1995 IEEE.

关键词： CYCLO-STATIC data-flow DIGITAL SIGNAL PROCESSING HARD REAL-TIME SYSTEMS MULTIPROCESSING PARALLEL PROCESSING RAPID PROTOTYPING STATIC SCHEDULING synchronous data-flow

来源：评论

学校读者我要写书评

暂无评论

Safe Functional Reactive Programming through Dependent Types

Safe Functional Reactive Programming through Dependent Types

引用

14th ACM SIGPLAN International Conference on Functional Programming

作者： Sculthorpe, Neil Nilsson, Henrik Univ Nottingham Sch Comp Sci Nottingham NG7 2RD England

ISBN: (纸本)9781605583327

Functional Reactive Programming (FRP) is an approach to reactive programming where systems are structured as networks of functions operating on signals. FRP is based on the synchronous data-flow paradigm and supports both continuous-time and discrete-time signals (hybrid systems). What sets FRP apart from Most other languages for similar applications is its support for systems with dynamic structure and for higher-order reactive constructs. Statically guaranteeing correctness properties of programs is an attractive proposition. This is true in particular for typical application domains for reactive programming such as embedded systems. To that end, many existing reactive languages have type systems or other static checks that guarantee domain-specific properties, such as feedback loops always being well-formed. However, they are limited in their capabilities to support dynamism and higher-order data-flow compared with FRP. Thus, the onus of ensuring such properties of FRP programs has so far been on the programmer as established static techniques do not suffice. In this paper, we show how dependent types allow this concern to be addressed. We present an implementation of FRP embedded in the dependently-typed language Agda, leveraging the type system of the host language to craft a domain-specific (dependent) type system for FRP. The implementation constitutes a discrete, operational semantics of FRP, and as it passes the Agda type, coverage, and termination checks, we know the operational semantics is total, which means our type system is safe.

关键词： dependent types domain-specific languages DSELs FRP functional programming reactive programming synchronous data-flow

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：