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

Towards a heterogeneous simulation kernel for system-level models: A SystemC kernel for synchronous data flow models

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2005年第8期24卷 1261-1271页

作者： Patel, HD Shukla, SK Virginia Polytech Inst & State Univ Dept Elect & Comp Engn Blacksburg VA 24061 USA

As SystemC gains popularity as a modeling language of choice for system-on-chip (SoC) designs, heterogeneous modeling in SystemC and efficient simulation become increasingly important. However, in the current reference implementation, all SystemC models are simulated through a nondeterministic discrete-event (DE) simulation kernel that schedules events at run time mimicking other models of computation (MoCs) using DE, which may get cumbersome. This sometimes results in too many delta cycles hindering the simulation performance of the model. SystemC also uses this simulation kernel as the target simulation engine. This makes it difficult to express different MoCs naturally in SystemC. In an SoC model, different components may need to be naturally expressible in different MoCs. These components may be amenable to static scheduling-based simulation or other presimulation optimization techniques. The goal is to create a simulation framework for heterogeneous SystemC models and to gain efficiency and ease of use within the framework of SystemC reference implementation. In this paper, a synchronous data flow (SDF) kernel extension for SystemC is introduced. Experimental results showing improvement in simulation time are also presented.

关键词： embedded system design heterogeneous models of computation simulation efficiency synchronous data flow SystemC

来源：评论

学校读者我要写书评

暂无评论

Representation of synchronous, asynchronous, and polychronous components by clocked guarded actions

引用

DESIGN AUTOMATION FOR EMBEDDED SYSTEMS 2014年第1-2期18卷 63-97页

作者： Brandt, Jens Gemuende, Mike Schneider, Klaus Shukla, Sandeep K. Talpin, Jean-Pierre Univ Kaiserslautern Dept Comp Sci D-67653 Kaiserslautern Germany Virginia Tech Elect & Comp Engn Blacksburg VA USA INRIA Unite Rech Rennes Bretagne Atlantique Rennes France

For the design of embedded systems, many languages are in use, which are based on different models of computation such as event-, data-, and clock-driven paradigms as well as paradigms without a clear notion of time. Systems composed of such heterogeneous components are hard to analyze so that mainly co-simulation by coupling different simulators has been considered so-far. In this article, we propose clocked guarded actions as a unique intermediate representation that can be used as a common basis for simulation, analysis, and synthesis. We show how synchronous, (untimed) asynchronous, and polychronous languages can be translated to clocked guarded actions to demonstrate that our intermediate representation is powerful enough to capture rather different models of computation. Having a unique and composable intermediate representation of these components at hand allows one a simple composition of these components. Moreover, we show how clocked guarded actions can be used for verification by symbolic model checking and simulation by SystemC.

关键词： models of computation Co-simulation Synchronous vs. asynchronous models Guarded command language

来源：评论

学校读者我要写书评

暂无评论

Less Is More in the Fifties: Encounters between Logical Minimalism and Computer Design during the 1950s

引用

IEEE ANNALS OF THE HISTORY OF COMPUTING 2018年第1期40卷 19-45页

作者： De Mol, Liesbeth Bullynck, Maarten Daylight, Edgar G. Univ Lille 3 Villeneuve Dascq France Univ Paris VIII St Denis France Siegen Univ Sch Media & Informat Siegen Germany Katholieke Univ Leuven Dept Comp Sci Hist Comp Leuven Belgium

This article frames some important computing developments of the 1950s, connecting them to two older traditions, one within (mathematical) logic and one within engineering. Both traditions could be termed logical minimalism, meaning the systematic use of (mathematical) logic in designing minimal systems and devices. The logical tradition is part of the more general research program into the foundations of mathematics and logic that was carried out in the beginning of the 20th century. The engineering tradition then emerged during the 1930s to design relay circuits and is part of a more general trend of using mathematical techniques in engineering. In the 1940s and 1950s, however, these traditions were redefined and (re) appropriated when computer engineers, logicians and mathematicians started searching for the small(est) and/or simple(st) machines with an eye on engineering a small and relatively cheap digital computer. The main focus is on how the transition of symbolic machines such as Turing's into real computers integrates minimalist philosophies as parts of more complex computer design strategies. The ensuing tradeoffs such as more involved and complex programming or a need for more memory for efficient operation are also discussed.

关键词： abstract devices automata Boolean algebra Computers design aids Design methodology design styles History history of computing history of design in computing logic design minicomputers models of computation Switching circuits switching theory system implementation systems organization Turing machines

