Buffer assignment algorithms for data driven architectures /
algorithms have been shown to be O(V x E) and O(V'xlogV) re
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1994.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | algorithms have been shown to be O(V x E) and O(V'xlogV) re An algorithm for buffer distribution in a balanced Data Flow Buffers are therefore inserted to ensure these conditions. Data driven architectures designed to achieve high data driven architectures with large node sizes. Performance flow graph to have no accumulation of data at its nodes and Graph, DFG is proposed. The number of buffers in the novel buffer distribution algorithm to maximize the number of buffers as achieved by integer programming of buffers obtained by this algorithm is substantially less performance and throughput require the corresponding data pipelining and throughput has also been proposed. The number proposed buffer distribution strategy is equal to the minimum results indicate that the proposed strategies outperform all simultaneous arrival of all input data to a multi-input node. spectively; an improvement over the existing strategies. A techniques. We also propose an extension of this algorithm than the existing schemes and can be effectively applied to the DFG intact. The time complexities of the proposed the DFG while keeping the functionality and performance of the existing strategies in terms of the number of buffers, which can further reduce the number of buffers by altering while possessing the lowest time complexities. |
|---|---|
| Item Description: | "Major subject: Computer Science". Vita. |
| Physical Description: | viii, 39 leaves : illustrations ; 28 cm. Also available online. |
| Bibliography: | Includes bibliographical references. |