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

Curracurrong : a stream programming environment for wireless sensor networks

SOFTWARE-PRACTICE & EXPERIENCE 2014年第2期44卷 175-199页

作者： Kakkad, Vasvi Attar, Saeed Santosa, Andrew E. Fekete, Alan Scholz, Bernhard Univ Sydney Sch Informat Technol Sydney NSW 2006 Australia

The technological advances in wireless sensor network (WSN) enable the development of complex applications including health monitoring, environmental sampling, and disaster area monitoring. WSN applications deploy battery-powered sensors at remote locations for long periods. The development of energy-efficient and complex WSN applications therefore requires in-depth embedded systems programming skills that are normally not found in domain experts. So that this challenge can be overcome, programming environments for WSN need to offer a high degree of productivity, flexibility, and efficiency at the same time. In this work, we present Curracurrong, a development environment for WSNs that is based on expressing queries with stream programming. A query is represented as a stream graph consisting of stream operators and communication channels. Curracurrong provides an extensible stream operator library that adapts to a wide range of applications. It uses a novel placement algorithm that optimizes the energy consumption on sensor nodes. Through a case study, we demonstrate the productivity and flexibility of our system. We conduct experiments that evaluate the energy efficiency of our optimized operator placement algorithm. Copyright (c) 2012 John Wiley & Sons, Ltd.

关键词： stream programming operator placement query language wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A framework for stream programming on DSP

A framework for stream programming on DSP

引用

4th International Conference on Embedded and Multimedia Computing

作者： Xun, Changqing Wen, Mei Wu, Wei Zhang, Chunyuan Natl Univ Def Technol Comp Sch Changsha Hunan Peoples R China

ISBN: (纸本)9781424449965

There has recently been much interest in stream processing, both in industry (Cell, Storm series, NVIDIA G80, AMD FIREstream) and academia (IMAGINE). Some researchers have accelerated a lot of applications in media processing, scientific computing and signal processing with a special programming style called stream programming. This paper presents a framework to program DSP with this special programming style. stream program can run on DSP without any architectural support. H264 encoding is selected to evaluate our technique. The result shows that significant speedup is achieved, ranging from 3.2x for cav1c up to 7.1x for analysis.

关键词： stream programming DSP H.264

来源：评论

学校读者我要写书评

暂无评论

Fault Tolerant Functional Reactive programming (Functional Pearl)

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2018年第ICFP期2卷 1–30页

作者： Perez, Ivan Natl Inst Aerosp Hampton VA 23666 USA

Highly critical application domains, like medicine and aerospace, require the use of strict design, implementation and validation techniques. Functional languages have been used in these domains to develop synchronous dataflow programming languages for reactive systems. Causal stream functions and Functional Reactive programming capture the essence of those languages in a way that is both elegant and robust. To guarantee that critical systems can operate under high stress over long periods of time, these applications require clear specifications of possible faults and hazards, and how they are being handled. Modeling failure is straightforward in functional languages, and many Functional Reactive abstractions incorporate support for failure or termination. However, handling unknown types of faults, and incorporating fault tolerance into Functional Reactive programming, requires a different construction and remains an open problem. This work presents extensions to an existing functional reactive abstraction to facilitate tagging reactive transformations with hazard tags or confidence levels. We present a prototype framework to quantify the reliability of a reactive construction, by means of numeric factors or probability distributions, and demonstrate how to aid the design of fault-tolerant systems, by constraining the allowed reliability to required boundaries. By applying type-level programming, we show that it is possible to improve static analysis and have compile-time guarantees of key aspects of fault tolerance. Our approach is powerful enough to be used in systems with realistic complexity, and flexible enough to be used to guide their analysis and design, to test system properties, to verify fault tolerance properties, to perform runtime monitoring, to implement fault tolerance during execution and to address faults during runtime. We present implementations in Haskell and in Idris.

关键词： fault tolerance functional reactive programming stream programming streams reactive programming monads monad transformers dependent types

来源：评论

学校读者我要写书评

暂无评论

programming by sketching for bit-streaming programs

Programming by sketching for bit-streaming programs

引用

Conference on programming Language Design and Implementation

作者： Solar-Lezama, A Rabbah, R Bodík, R Ebcioglu, K Univ Calif Berkeley Div Comp Sci Berkeley CA 94720 USA MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA IBM Corp TJ Watson Res Ctr Armonk NY 10504 USA