来源：评论

学校读者我要写书评

暂无评论

The case for hypercomputation

引用

APPLIED MATHEMATICS AND computation 2006年第1期178卷 8-24页

作者： Stannett, Mike Univ Sheffield Dept Comp Sci Sheffield S1 4DP S Yorkshire England

The weight of evidence supporting the case for hypercomputation is compelling. We examine some 20 physical and mathematical models of computation that are either known or suspected to have super-Turing or hypercomputational capabilities, and argue that there is nothing in principle to prevent the physical implementation of hypercomputational systems. Hypercomputation may indeed be intrinsic to physics;recursion 'emerges' from hypercomputation in the same way that classical physics emerges from quantum theory as scale increases. Furthermore, even if hypercomputation were one day shown to be physically infeasible, there would still remain a role for hypercomputation as an organising principle for advanced research. (c) 2005 Elsevier Inc. All rights reserved.

关键词： hypercomputation super-turing machine theory of computer science models of computation philosophy of mathematics temporal structure natural computation

来源：评论

学校读者我要写书评

暂无评论

Homonym Population Protocols

引用

THEORY OF COMPUTING SYSTEMS 2018年第5期62卷 1318-1346页

作者： Bournez, Olivier Cohen, Johanne Rabie, Mikael Ecole Polytech LIX F-91128 Palaiseau France Univ Paris 11 LRI Batiment 425 F-91405 Orsay France ENS Lyon LIP F-69007 Lyon France

The population protocol model was introduced by Angluin et al. as a model of passively mobile anonymous finite-state agents. This model computes a predicate on the multiset of their inputs via interactions by pairs. The original population protocol model has been proved to compute only semilinear predicates and has been extended in various ways. In the community protocol model by Guerraoui and Ruppert, the n agents have unique identifiers but may only store a finite number of the identifiers they already heard about. The community protocol model is known to provide the power of a non-deterministic Turing machine with an O (n log n) space. We consider variants of the two above-mentioned models and we obtain a whole landscape that covers and extends already known results. Namely, by considering the case of homonyms, that is to say the case when several agents may share the same identifier, we provide a hierarchy that goes from the case of no identifier (population protocol model) to the case of unique identifiers (community protocol model). In particular, we obtain that any Turing Machine on space O(log(O(1)) n) can be simulated with log(n)(r) identifiers, for any r > 0. Our results also extend and revisit the hierarchy provided by Chatzigiannakis et al. on population protocols carrying Turing Machines on limited space, reducing the gap left by this work between per-agent space o(loglog n) (proved to be equivalent to population protocols) and Omega(log n) (proved to be equivalent to Turing machines): We prove that per-agent space circle dot(loglog n) corresponds to symmetric predicates computable in polylogarithmic non-deterministic space.

关键词： Population protocols Homonyms Anonymity Distributed computing models of computation computation theory

来源：评论

学校读者我要写书评

暂无评论

Modeling Energy-Time Trade-Offs in VLSI computation

引用

IEEE TRANSACTIONS ON COMPUTERS 2012年第4期61卷 530-547页

作者： Bingham, Brad D. Greenstreet, Mark R. UBC Dept Comp Sci Vancouver BC V6T 1Z4 Canada

The performance of today's computers is limited primarily by power consumption rather than the number of instructions executed. Because the energy required to perform an operation using VLSI circuits drops rapidly with the time allowed for the operation, many slow processors can complete a parallel computation using less time and less energy than a fast uniprocessor that can execute the best sequential algorithm. This motivates designing algorithms for minimum execution time subject to energy constraints. We propose a simple model for analyzing algorithms that reflects the energy-time trade-offs of CMOS circuits. Using this model, we derive lower bounds for the energy-constrained execution time of sorting, addition, and multiplication, each with bitwise inputs, and we present algorithms that meet these bounds. These lower bounds are based on the energy-time costs of communication distance, rather than bisectional bandwidth arguments typical of area-time lower bounds. We show that minimizing time under energy constraints is not the same as minimizing operation count or computation depth. This work establishes a tractable method for the evaluation of parallel computations in a power-constrained environment.

关键词： models of computation energy-time trade-offs parallel computation energy-aware computing

来源：评论

学校读者我要写书评

暂无评论

Taming heterogeneity the Ptolemy approach

引用

PROCEEDINGS OF THE IEEE 2003年第1期91卷 127-144页

作者： Eker, J Janneck, JW Lee, EA Liu, J Liu, XJ Ludvig, J Neuendorffer, S Sachs, S Xiong, YH Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA Athena Semicond Inc Fremont CA 94538 USA

