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

13th International Conference on Application of Concurrency to System Design (ACSD)

作者： Delosme, Jean-Marc Hujsa, Thomas Munier-Kordon, Alix Univ Evry Val DEssonne IBISC Evry France Univ Paris 06 IBISC LIP6 Paris France Univ Paris 06 LIP6 Paris France

ISBN: (纸本)9780769550350

Join-Free Petri nets, whose transitions have at most one input place, model systems without synchronizations while Choice-Free Petri nets, whose places have at most one output transition, model systems without conflicts. These classes respectively encompass the state machines (or S-systems) and the marked graphs (or T-systems). Whereas a structurally bounded and structurally live Petri net graph is said to be "well-formed", a bounded and live Petri net is said to be "well-behaved". Necessary and sufficient conditions for the well-formedness of Join-Free and Choice-Free nets have been known for some time, yet the behavioral properties of these classes are still not well understood. In particular efficient sufficient conditions for liveness have not been found until now. In this paper, we extend results on weighted T-systems to the class of weighted Petri nets and present transformations which preserve the feasible sequences of transitions and reduce the initial marking. We introduce a notion of "balancing" that makes possible the transformation of conservative systems into so-called "1-conservative systems" while retaining the feasible transition sequences. This transformation leads to polynomial sufficient conditions of liveness for well-formed Join-Free and Choice-Free nets.

关键词： Join-Free Choice-Free S-system State Machine T-system Petri net weighted net liveness boundedness well-formedness well-behavedness balancing polynomial sufficient condition synchronous data flow

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Cache-Oblivious Scheduling of Streaming Applications

Brief Announcement: Cache-Oblivious Scheduling of Streaming ...

引用

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

作者： Agrawal, Kunal Fineman, Jeremy T. Washington Univ St Louis MO 63110 USA Georgetown Univ Washington DC 20057 USA

This paper considers the problem of cache-obliviously scheduling streaming pipelines on uniprocessors with the goal of minimizing cache misses. Our recursive algorithm is not parameterized by cache size, yet it achiev... 详细信息

ISBN: (纸本)9781450328210

关键词： Cache-Oblivious Algorithms Caching Partitioning Pipelines Scheduling Streaming synchronous data flow

来源：评论

学校读者我要写书评

暂无评论

LaminarIR: Compile-Time Queues for Structured Streams 15

LaminarIR: Compile-Time Queues for Structured Streams

引用

36th ACM SIGPLAN Conference on Programming Language Design and Implementation

作者： Ko, Yousun Burgstaller, Bernd Scholz, Bernhard Yonsei Univ Seoul 120749 South Korea Univ Sydney Sydney NSW 2006 Australia

ISBN: (纸本)9781450334686

Stream programming languages employ FIFO (first-in, first-out) semantics to model data channels between producers and consumers. A FIFO data channel stores tokens in a buffer that is accessed indirectly via read-and write-pointers. This indirect token-access decouples a producer's write-operations from the read-operations of the consumer, thereby making dataflow implicit. For a compiler, indirect token-access obscures data-dependencies, which renders standard optimizations ineffective and impacts stream program performance negatively. In this paper we propose a transformation for structured stream programming languages such as StreamIt that shifts FIFO buffer management from run-time to compile-time and eliminates splitters and joiners, whose task is to distribute and merge streams. To show the effectiveness of our lowering transformation, we have implemented a StreamIt to C compilation framework. We have developed our own intermediate representation (IR) called LaminarIR, which facilitates the transformation. We report on the enabling effect of the LaminarIR on LLVM's optimizations, which required the conversion of several standard StreamIt benchmarks from static to randomized input, to prevent computation of partial results at compile-time. We conducted our experimental evaluation on the Intel i7-2600K, AMD Opteron 6378, Intel Xeon Phi 3120A and ARM Cortex-A15 platforms. Our LaminarIR reduces data-communication on average by 35.9% and achieves platform-specific speedups between 3.73x and 4.98x over StreamIt. We reduce memory accesses by more than 60% and achieve energy savings of up to 93.6% on the Intel i7-2600K.

关键词： Languages Algorithms Performance stream programming synchronous data flow program transformation performance analysis compiler optimization

来源：评论

学校读者我要写书评

暂无评论

Self-organized Allocation of Dependent Tasks in Industrial Applications 2

Self-organized Allocation of Dependent Tasks in Industrial A...

引用

2nd IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS)

作者： Zheng, Ketong Schmitt, Eva Julia Gonzalez, Arturo Fettweis, Gerhard Tech Univ Dresden Vodafone Chair Mobile Commun Syst Dresden Germany

ISBN: (纸本)9781665412612

