Results 1 - 10 of 274

Dataflow Graph Partitioning for the Id Compiler

by Yonald Chery, Prof Arvind, Campbell L. Searle
"... The multi-threaded compilation of Id poses problems due to its non-strictness. Non-strictness permits a yet to be computed result of a function application to be fed back as an argument to the computing function. As a result, a more efficient compile-time scheduling of the sub-expressions of a compu ..."
Abstract - Add to MetaCart
sharing the same synchronization requirements. Larger partitions would in turn be compiled to longer sequential instruction threads targeted for execution on a multi-threaded dataflow machine. Post-partitioning phases of compilation to facilitate multi-threaded style code generation have also been

The Coign Automatic Distributed Partitioning System

by Galen C. Hunt, Michael L. Scott, Galen C. Hunt, Michael L. Scott , 1999
"... Although successive generations of middleware (such as RPC, CORBA, and DCOM) have made it easier to connect distributed programs, the process of distributed application decomposition has changed little: programmers manually divide applications into sub-programs and manually assign those subprograms ..."
Abstract - Cited by 154 (9 self) - Add to MetaCart
scenario-based profiling. Later, Coign applies a graph-cutting algorithm to partition the application across a network and minimize execution delay due to network communication. Using Coign, even an end user (without access to source code) can transform a non-distributed application into an optimized

Improving Data-flow Analysis with Path Profiles

by Glenn Ammons, James R. Larus , 1998
"... Data-flow analysis computes its solutions over the paths in a control-flow graph. These paths---whether feasible or infeasible, heavily or rarely executed---contribute equally to a solution. However, programs execute only a small fraction of their potential paths and, moreover, programs' execut ..."
Abstract - Cited by 87 (2 self) - Add to MetaCart
Data-flow analysis computes its solutions over the paths in a control-flow graph. These paths---whether feasible or infeasible, heavily or rarely executed---contribute equally to a solution. However, programs execute only a small fraction of their potential paths and, moreover, programs

On Retiming Synchronous Data-Flow Graphs

by unknown authors
"... Many common iterative or recursive DSP applications can be represented by synchronous data-flow graphs (SDFGs). A great deal of research has been done attempting to optimize such applications through retiming. However, despite its proven effectiveness in transforming single-rate data-flow graphs to ..."
Abstract - Add to MetaCart
Many common iterative or recursive DSP applications can be represented by synchronous data-flow graphs (SDFGs). A great deal of research has been done attempting to optimize such applications through retiming. However, despite its proven effectiveness in transforming single-rate data-flow graphs

Semi-Static Dataflow

by Bruno R. Preiss, V. Carl Hamacher , 1994
"... In this paper we present a new dataflow execution model called semi-static dataflow. This model incorporates aspects of conventional static and dynamic dataflow architectures. Programs are partitioned into a collection of dataflow graphs. The execution of each of these graphs is the responsibilit ..."
Abstract - Add to MetaCart
In this paper we present a new dataflow execution model called semi-static dataflow. This model incorporates aspects of conventional static and dynamic dataflow architectures. Programs are partitioned into a collection of dataflow graphs. The execution of each of these graphs

Retiming synchronous data-flow graphs to reduce execution time

by Timothy W. O’Neil, Edwin H.-M. Sha - IEEE TRANSACTIONS ON SIGNAL PROCESSING , 2001
"... Many common iterative or recursive DSP applications can be represented by synchronous data-flow graphs (SDFGs). A great deal of research has been done attempting to optimize such applications through retiming. However, despite its proven effectiveness in transforming single-rate data-flow graphs to ..."
Abstract - Cited by 9 (3 self) - Add to MetaCart
Many common iterative or recursive DSP applications can be represented by synchronous data-flow graphs (SDFGs). A great deal of research has been done attempting to optimize such applications through retiming. However, despite its proven effectiveness in transforming single-rate data-flow graphs

Retiming Synchronous Data-Flow Graphs to Minimize Execution Time

by Timothy W. O'Neil, Edwin H.-M. Sha, Erik Jonsson , 2000
"... Many common iterative or recursive DSP applications can be represented by synchronous data-flow graphs (SDFGs). A great deal of research has been done attempting to optimize such applications through retiming. However, despite its proven effectiveness in transforming single-rate data-flow graphs t ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
Many common iterative or recursive DSP applications can be represented by synchronous data-flow graphs (SDFGs). A great deal of research has been done attempting to optimize such applications through retiming. However, despite its proven effectiveness in transforming single-rate data-flow graphs

Memory bounds for the distributed execution of a hierarchical synchronous data-flow graph

by Karol Desnos, Maxime Pelcat, Jean-francois Nezan, Slaheddine Aridhi - in SAMOS Proceedings , 2012
"... Abstract—This paper presents an application analysis tech-nique to define the boundary of shared memory requirements of Multiprocessor System-on-Chip (MPSoC) in early stages of devel-opment. This technique is part of a rapid prototyping process and is based on the analysis of a hierarchical Synchron ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Synchronous Data-Flow (SDF) graph description of the system application. The analysis does not require any knowledge of the system architecture, the mapping or the scheduling of the system application tasks. The initial step of the method consists of applying a set of transformations to the SDF graph so

Retiming Synchronous Data-Flow Graphs to Reduce Execution Time

by unknown authors
"... Many common iterative or recursive DSP applications can be represented by synchronous data-flow graphs (SDFGs). A great deal of research has been done attempting to optimize such applications through retiming. However, despite its proven effectiveness in transforming single-rate data-flow graphs to ..."
Abstract - Add to MetaCart
Many common iterative or recursive DSP applications can be represented by synchronous data-flow graphs (SDFGs). A great deal of research has been done attempting to optimize such applications through retiming. However, despite its proven effectiveness in transforming single-rate data-flow graphs

Retiming Synchronous Data-Flow Graphs to Minimize Execution Time £

by unknown authors
"... Many common iterative or recursive DSP applications can be represented by synchronous data-flow graphs (SDFGs). A great deal of research has been done attempting to optimize such applications through retiming. However, despite its proven effectiveness in transforming single-rate data-flow graphs to ..."
Abstract - Add to MetaCart
Many common iterative or recursive DSP applications can be represented by synchronous data-flow graphs (SDFGs). A great deal of research has been done attempting to optimize such applications through retiming. However, despite its proven effectiveness in transforming single-rate data-flow graphs
Results 1 - 10 of 274