The Manchester prototype dataflow computer
Communications of the ACM - Special section on computer architecture
A bridging model for parallel computation
Communications of the ACM
Imperative functional programming
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Using MPI: portable parallel programming with the message-passing interface
Using MPI: portable parallel programming with the message-passing interface
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
Towards efficiency and portability: programming with the BSP model
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Bridging the gulf: a common intermediate language for ML and Haskell
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Functional Programming and Parallel Graph Rewriting
Functional Programming and Parallel Graph Rewriting
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Typed common intermediate format
DSL'97 Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997
| Hi-index | 0.00 |
Condensed graphs are proposed as an intermediate representation for functional and imperative languages. This representation may be executed on a variety of architectures, implementing a multi-level Condensed Graphs abstract machine. This machine incorporates characteristics and feedback information of its underlying architecture and guides dynamic topological transformations of the representation so as to optimize execution. These transformations can add or remove parallelism and change evaluation orders.Simulated executions of the intermediate representation, utilizing varying evaluation orders, on the abstract machine are presented.