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

Interactive investigation of fluid mechanics data sets 90

IEEE Conference on Visualization

作者： S.M. Legensky Intelligent Light

ISBN: (纸本)9780818620836

FIELDVIEW, a visual analysis tool designed to facilitate the interactive investigation of fluid mechanics data sets by providing an easy-to-use interface to the flow field data, is presented. Operating on NASA Plot three-dimensional format data, FIELDVIEW computes scalar and vector flow quantities and displays them using a variety of representations, including animation. An interactive viewing interface allows free motion around the data under study to allow the researcher to locate and study the interesting flow features of three-dimensional fluid dynamic data.< >

关键词： data visualization Pipelines Computational intelligence NASA data flow computing Three dimensional displays Animation Fluid dynamics data engineering Computer interfaces

来源：评论

学校读者我要写书评

暂无评论

Stateless data flow Approach with Void Avoidance for Wireless Ad Hoc and Sensor Networks

Stateless Data Flow Approach with Void Avoidance for Wireles...

引用

International Symposium on Wireless Pervasive computing (ISWPC)

作者： Mujdat Soyturk D. Turgay Altilar Department of Computer Engineering Istanbul Technical University Istanbul Turkey

In this paper, we propose a void avoidance algorithm for the stateless weight routing (SWR) algorithm which was developed stateless geographical routing protocol for wireless sensor and ad hoc networks. In order to demonstrate the efficiency of the method we started with the illustration of transmission coverage of relay nodes during the course of routing in the SWR protocol. The threshold value to retransmit a packet defined in the SWR may be used for several purposes including elimination of the void problem. It can be shown that the threshold value provides a tool to balance the tradeoff between energy consumption and reliability.. A number of scenario has been considered to test the performance of the void avoidance (recovery!) algorithm. The initial simulation results indicates the proposed algorithm works with the SWR and providing it with an additional feature of adaptivity for wireless ad hoc and sensor networks.

关键词： Wireless sensor networks Routing protocols Network topology Ad hoc networks Scalability Energy efficiency Delay Computer networks data flow computing data engineering

来源：评论

学校读者我要写书评

暂无评论

Classification of General data flow Actors into Known Models of Computation

Classification of General Data Flow Actors into Known Models...

引用

ACM and IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE)

作者： Christian Zebelein Joachim Falk Christian Haubelt Jurgen Teich Hardware Software CoDesign University of Erlangen Nuremberg Erlangen Germany

Applications in the signal processing domain are often modeled by data flow graphs which contain both dynamic and static data flow actors due to heterogeneous complexity requirements. Thus, the adopted notation to model the actors must be expressive enough to accommodate dynamic data flow actors. On the other hand, treating static data flow actors like dynamic ones hinders design tools in applying domain-specific optimization methods to static parts of the model, e.g., static scheduling. In this paper, we present a general notation and a methodology to classify an actor expressed by means of this notation into the synchronous and cyclo-static dataflow models of computation. This enables the use of a unified descriptive language to express the behavior of actors while still retaining the advantage to apply domain-specific optimization methods to parts of the system. In experiments we could improve both latency and throughput of a general data flow graph application using our proposed automatic classification in combination with a static single-processor scheduling approach by 57%.

关键词： Computational modeling data flow computing flow graphs Decoding Automata Signal processing algorithms Production Optimization methods Algorithm design and analysis Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Combining constraints and data-flow in a visual query language

Combining constraints and data-flow in a visual query langua...

引用

IEEE Symposium on Visual Languages

作者： M. Chavda P.T. Wood Department of Computer Science University of Cape Town South Africa

We define a graph based visual query language for object databases, called QUIVER. Most graph based query languages proposed in the literature view queries either as constraint (pattern) graphs or as data flow graphs. QUIVER, however allows constraints and data flow to be combined in queries. This combination of constraints and data flow is motivated by the need to support comprehensive object models, such as that proposed by the Object data Management Group (ODMG). QUIVER supports all ODMG object model constructs, including computational constructs such as operations (methods). In addition, QUIVER supports computational query constructs such as subqueries and (aggregate) functions.

关键词： database languages Visual databases Computer science Cities and towns Africa Computational modeling data flow computing Aggregates Visualization Joining processes

来源：评论

学校读者我要写书评

暂无评论

Algena microprogrammable camac branch driver/controller

引用

IEEE Transactions on Nuclear Science 1972年第1期19卷 696-698页

作者： Oakes, Alan E. Lawrence Berkeley Laboratory Berkeley California United States

The computer and Branch Driver are the two most expensive devices associated with a typical CAMAC system. This paper describes a device which has been designed to replace both the computer and the Branch Driver of many systems - at less than half the cost. Algen (a contraction of algorithm generator) may also be used with a computer, serving as a unique Branch Driver which can relieve the computer program of many "housekeeping" duties.

关键词： CAMAC Costs Control systems Laboratories Cathode ray tubes Computer interfaces data flow computing Road transportation Physics Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

Stack-tagged dataflow 26

Stack-tagged dataflow

引用

26th IEEE International Symposium on Computer Architecture and High Performance computing Workshops, SBAC-PADW 2014

作者： Santiago, Leandro Marzulo, Leandro A.J. Goldstein, Brunno F. Alves, Tiago A.O. França, Felipe M.G. Dep. de Informática e Ciência da Computação Instituto de Matemática e Estatística - IMe Universidade Do Estado Do Rio de Janeiro - UERJ Rio de Janeiro Brazil Programa de Engenharia de Sistemas e Computação COPPE Universidade Federal Do Rio de Janeiro Rio de Janeiro Brazil