This paper introduces the concept of programming with sketches, an approach for the rapid development of high-performance applications. This approach allows a programmer to write clean and portable reference code, and then obtain a high-quality implementation by simply sketching the outlines of the desired implementation. Subsequently, a compiler automatically fills in the missing details while also ensuring that a completed sketch is faithful to the input reference code. In this paper, we develop streamBit as a sketching methodology for the important class of bit-streaming programs (e.g., coding and cryptography). A sketch is a partial specification of the implementation, and as such, it affords several benefits to programmer in terms of productivity and code robustness. First, a sketch is easier to write compared to a complete implementation. Second, sketching allows the programmer to focus on exploiting algorithmic properties rather than on orchestrating low-level details. Third, a sketch-aware compiler rejects "buggy" sketches, thus improving reliability while allowing the programmer to quickly evaluate sophisticated implementation ideas. We evaluated the productivity and performance benefits of our programming methodology in a user-study, where a group of novice streamBit programmers competed with a group of experienced C programmers on implementing a cipher. We learned that, given the same time budget, the ciphers developed in streamBit ran 2.5 x faster than ciphers coded in C. We also produced implementations of DES and Serpent that were competitive with hand optimized implementations available in the public domain.

关键词： stream programming streamIt synchronous dataflow sketching domain specific language domain specific compiler

来源：评论

学校读者我要写书评

暂无评论

Functional Reactive programming, Refactored 9

Functional Reactive Programming, Refactored

引用

9th ACM SIGPLAN Symposium on Haskell (Haskell 2016)

作者： Perez, Ivan Baerenz, Manuel Nilsson, Henrik Univ Nottingham Nottingham England Univ Bamberg Bamberg Germany

ISBN: (纸本)9781450344340

Functional Reactive programming (FRP) has come to mean many things. Yet, scratch the surface of the multitude of realisations, and there is great commonality between them. This paper investigates this commonality, turning it into a mathematically coherent and practical FRP realisation that allows us to express the functionality of many existing FRP systems and beyond by providing a minimal FRP core parameterised on a monad. We give proofs for our theoretical claims and we have verified the practical side by bench-marking a set of existing, non-trivial Yampa applications running on top of our new system with very good results.

关键词： functional reactive programming reactive programming stream programming monadic streams Haskell

来源：评论

学校读者我要写书评

暂无评论

Parallelization of shallow water simulations on current multi-threaded systems

引用

INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS 2013年第4期27卷 493-512页

作者： Lobeiras, Jacobo Vinas, Moises Amor, Margarita Fraguela, Basilio B. Arenaz, Manuel Garcia, J. A. Castro, M. J. Univ A Coruna UDC Comp Architecture Grp GAC La Coruna Spain Univ A Coruna UDC La Coruna Spain Univ A Coruna UDC Grp M2NICA La Coruna Spain Univ Malaga UMA EDANYA Grp Malaga Spain

In this work, several parallel implementations of a numerical model of pollutant transport on a shallow water system are presented. These parallel implementations are developed in two phases. First, the sequential code is rewritten to exploit the stream programming model. And second, the streamed code is targeted for current multi-threaded systems, in particular, multi-core CPUs and modern GPUs. The performance is evaluated on a multi-core CPU using OpenMP, and on a GPU using the streaming-oriented programming language Brook+, as well as the standard language for heterogeneous systems, OpenCL.

关键词： shallow water pollutant transport stream programming compiler parallelizing transformations GPU OpenMP Brook OpenCL

来源：评论

学校读者我要写书评

暂无评论

Vertex-transformation streams

引用

GRAPHICAL MODELS 2006年第4期68卷 371-383页

作者： Kim, Youngmin Lee, Chang Ha Varshney, Amitabh Univ Maryland Dept Comp Sci College Pk MD 20742 USA

Recent trends in parallel computer architecture strongly suggest the need to improve the arithmetic intensity (the compute to bandwidth ratio) for greater performance in time-critical applications, such as interactive 3D graphics. At the same time, advances in stream programming abstraction for graphics processors (GPUs) have enabled us to use parallel algorithm design methods for GPU programming. Inspired by these developments, this paper explores the interactions between multiple data streams to improve arithmetic intensity and address the input geometry bandwidth bottleneck for interactive 3D graphics applications. We introduce the idea of creating vertex and transformation streams that represent large point datasets via their interaction. We discuss how to factor such point datasets into a set of source vertices and transformation streams by identifying the most common translations amongst vertices. We accomplish this by identifying peaks in the cross-power spectrum of the dataset in the Fourier domain. We validate our approach by integrating it with a view-dependent point rendering system and show significant improvements in input geometry bandwidth requirements as well as rendering frame rates. (C) 2006 Elsevier Inc. All rights reserved.

关键词： stream programming arithmetic intensity geometry instancing transformation encoding streaming algorithms

来源：评论

学校读者我要写书评

暂无评论

