Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 20 for “"Data flow computing"”.

  1. Taskmaster: an interactive, graphical environment for task specification, execution and monitoring

    … Tool Composition, Structured Analysis and Data Flow Computing to support user task specifications. Problem solving in the Taskmaster environment consists of decomposing the problem task into a partially ordered set of high-level subtasks. This decomposition is depicted graphically as a …

    vt Repository record for Taskmaster: an interactive, graphical environment for task specification, execution and monitoring (opens in a new tab)

  2. Removing unimportant computations in interprocedural program analysis

    … work in three classes of program analyses: flowsensitive dataflow analysis, context-sensitive dataflow analysis, and reachabilitybased analysis. We propose new algorithms to reduce this inefficiency. We are interested in analysis problems and programs that involve pointers, because they are …

    texas Repository record for Removing unimportant computations in interprocedural program analysis (opens in a new tab)

  3. Weakest Pre-Condition and Data Flow Testing

    Current data flow testing criteria cannot be applied to test array elements for two reasons: 1. The criteria are defined in terms of graph theory which is insufficiently expressive to investigate array elements. 2. Identifying input data which test a specified array element is an unsolvable …

    portland-state Repository record for Weakest Pre-Condition and Data Flow Testing (opens in a new tab)

  4. Efficient fault tolerance for pipelined structures and its application to superscalar and dataflow machines

    … this dissertation proposes using a tiled-data ow model of computation because it enables the design of scalable, resource-rich computational substrates. Starting with the WaveScalar tiled-data flow architecture, we enhance the reliability of its datapath, including computational logic, …

    texas Repository record for Efficient fault tolerance for pipelined structures and its application to superscalar and dataflow machines (opens in a new tab)

  5. Flow grammars: a methodology for automatically constructing static analyzers

    A new control flow model called flow grammars is introduced which unifies the treatment of intraprocedural and interprocedural control flow. This model provides excellent support for the rapid prototyping of flow analyzers. Flow grammars are an easily understood, easily constructed and flexible …

    uvic Repository record for Flow grammars: a methodology for automatically constructing static analyzers (opens in a new tab)

  6. Resource Utilization Model for the Algorithm to Architecture Mapping Model

    … for the enhanced ATAMM model for a real-time data flow architecture, is presented in this research. The Algorithm To Architecture Mapping Model, ATAMM, is a Petri net based graph theoretic model developed at Old Dominion University, and is capable of modeling the execution of large-grained …

    odu Repository record for Resource Utilization Model for the Algorithm to Architecture Mapping Model (opens in a new tab)

  7. Using Dataflow Optimization Techniques with a Monadic Intermediate Language

    Our work applies the dataflow algorithm to an area outside its traditional scope: functional languages. Our approach relies on a monadic intermediate language that provides low-level, imperative features like computed jumps and explicit allocations, while at the same time supporting high-level, …

    portland-state Repository record for Using Dataflow Optimization Techniques with a Monadic Intermediate Language (opens in a new tab)

  8. Cyclo-Static Scheduling of Large Grain Dataflow Algorithms on a Local Area ATAMM Multicomputing Testbed

    … scheduling deterministic large grain dataflow (LGDF) algorithms for distributed execution on loosely coupled multicomputer architectures is presented in this research. The computational paradigm used is the ODU/NASA developed Algorithm To Architecture Mapping Model (ATAMM), which …

    odu Repository record for Cyclo-Static Scheduling of Large Grain Dataflow Algorithms on a Local Area ATAMM Multicomputing Testbed (opens in a new tab)

  9. Capsules: expressing composable computations in a parallel programming model

    … and adjustment of granularity for both data and computation over iteration space and computation space. The Capsules model not only allows the user to express the decision on granularity of execution, but also the decision on the granularity of garbage collection (and therefore, the …

    gatech Repository record for Capsules: expressing composable computations in a parallel programming model (opens in a new tab)

  10. Silicon Compilation and Test for Dataflow Implementations in GasP and Click

    … on design compilation and test support for dataflow applications. Both parts are necessary to go from self-timed circuits to large-scale hardware systems. As part of the research in design compilation, the ARCwelder compiler designed by Willem Mallon (previously with NXP and Philips …

    portland-state Repository record for Silicon Compilation and Test for Dataflow Implementations in GasP and Click (opens in a new tab)

  11. Fault Tolerance in Critical Real-Time Systems

    … fault tolerant strategies for any given DFG (Data Flow Graph) are discussed. DFG models are developed using the strategies and the resulting worst case performances a.re evaluated. A comparison of the different strategics is made to demonstrate the differences in performance. Such a comparison …

    odu Repository record for Fault Tolerance in Critical Real-Time Systems (opens in a new tab)

  12. Scheduling Processors for Distributed, Critical, Real-Time Systems

    … inputs. The applica­ tions are described by a data flow graph model which guarantees performance. Given the data flow graph representation, processors are scheduled to complete tasks as specified in the representation. The scheduling technique separates the scheduling of tasks in time and the …

    odu Repository record for Scheduling Processors for Distributed, Critical, Real-Time Systems (opens in a new tab)

  13. Resource/Dataflow Graph Operating System Development

    Implementation of a new dataflow schedule model is the objective of this thesis. The dataflow model algorithm called the resource/dataflow graph model is implemented on a peer-to-peer communication network comprising of six personal computers. This dataflow model is implemented making use of an …

    odu Repository record for Resource/Dataflow Graph Operating System Development (opens in a new tab)

  14. Dataflow Processing in Memory Achieves Significant Energy Efficiency

    … the performance of streaming applications. Some data centers have shown servers being idle three out of four clocks. High performance instruction sequenced systems are not energy efficient. The execute stage of even simple pipeline processors only use 9% of the pipeline's total energy. A hybrid …

    unt Repository record for Dataflow Processing in Memory Achieves Significant Energy Efficiency (opens in a new tab)

  15. Design of Ternary Operations Utilizing Flow-Based Computing

    … of Dennard scaling and slowing of Moore's Law. Flow-based designs have been used to develop binary adders and multipliers. Data stored on non-volatile memristors are used to direct the flow of current through nanowires arranged in a crossbar. The algorithmic design of the flow-based crossbar is …

    ucf Repository record for Design of Ternary Operations Utilizing Flow-Based Computing (opens in a new tab)

  16. An Adaptive Dataflow Scheduler for an N-Processor Architecture

    … execution in a Multiple Instruction, Multiple Data (MIMD) computer system architecture, such as that used in aircraft flight simulation, is addressed. Of the standard scheduling approaches discussed, the method employing a combination of synchronous (repetitive) and asynchronous (event-driven) …

    ucf Repository record for An Adaptive Dataflow Scheduler for an N-Processor Architecture (opens in a new tab)

  17. Incremental Analysis of Programs

    Algorithms used to determine the control and data flow properties of computer programs are generally designed for one-time analysis of an entire new input. Application of such algorithms when the input is only slightly modified results in an inefficient system. In this theses a set of incremental …

    ucf Repository record for Incremental Analysis of Programs (opens in a new tab)