ISBN: (纸本)9781479970148

Dynamic dataflow allows simultaneous execution of instructions in different iterations of a loop, boosting parallelism exploitation. In this model, operands are tagged with their associated instance number, incremented as they go through the loop. Instruction execution is triggered when all input operand with the same tag become available. However, this traditional tagging mechanism often requires the generation of several control instructions to manipulate tags and guarantee the correct matching. To address this problem, this work presents Stack- Tagged dataflow, a tagging mechanism that uses stacks of tags to reduce control overheads in dataflow, while isolating context from different nested loops. Push instructions at the beginning of loops will create a new context, while Pop instructions, at the end of the loop, will restore the original context tags. Experimental results show that Stack-Tagged dataflow is a viable solution, suggesting that a hybrid compiling approach can be used to enable Stack- Tags only when needed. © 2014 IEEE.

关键词： data flow computing program control structures context isolation dataflow control overhead reduction nested loops pop instructions push instructions stack-tagged dataflow tagging mechanism Assembly Computer architecture Context Libraries Parallel processing Tagging Virtual machining dataflow Parallel Programming Stack Tag data flow TAGGING program control structures virtual machines Parallel programming Computer Architecture Furnace conveyors PARALLEL PROCESSING (COMPUTERS) Loops Libraries assemblies NESTED LOOPS virtual machining instruction

来源：评论

学校读者我要写书评

暂无评论

Tokenless static data flow using associative templates

Tokenless static data flow using associative templates

引用

Supercomputing Conference

作者： T.L. Sterling D.S. Wills E.Y. Chan Harris Corporation USA MIT Laboratory for Computer Science Government System Sector Harris Corporation USA

The static data-flow model of computation promises high-performance from fine-grained parallelism, but conventional token-driven static data-flow architectures are inefficient in terms of memory bandwidth and microcycles required per operation. The associative template mechanism, an application of associative techniques, uses specially configured content-addressable memories to provide efficient flow control for static data-flow program execution. It supports static data-flow semantics while exhibiting memory bandwidth and microcycle demands comparable to those of conventional uniprocessors. Associative diffusion, a second application of associative methods, provides a communication between adjacent nodes of a mesh-connected network of associative-template-based processors. This mechanism achieves nearest-neighbor communication at speeds comparable to intranode transactions by overlapping domains of associativity across boundaries between neighboring nodes. Together, associative templates and associative diffusion provide a token-free approach to static data-flow computation.< >

关键词： data flow computing Bandwidth Computer architecture Parallel processing Costs Laboratories Computer science Government Computational modeling Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

data handling and modularity in a supervision system

Data handling and modularity in a supervision system

引用

International Conference on Telecommunications Energy (INTELEC)

作者： M. Eriksson S. Sundqvist Ericsson Components AB Stockholm Sweden

The authors describe some of the software aspects dealt with in the Ericsson Energy Master (EEM) power supervision systems. A general overview emphasizing the user interface was previously presented (see P. Samisoe and M. Eriksson, 1987). Features of local-computer, main-computer, and communication-computer data handling are discussed.< >

关键词： data handling Hardware Computer interfaces data flow computing Power systems Collaboration User interfaces Telecommunication computing Multitasking Sensor systems

来源：评论

学校读者我要写书评

暂无评论

Software synthesis for dynamic data flow graph

Software synthesis for dynamic data flow graph

引用

International Workshop on Rapid System Prototyping (RSP)

作者： Chabong Choi Soonhoi Ha Multimedia Research Laboratory LG Electronics Limited Seoul South Korea Codesign and Parallel Processing Laboratory Seoul National University Seoul South Korea

ISBN: (纸本)0818680644

data flow graph is a useful computational model to describe the functionality of a digital system. To execute a data flow graph on a target system, it should be synthesized to the code to be compiled on the target system. Current research activities on software synthesis are mainly focused on Synchronous data flow (SDF) graph, which can not represent the control structure of the application. On the other hand, Dynamic data flow (DDF) graph can express the control structure, such as conditionals and data dependent iterations. This paper synthesizes a C code for a DDF graph which includes not only the functions associated with the nodes of the graph, but also the run-time scheduler and the run-time buffer manager which can execute a DDF graph without deadlock with bounded memory requirement. In addition, this paper suggests hierarchical implementation of DDF which enhances the efficiency of run-time scheduling by clustering SDF type nodes as a specific macro node.

关键词： flow graphs Runtime Digital systems Application software Laboratories data flow computing Control system synthesis Design automation Network synthesis Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

An interprocedural framework for determining efficient data redistributions in distributed memory machines

An interprocedural framework for determining efficient data ...

引用

Frontiers of Massively Parallel Computation

作者： S.K.S. Gupta S. Krishnamurthy Computer Science Department Colorado State University Fort Collins CO USA Computer and Information Science Ohio State Uinversity Columbus OH USA

This paper presents a framework to find good distributions for the global arrays at different program points in the presence of procedure calls. The distributions are chosen for their ability to offset the re-distribution overheads by contributing significantly towards increasing the performance gains. The algorithm uses interprocedural analysis and dynamic programming techniques. The working of the algorithm has been demonstrated for a CFD kernel.

关键词： Kernel Performance gain Computational fluid dynamics Programming profession data flow computing Computer science Computer languages Program processors Parallel processing Information science

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：