Modern embedded computing systems tend to be heterogeneous in the sense of being composed of subsystems with very different characteristics, which communicate and interact in a variety of ways-synchronous or asynchronous, buffered or unbuffered, etc. Obviously, when designing such systems, a modeling language needs to reflect this heterogeneity. Today's modeling environments usually offer a variant of what we call amorphous heterogeneity to address this problem. This paper argues that modeling systems in this manner leads to unexpected and hard-to-analyze interactions between the communication mechanisms and proposes a more structured approach to heterogeneity, called hierarchical heterogeneity, to solve this problem. It proposes a model structure and semantic framework that support this form of heterogeneity, and discusses the issues arising from heterogeneous component interaction and the desire for component reuse. It introduces the notion of domain polymorphism as a way to address these issues.

关键词： component-based design embedded systems heterogeneous modeling models of computation

来源：评论

学校读者我要写书评

暂无评论

Exploring Multi-Paradigm Modeling Techniques

引用

SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL 2009年第11-12期85卷 688-708页

作者： Hardebolle, Cecile Boulanger, Frederic SUPELEC Dept Comp Sci F-91192 Gif Sur Yvette France

Multi-Paradigm Modeling (MPM) addresses the necessity of using multiple modeling paradigms when designing complex systems. Because of its multidisciplinary nature, the MPM field involves research teams with technical backgrounds as different as control science, model checking, modeling language engineering or system-on-chip development. In this paper, we propose to explore the MPM domain through a survey of existing techniques from different horizons. Since the heterogeneity of models is at the heart of MPM, we first identify the sources of this heterogeneity and introduce the problems it raises. Then we show how the different existing techniques address these problems.

关键词： multi-paradigm modeling heterogeneous models transformation of models metamodeling composition of models models of computation heterogeneous interactions cosimulation component composition

来源：评论

学校读者我要写书评

暂无评论

PRAMS WITH VARIABLE WORD-SIZE

引用

INFORMATION PROCESSING LETTERS 1992年第4期42卷 217-222页

作者： VAIDYANATHAN, R HARTMANN, CRP VARSHNEY, PK SYRACUSE UNIV SCH COMP & INFORMAT SCISYRACUSENY 13244 SYRACUSE UNIV DEPT ELECT & COMP ENGNSYRACUSENY 13244

The Parallel Random Access Machine (PRAM) is one of the most widely used models of parallel computation. It abstracts the solution to a problem from details of communication and synchronization. The PRAM also abstracts the solution from the word-size of the processors and the memory. In this paper, the effect of relaxing the assumption of a fixed memory word-size is investigated and we show that this can lead to faster algorithms. We propose a model in which the processors can view the memory as made up of as "small" words (of contiguous bits) as deemed necessary. This "fine-grained memory" model will be called the M-PRAM. Like the PRAM, the M-PRAM can be EREW, CREW or CRCW depending on the restrictions on its memory accesses.

关键词： computationAL COMPLEXITY models of computation PARALLEL ALGORITHMS PARALLEL RANDOM ACCESS MACHINES

来源：评论

学校读者我要写书评

暂无评论

Complete simulation of automata networks

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2020年第0期109卷 1-21页

作者： Bridoux, Florian Castillo-Ramirez, Alonso Gadouleau, Maximilien Aix Marseille Univ Toulon Univ LIS CNRS Marseille France Univ Guadalajara Ctr Univ Ciencias Exactas & Ingn Dept Matemat Guadalajara Jalisco Mexico Univ Durham Dept Comp Sci South Rd Durham DH1 3LE England

Consider a finite set A and n >= 1. We study complete simulation of transformations of A(n), also known as automata networks. For m >= n, a transformation of A(m) is n-complete of size m if it may simulate every transformation of A(n) by updating one register at a time. Using tools from memoryless computation, we establish that there is no n-complete transformation of size n, but there is one of size n + 1. By studying various constructions, we conjecture that the maximal time of simulation of any n-complete transformation is at least 2n. We also investigate the time and size of sequentially n-complete transformations, which may simulate every finite sequence of transformations of A(n). Finally, we show that there is no n-complete transformation updating all registers in parallel, but there exists one updating all but one register in parallel. This illustrates the strengths and weaknesses of sequential and parallel models of computation. (C) 2019 Elsevier Inc. All rights reserved.

关键词： Complete simulation Automata networks Memoryless computation Transformation semigroups Symmetric group models of computation computational difficulty

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：