The program dependence graph and its use in optimization
ACM Transactions on Programming Languages and Systems (TOPLAS)
Resource requirements of dataflow programs
ISCA '88 Proceedings of the 15th Annual International Symposium on Computer architecture
I-structures: data structures for parallel computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Epsilon dataflow processor
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Some results on exact data dependence analysis
Selected papers of the second workshop on Languages and compilers for parallel computing
Desirable code transformations for a concurrent machine
Selected papers of the second workshop on Languages and compilers for parallel computing
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
On the combination of hardware and software concurrency extraction methods
MICRO 20 Proceedings of the 20th annual workshop on Microprogramming
Optimizing supercompilers for supercomputers
Optimizing supercompilers for supercomputers
Hardware extraction of low-level concurrency from sequential instruction streams (parallelism, implementation, architecture, dependencies, semantics)
On program restructuring, scheduling, and communication for parallel processor systems
On program restructuring, scheduling, and communication for parallel processor systems
Extraction of massive instruction level parallelism
ACM SIGARCH Computer Architecture News
Disjoint eager execution: an optimal form of speculative execution
Proceedings of the 28th annual international symposium on Microarchitecture
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Dynamic schemes for speculative execution of code
Performance Evaluation
Hi-index | 0.00 |
Ideograph integrates data and control dependencies into a unified representation and is used to precisely characterize the concepts of branch prediction and eager evaluation. The Ideogram computer is designed to execute Ideographs. Unlike dataflow computers, The Ideogram computer accepts a 3-address code language called igf. Through igf, Ideographs are constructed and executed by the Ideogram computer at run-time. In this paper, the descriptions of both Ideograph and Ideogram computer are introduced, and the preliminary benchmark results are included.