Self-organization is a powerful method to bring forward automation in industrial applications. However, tasks in such use cases often have high complexity and strong inter-dependencies, limiting the applicability of state-of-the-art self-organization algorithms. This paper studies self-organization algorithms that are suitable for task allocation in industrial manufacturing processes with strong task dependencies. Two algorithms based on the Response Threshold Model are proposed in this paper to fit task dependencies. For decision-making, they rely solely on local interactions between the involved agents and the environment. To analyze their performance, an upper bound of the achievable performance is calculated using methods from synchronous data flow. Simulations are performed under both homogeneous and heterogeneous agents and different task-switching costs. The results indicate that the DRTM FR-based algorithm, which evolves agents into a specialized team, has a better performance.

关键词： self-organization multi-agent systems task allocation response threshold model synchronous data flow

来源：评论

学校读者我要写书评

暂无评论

Semantic-Preserving Transformations for Stream Program Orchestration on Multicore Architectures

Semantic-Preserving Transformations for Stream Program Orche...

引用

作者： Yousun Ko University of Sydney

学位级别：博士

Because the demand for high performance with big data processing and distributed computing is increasing, the stream programming paradigm has been revisited for its abundance of parallelism in virtue of independent actors that communicate via data channels. The synchronous data-flow (SDF) programming model is frequently adopted with stream programming languages for its convenience to express stream programs as a set of nodes connected by data channels. Unlike general data-flow graphs, SDF re- quires the specification of the number of data items produced and consumed by a node already at compile-time. Static data-rates enable program transformations that greatly improve the performance of SDF programs on multicore architectures. The major appli- cation domain is for SDF programs are digital signal processing, audio, video, graphics kernels, networking, and security. The major optimization objective with stream programs is data throughput. Stream program orchestration is a term that denotes compiler optimizations and run-time tech- niques that aim at performance improvements of stream programs on multicore archi- tectures. A large body of research has already been devoted to stream program orches- tration. Nevertheless, current compilers and run-time systems for stream programming languages are not able yet to harvest the raw computing power of contemporary paral- lel architectures. We identify data channels as the dominating roadblock for achieving high performance of SDF programs. data channels between communicating nodes, i. e., between a producer and a consumer, employ FIFO-queue semantics. Funneling a data item (token) from a producer to a consumer through a FIFO queue incurs non-negligible overhead. The producer is required to perform an enqueue-operation, followed by a dequeue operation in the consumer. The enqueue and dequeue operations induce the run-time overhead of the underlying queue implementation. Queues on shared-memory multicores are implemented as bu

关键词： Multicore Architecture Stream Programming Languages synchronous data flow Compiler Optimization Performance Analysis Static Program Analysis

来源：评论

学校读者我要写书评

暂无评论

HEMLOCK: HEterogeneous ModeL Of Computation Kernel for SystemC

HEMLOCK: HEterogeneous ModeL Of Computation Kernel for Syste...

引用

作者： Patel, Hiren Dhanji Virginia Tech | University

As SystemC gains popularity as a System Level Design Language (SLDL) for System-On-Chip (SOC) designs, heterogeneous modelling and efficient simulation become increasingly important. The key in making an SLDL heterogeneous is the facility to express different Models Of Computation (MOC). Currently, all SystemC models employ a Discrete-Event simulation kernel making it difficult to express most MOCs without specific designer guidelines. This often makes it unnatural to express different MOCs in SystemC. For the simulation framework, this sometimes results in unnecessary delta cycles for models away from the Discrete-Event MOC, hindering the simulation performance of the model. Our goal is to extend SystemC’s simulation framework to allow for better modelling expressiveness and efficiency for the synchronous data flow (SDF) MOC. The SDF MOC follows a paradigm where the production and consumption rates of data by a function block are known a priori. These systems are common in Digital Signal Processing applications where relative sample rates are specified for every component. Knowledge of these rates enables the use of static scheduling. When compared to dynamic scheduling of SDF models, we experience a noticeable improvement in simulation efficiency. We implement an extension to the SystemC kernel that exploits such static scheduling for SDF models and propose designer style guidelines for modelers to use this extension. The modelling paradigm becomes more natural to SDF which results to better simulation efficiency. We will distribute our implementation to the SystemC community to demonstrate that SystemC can be a heterogeneous SLDL.

关键词： Models Of Computation System Level Modelling SystemC Heterogeneous Modelling Discrete-Event Simulation Embedded Systems synchronous data flow Thesis

来源：评论

学校读者我要写书评

暂无评论

Look Into Details: The Benefits of Fine-Grain Streaming Buffer Analysis

引用

ACM SIGPLAN NOTICES 2010年第4期45卷 27-36页

作者： Foroozannejad, Mohammad H. Hashemi, Matin Hodges, Trevor L. Ghiasi, Soheil Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA

Many embedded applications demand processing of a seemingly endless stream of input data in realtime. Productive development of such applications is typically carried out by synthesizing software from high-level specifications, such as dataflow graphs. In this context, we study the problem of inter-actor buffer allocation, which is a critical step during compilation of streaming applications. We argue that fine-grain analysis of buffers' spatio-temporal characteristics, as opposed to conventional live range analysis, enables dramatic improvements in buffer sharing. Improved sharing translates to reduction of the compiled binary memory footprint, which is of prime concern in many embedded systems. We transform the buffer allocation problem to two-dimensional packing using complex polygons. We develop an evolutionary packing algorithm, which readily yields buffer allocations. Experimental results show an average of over 7X and 2X improvement in total buffer size, compared to baseline and conventional live range analysis schemes, respectively.

关键词： Algorithms Performance Streaming applications Software synthesis synchronous data flow Buffer management Optimization

来源：评论

学校读者我要写书评

暂无评论

Postscheduling Buffer Management Trade-Offs in Streaming Software Synthesis

引用

ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS 2012年第3期17卷 27-27页

作者： Foroozannejad, Mohammad H. Hodges, Trevor Hashemi, Matin Ghiasi, Soheil Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA

Streaming applications, which are abundant in many disciplines such as multimedia, networking, and signal processing, require efficient processing of a seemingly infinite sequence of input data. In the context of streaming software synthesis from data flow graphs, we study the inherent trade-off between memory requirement and compilation runtime, under a given task firing schedule. We utilize postscheduling analysis granularity to control the amount of details in characterization of buffer's spatio-temporal footprints. Subsequently, we transform the buffer allocation problem to two-dimensional packing of polygons, where complexity of the packing problem (e. g., polygon shapes) is determined by the analysis granularity. We develop an evolutionary packing optimization algorithm which readily yields buffer allocations. Experimental results highlight the trade-off between complexity of the analysis and the total buffer size of generated implementations. In addition, they show dramatic improvements in total buffer size, if one is willing to pay the additional cost in optimization runtime.

关键词： Algorithms Performance Streaming applications software synthesis synchronous data flow postscheduling buffer management optimization

来源：评论

学校读者我要写书评

暂无评论

Towards Computational Hybrid System Semantics for Time-Based Block Diagrams

引用

IFAC Proceedings Volumes 2009年第17期42卷 376-385页

作者： Pieter J. Mosterman Justyna Zander Gregoire Hamon Ben Denckla The MathWorks Natick MA 01760 USA Fraunhofer Institute FOKUS 10589 Berlin Germany Denckla Consulting Los Angeles CA USA

At the core of Model-Based Design, computational models have caused an autocatalytic trend to use computation in design by unlocking the potential of model transformations. Precisely specifying a computational transformation requires well-defined semantics of the source and target representations. In this regard, continuous-time behavior is an essential aspect of time-based block diagrams that is typically approximated by numerical integration. The corresponding theory, however, is mostly concerned with local error and the mathematical semantics of long time behavior fails to be sufficiently precise from a computational perspective. In this work, first a computational semantics is developed based on a multi-stage variablestep solver. Next, the computational semantics of the discrete and continuous parts of hybrid systems and their interaction are formalized in a unifying framework. The framework exploits a successful functional approach to defining discrete-time and discrete-event behavior established in other work. Unification is then achieved by developing a computational representation of the continuous-time behavior as pure functions on streams.

关键词： Computational methods Computer simulation Computer-aided control system design Embedded systems Numerical simulation synchronous data flow Systems design Variable-structure systems Verification Zero crossings

来源：评论

学校读者我要写书评

暂无评论

INTER-ENTERPRISE COLLABORATIVE PROCESSES IN A PURE BTO AUTOMOTIVE MANUFACTURING SYSTEM

引用

IFAC Proceedings Volumes 2006年第3期39卷 297-302页

作者： Nayabi H Kasra Baumgaertel Hartwig Bischoff Juergen Mandel Joerg Fraunhofer IPA DaimlerChrysler Research and Technology

Today, the auto industry is facing new challenges, finding itself in a critical phase of transition. These challenges include increased international competition, overcapacity, low margins, increased product complexity, and changing customer behaviour. Both academics and practitioners have been considering Build-to-Order (BTO) as an alternative manufacturing concept to today's forecast-based production system. However, little research has been done on inter-enterprise planning and execution processes in a pure BTO manufacturing environment. This paper outlines a proposal for new planning and execution processes and the supporting ICT systems in a pure BTO manufacturing environment in the automotive industry.

关键词： agile manufacturing automobile industry communication systems JIT manufacturing planning processes synchronous data flow

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：