Mapping stream programs onto multicore platforms by local search and genetic algorithm

引用

COMPUTER LANGUAGES SYSTEMS & STRUCTURES 2016年 46卷 182-205页

作者： Farhad, S. M. Nayeem, Muhammad Ali Rahman, Md. Khaledur Rahman, M. Sohel BUET Dept CSE Dhaka 1000 Bangladesh

This paper presents a number of novel metaheuristic approaches that can efficiently map stream graphs on multicores. A stream graph consists of a set of actors performing different functions communicating through edges. Orchestrating stream graphs on multi cores can be formulated as an Integer Linear programming (ILP) problem but ILP solver takes exponential time to provide an optimal solution. We propose metaheuristic algorithms to achieve near optimal solutions within a reasonable amount of time. We employ six different variants of the Hill-Climbing (HC) algorithm employing different tweak operators that produce excellent result extremely quickly. We also propose six different variants of Genetic Algorithm (GA) to examine how effective these variants can be in escaping the local optima. We finally combine HC and GA techniques (which is also known as 'memetic algorithm') to produce hybrid techniques that outperform the individual performance of HC and GA techniques. We compare our results with the results generated by the CPLEX optimization tool. Our best technique has achieved a geometric mean speedup of 7.42 x across a range of streamIt benchmarks on an eight-core processor. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： stream programming Metaheuristics Local search operator Compiler optimization Parallel programming Genetic algorithm Hybrid genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Achieving self-aware parallelism in stream programs

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2015年第2期18卷 949-962页

作者： Su, Yan Shi, Feng Talpur, Shahnawaz Wang, Yizhuo Hu, Sensen Wei, Jin Beijing Inst Technol Comp Sci Beijing 100081 Peoples R China Beijing Inst Technol Sch Comp Sci & Technol Beijing 100081 Peoples R China Mehran Univ Engn & Technol Dept Comp Syst Engn Jamshor Sindh Pakistan

The age of big data open the door to a new approach in data exploration and utilization. With the increasing complexities and dynamics of modern IT systems and services, it has become a challenge to effectively exploit parallelism on multicore platforms in computing systems that are heterogeneous, dynamic and decentralised. Self-aware software is a response to these demands in dealing with distributed applications in changing environments. It is a closed-loop system with a series of optimization strategies to adjust itself dynamicly during data processing. We focus on incorporating adaptation mechanisms into the stream programs for exposing distributed parallelism. In the traditional stream programming models, changing data and status normally require human supervision to adjust the stream graph for performance. As one-time optimization strategy, the reconfiguration and maintenance lead to costly and time-consuming procedures during the operating phase. To address these problems, we propose a self-aware stream programming model called streamAware. A key property of this model is that exposing self-aware parallelism in the message driven execution paradigm, which provides dynamic and reconfigurable stream graph in adapting to the data flow changes. The model defines the self-awareness loop based on finite state machine for stream applications to adjust their own stream graph with continuous optimization strategy. This paper presents three different self-aware systems built using streamAware. The empirical evaluation demonstrate how these systems can exploit self-aware parallelism using the Parsec benchmark problems, optimize performance per Watt, and respond to significant changes in stream processing.

关键词： Self-aware parallelism Reconfigration Multicore Message-driven execution stream programming Distributed computing

来源：评论

学校读者我要写书评

暂无评论

Exploiting controlled-grained parallelism in message-driven stream programs

引用

JOURNAL OF SUPERCOMPUTING 2014年第1期70卷 488-509页

作者： Su, Yan Shi, Feng Talpur, Shahnawaz Wei, Jin Tan, Hai Beijing Inst Technol Beijing 100081 Peoples R China Mehran Univ Engn & Technol Jamshoro Sindh Pakistan

With the increasing amount of parallelism obtainable on multicore platforms, stream programming has been proposed as an effective solution for exposing distributed parallelization. Nonetheless, a pressing demand of scheduling task and data parallelism in stream programming exists that can accomplish robust multicore performance in the face of varying application characteristics. This paper addresses the problem of scheduling task and data parallelism in stream programming. We present streamMDE, an asynchronous concurrency stream programming framework which offers a novel parallel programming model for scheduling task and data parallelism in the message-driven execution paradigm. A key property of this framework is exposing controlled-grained parallelism, which allows us to control the granularity of task and data parallelism in stream graph. Our empirical evaluation of streamMDE shows that higher efficiency of mixed task and data parallelism in stream programming can be exploited with the appropriate granularity control. The framework bridges the gap between the parallel scale and the architecture of stream programs and facilitates in designing and coding stream features in different schedules.

关键词： Controlled-grained parallelism Multicore Message-driven execution C++11 stream programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：