In this paper, we suggest a new object-oriented functional language, OOId, which is based on a functional language fd and extended with object-oriented language features. We also discuss how to map OOId program onto D...
详细信息
ISBN:
(纸本)0818682272
In this paper, we suggest a new object-oriented functional language, OOId, which is based on a functional language fd and extended with object-oriented language features. We also discuss how to map OOId program onto DAVRID, which is a kind of multithreaded architecture based on the dataflow model. The comparison of execution time of two programs written in fd and OOId for the matrix multiplication problem, shows we can effectively run OOId program with just a little slow-down of execution time. In addition, the rate of stow-down is decreased, as the size of the matrix is larger. That means we can use good features od object-oriented language by paying just a little slow-down of execution time.
The need to account for both spatial and temporal redundancy in dependable system design requires the use of abstractions that model both hardware and software. To answer this, the authors present a novel approach to ...
详细信息
The need to account for both spatial and temporal redundancy in dependable system design requires the use of abstractions that model both hardware and software. To answer this, the authors present a novel approach to designing dependable systems by using hardware/software codesign request-resource models. Out of this work, the authors aim to demonstrate how dependability analysis can be embedded into the design cycle, a currently difficult situation due to the difference in paradigms used to construct systems as opposed to analyzing them. A framework for dependable system design is presented to show how codesign models can be generated using rapid prototyping techniques. This framework is implemented in a design environment called ADEPT (ADvanced Environment Prototype Tool). Codesign models are built from a library of nodes that adhere to a dataflow model of computation. The prototype codesign models can then be analyzed for their functional, performance, and dependable characteristics. An example system using a 3N code was modeled to demonstrate the utility of the framework in doing trade-off analysis during its design.
Many signal processing systems make use of event driven mechanisms-typically based on finite state machines (FSMs)-to control the operation of the computationally intensive (dataflow) parts. The state machines in tur...
详细信息
ISBN:
(纸本)9780818677861
Many signal processing systems make use of event driven mechanisms-typically based on finite state machines (FSMs)-to control the operation of the computationally intensive (dataflow) parts. The state machines in turn are often fueled by external inputs as well as by feedback from the signal processing portions of the system. Packet-based transmission systems are a good example for such a close interaction between data and control flow. For a smooth design flow with a maximum degree of modularity it is of crucial importance to be able to model the complete functionality of the system, containing both control and dataflow, within one single design environment. While the degree of abstraction should be sufficiently high to model and simulate efficiently, the link to implementation has to be fully supported. For these reasons we developed a computational model that integrates the specification of control and dataflow. It combines the notion of multirate dynamic dataflow graphs with event driven process activation. Thus, it maintains the flexibility and expressive power of dataflow representations while enabling designers to efficiently control these operations by incorporating control automata that may have been designed using protocol compilers or state machine tools.
This paper introduces an algorithm that can generate huge node dataflow by compiling existing programs. The purpose of this algorithm is to improve the speed of parallel processing and utilize the large amount of exi...
详细信息
ISBN:
(纸本)0818678763
This paper introduces an algorithm that can generate huge node dataflow by compiling existing programs. The purpose of this algorithm is to improve the speed of parallel processing and utilize the large amount of existing program resources. In addition, this idea of huge node dataflow algorithm can also be used in distributed processing and multi-thread processing.
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 dataflow graphs....
详细信息
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 dataflow graphs. QUIVER, however allows constraints and dataflow to be combined in queries. This combination of constraints and dataflow 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.
dataflow graph is a useful computational model to describe the functionality of a digital system. To execute a dataflow graph on a target system, it should be synthesized to the code to be compiled on the target sys...
详细信息
ISBN:
(纸本)0818680644
dataflow graph is a useful computational model to describe the functionality of a digital system. To execute a dataflow 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 dataflow (SDF) graph, which can not represent the control structure of the application. On the other hand, Dynamic dataflow (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.
An innovative approach for high-level synthesis of digital circuits with semi-concurrent self-checking abilities is introduced, achieving a compromise between redundancy and checking effectiveness. Attention is mainly...
详细信息
An innovative approach for high-level synthesis of digital circuits with semi-concurrent self-checking abilities is introduced, achieving a compromise between redundancy and checking effectiveness. Attention is mainly focused on the data path, described as a general Sequencing Graph including linear paths as well as loops and branches. A reference architecture is defined; a technique allowing to reduce redundancy through resource sharing is then introduced, leading to synthesis of the self-checking architecture. An algorithm is proposed to simultaneously schedule and allocate the resources, while keeping error aliasing as reduced as possible. The desired checking periodicity is guarantee by the algorithm.
data now (DF) architecture resulting from the DF program representation by the functional language being developed at the Department of Computers and Informatics is proposed in the paper. The contribution is concentra...
详细信息
data now (DF) architecture resulting from the DF program representation by the functional language being developed at the Department of Computers and Informatics is proposed in the paper. The contribution is concentrated to the efficient implementation of functional language in the DF architecture supporting the idea of the programming parallel problems by specification and transformation using mathematical methods. The combination of a local control flow with a global dataflow model in the proposed DF architecture is connected with the direct operand matching mechanism using matching vectors. The concepts of the dataflow graph representation using the functional language, the approaches to the parallel execution of the functional program in the data now implementational environment and the DF architecture layout are presented in the paper. It is supposed that the hardware implementation of the architecture can be used as a specialised accelerator in problem-oriented computer systems with high requirements on the operation speed.
This paper describes optimization techniques for translating out-of-core programs written in a data parallel language to message passing node programs with explicit parallel I/O. We demonstrate that straightforward ex...
详细信息
This paper describes optimization techniques for translating out-of-core programs written in a data parallel language to message passing node programs with explicit parallel I/O. We demonstrate that straightforward extension of in-core compilation techniques does not work well for out-of-core programs. We then describe how the compiler can optimize the code by (1) determining appropriate file layouts for out-of-core arrays, (2) permuting the loops in the nest(s) to allow efficient file access, and (3) partitioning the available node memory among references based on I/O cost estimation. Our experimental results indicate that these optimizations can reduce the amount of time spent in I/O by as much as an order of magnitude.
暂无评论