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

26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Forsell, Martti Hiivala, Mikko VTT Tech Res Ctr Finland Platform Architectures Team FI-90571 Oulu Finland

ISBN: (纸本)9780769546766

Application portability between different multicore architecture-parallel programming paradigm/tool pairs is a big problem nowadays leading often to a complete rewrite of an application when switching from an architecture-paradigm pair to another. This is caused by a wide variety of architectural properties requiring different optimization techniques for different architectures, typically hiding the essence of (parallel) computation defined by the application. In this paper, we introduce the Multi-Core Portability Abstraction (MCPA) simplifying portability and implementation of parallel applications making use of shared memory. It abstracts away typical architecture dependent effects caused by latency, synchronization, and partitioning and acts as an executable intermediate abstraction/reference implementation as well as a tool for analyzing the intrinsic parallelism of the application and relative goodness of architectures in executing it. We give a short application example with performance measurements.

关键词： Parallel computing multicore architectures model of computation parallel programming application portability

来源：评论

学校读者我要写书评

暂无评论

The Collatz Process Embeds a Base Conversion Algorithm 14th

The Collatz Process Embeds a Base Conversion Algorithm

引用

15th International Conference on Reachability Problems (RP)

作者： Sterin, Tristan Woods, Damien Maynooth Univ Hamilton Inst Dept Comp Sci Maynooth Kildare Ireland

ISBN: (纸本)9783030617387;9783030617394

The Collatz process is defined on natural numbers by iterating the map T(x) = T-0(x) = x/2 when x is an element of N is even and T(x) = T-1(x) = (3x+ 1)/2 when x is odd. In an effort to understand its dynamics, and since Generalised Collatz Maps are known to simulate Turing Machines [Conway, 1972], it seems natural to ask what kinds of algorithmic behaviours it embeds. We define a quasi-cellular automaton that exactly simulates the Collatz process on the square grid: on input x is an element of N, written horizontally in base 2, successive rows give the Collatz sequence of x in base 2. We show that vertical columns simultaneously iterate the map in base 3. This leads to our main result: the Collatz process embeds an algorithm that converts any natural number from base 3 to base 2. We also find that the evolution of our automaton computes the parity of the number of 1s in any ternary input. It follows that predicting about half of the bits of the iterates T-i(x), for i = O(log x), is in the complexity class NC1 but outside AC(0). These results show that the Collatz process is capable of some simple, but non-trivial, computation in bases 2 and 3, suggesting an algorithmic approach to thinking about prediction and existence of cycles in the Collatz process.

关键词： Collatz map model of computation Reachability problem

来源：评论

学校读者我要写书评

暂无评论

Pcanel: A model driven component framework

Pcanel: A model driven component framework

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Xie, C Chen, WZ Shi, JY Zhejiang Univ Inst Comp Syst Hangzhou Peoples R China

ISBN: (纸本)0780385667

Modern embedded systems tend to be heterogeneous in the sense that components in a system have diverse interaction styles. Composition of subsystems with very different characteristic complicates embedded software development and challenges understandability, composability, and scalability of models. The paper describes a model driven component framework, Pcanel, to solve this problem. It proposes a hierarchical model structure and semantic framework that supports heterogeneous components. Pcanel drives component execution by models of computation, allowing the formal analysis, verification and validation of the embedded software. models explicitly represent the designer's understanding of the system, and capture the requirements and the design of the application. The paper will present the principles and techniques of Pcanel in details. Examples in terms of real systems will be given that illustrate how Pcanel addresses the heterogeneity nature and the assurance issues of embedded software composition.

关键词： model of computation hybrid system hierarchical heterogeneity model driven composition

来源：评论

学校读者我要写书评

暂无评论

YAPI: Application modeling for signal processing systems

YAPI: Application modeling for signal processing systems

引用

37th Annual Design Automation Conference (DAC)

作者： de Kock, EA Essink, G Smits, WJM van der Wolf, P Brunel, JY Kruijtzer, WM Lieverse, P Vissers, KA Philips Res Labs NL-5656 AA Eindhoven Netherlands

ISBN: (纸本)0780363159

We present a programming interface called YAPI to model signal processing applications as process networks. The purpose of YAPI is to enable the reuse of signal processing applications and the mapping of signal processing applications onto heterogeneous systems that contain hardware and software components. To this end, YAPI separates the concerns of the application programmer, who determines the functionality of the system, and the system designer, who determines the implementation of the functionality. The proposed model of computation extends the existing model of Kahn process networks with channel selection to support non-deterministic events. We provide an efficient implementation of YAPI in the form of a C++ run-time library to execute the applications on a workstation. Subsequently, the applications are used by the system designer as input for mapping and performance analysis in the design of complex signal processing systems. We evaluate this methodology on the design of a digital video broadcast system-on-chip.

关键词： Kahn process networks model of computation application modeling signal processing system-level design

来源：评论

学校读者我要写书评

暂无评论

models of computation for Origami 19

Models of Computation for Origami

引用

19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

作者： Ida, Tetsuo Univ Tsukuba Fac Engn Informat & Syst Tsukuba Ibaraki 3058573 Japan

ISBN: (纸本)9781538626269

We view origami as the machinery of geometric construction and study the formal models of origami. Origami successively transforms geometric objects by a set of fold rules. As in symbolic and numeric computation, in geometric construction by origami, we have a number of approaches to look into the process of the transformations. We give the overview of our research activities of abstracting origami as a model of computation, as part of the development of a computational origami system called Eos. In particular, we discuss the computation model that led to the design of an origami language for specifying the construction of origami.

关键词： computational origami model of computation formalization of origami

来源：评论

学校读者我要写书评

暂无评论

Behavioural economics: Classical and modern

引用

EUROPEAN JOURNAL OF THE HISTORY OF ECONOMIC THOUGHT 2015年第2期22卷 236-271页

作者： Kao, Ying-Fang Velupillai, K. Vela Univ Trento Sch Social Sci ASSRU I-38122 Trento Italy Univ Trento Dept Econ ASSRU I-38122 Trento Italy

In this paper, the origins and development of behavioural economics, beginning with the pioneering works of Herbert Simon and Ward Edwards, are traced and (critically) discussed. Two kinds of behavioural economics - classical and modern - are attributed, respectively, to the two pioneers. The mathematical foundations of classical behavioural economics are identified, largely, to be in the theory of computation and computational complexity;the mathematical basis for modern behavioural economics is claimed to be a notion of subjective probability. Individually rational economic theories of behaviour, with attempts to broaden - and deepen - the notion of rationality, challenging its orthodox variants, were decisively influenced by these two mathematical underpinnings.

关键词： subjective expected utility modern behavioural economics Classical behavioural economics subjective probability computational complexity model of computation C65 D01 C63 D03 B41

来源：评论

学校读者我要写书评

暂无评论

A model of Heterogeneous Display Component for Cyber-Physical Systems Simulation

A Model of Heterogeneous Display Component for Cyber-Physica...

引用

Computing Conference

作者： Feredj, Mohamed Laichi, Boualem Univ Sci & Technol Houari Boumediene Fac Comp Sci 32 Al Alia Algiers Algeria

ISBN: (纸本)9783031622830;9783031622816;9783031622809

Cyber-Physical Systems (CPSs) modeling consists to release an executable system model. The modeling process is composed of steps where each step is the refinement of the previous step with more details and the last step is the validation step. The validation of system can be done formally or by simulation. Since CPSs are heterogeneous and combine physics and computations, the formal validation is often difficult to apply and the validation by simulation is the only method to verify the correctness of the modeling process. The simulation of CPSs generates heterogeneous output data. So, the display of heterogeneous output data involves the use specific display components (SDCs) where each SDC can display one and only one type of output data. Indeed, the presence of important number of SDCs makes the design task not easy, because the knowledge of SDCs is indispensable for the simulation, and it prevents the reusability. As solution, we propose in this paper a model of heterogeneous display component (HDC) that allows the designer to use only one component to display different types of output data.

关键词： Cyber physical systems Heterogeneous models Heterogeneous simulation model of computation Actor methodology Software engineering

来源：评论

学校读者我要写书评

暂无评论

Building models of computation of Service-Oriented Software via Monitoring Performance Indicators 8

Building Models of Computation of Service-Oriented Software ...

引用

IEEE 8th International Conference on Service-Oriented Computing and Applications

作者： Athanasopoulos, Dionysis Pernici, Barbara Politecn Milan Elect Informat & Bioengn Dept Milan Italy

ISBN: (纸本)9781467394697

The typical pricing policy, offered by service providers, is on a pay-as-you-go basis, which is proportional to the resources consumed by services. However, providers do not expose the specification of the resource consumption of services. Thus, providers offer cost pre-calculators that are service-agnostic. Such cost pre-calculators take into account upper bounds of provided facilities, instead of an estimation of the resource consumption of a service. To help service providers in specifying the resource consumption of services, we propose an initial version of an automated approach that captures the resource consumption of services. To make it in an independent way of the used measurement units and of the infrastructure over which a service is hosted, our approach builds for a service a mathematical model of computation, estimating its computational performance that is directly related to its resource consumption. Our approach moves beyond the state-of-the-art, since it automatically builds a model of computation based on the interface of a service, instead of its source code, and based on the monitoring of the execution of a service by using its executable files, instead of the monitoring or the theoretical analysis of its source code. The evaluation of our approach in a set of basic case studies shows promising results.

关键词： Service-oriented software model of computation service interface performance indicators

来源：评论

学校读者我要写书评

暂无评论

An Empirical Evaluation of a Programming model for Context-Dependent Real-time Streaming Applications

An Empirical Evaluation of a Programming Model for Context-D...

引用

15th Annual International Conference on computational Science (ICCS)

作者： Do, Xuan Khanh Louise, Stephane Cohen, Albert CEA LIST PC172 F-91191 Gif Sur Yvette France Inria Parkas Team F-75005 Paris France

We present a first evaluation of a Programming model for real-time streaming applications on high performance embedded multi-and many-core systems. Realistic streaming applications are highly dependent on the execution context (usually of physical world), past learned strategies, and often real-time constraints. The proposed Programming model encompasses both real-time requirements, determinism of execution and context dependency. It is an extension of the well-known Cyclo-Static Dataflow (CSDF), for its desirable properties (determinism and composability), with two new important data-flow filters: Select-duplicate, and Transaction which retain the main properties of CSDF graphs and also provide useful features to implement real-time computational embedded applications. We evaluate the relevance of our programming model thanks to several real-life case-studies and demonstrate that our approach overcomes a range of limitations that use to be associated with CSDF models.

关键词： Parallelism Real-time model of computation Many-core Data-flow Redundancy Safety

来源：评论

学校读者我要写书评

暂无评论

Efficient Parallel Reinforcement Learning Framework Using the Reactor model 24

Efficient Parallel Reinforcement Learning Framework Using th...

引用

36th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)

作者： Kwok, Jacky Lohstroh, Marten Lee, Edward A. Univ Calif Berkeley Berkeley CA 94720 USA

ISBN: (纸本)9798400704161

Parallel Reinforcement Learning (RL) frameworks are essential for mapping RL workloads to multiple computational resources, allowing for faster generation of samples, estimation of values, and policy improvement. These computational paradigms require a seamless integration of training, serving, and simulation workloads. Existing frameworks, such as Ray, are not managing this orchestration efficiently, especially in RL tasks that demand intensive input/output and synchronization between actors on a single node. In this study, we have proposed a solution implementing the reactor model, which enforces a set of actors to have a fixed communication pattern. This allows the scheduler to eliminate work needed for synchronization, such as acquiring and releasing locks for each actor or sending and processing coordination-related messages. Our framework, Lingua Franca (LF), a coordination language based on the reactor model, also supports true parallelism in Python and provides a unified interface that allows users to automatically generate dataflow graphs for RL tasks. In comparison to Ray on a single-node multi-core compute platform, LF achieves 1.21x and 11.62x higher simulation throughput in OpenAI Gym and Atari environments, reduces the average training time of synchronized parallel Q-learning by 31.2%, and accelerates multi-agent RL inference by 5.12x.

关键词： Parallel Computing Reinforcement Learning Programming Languages Machine Learning model of computation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：