A Stack-Based Concatenative Approach to Co-processor Simulation and Code Generation

Jakob, C and Beckett, P 2015, 'A Stack-Based Concatenative Approach to Co-processor Simulation and Code Generation', in Conferences in Research and Practice in Information Technology: Proceedings of the 13th Australasian Symposium on Parallel and Distributed Computing (AusPDC 2015), Sydney, Australia, 27-30 January 2015, pp. 31-40.


Document type: Conference Paper
Collection: Conference Papers

Title A Stack-Based Concatenative Approach to Co-processor Simulation and Code Generation
Author(s) Jakob, C
Beckett, P
Year 2015
Conference name 13th Australasian Symposium on Parallel and Distributed Computing (AusPDC 2015)
Conference location Sydney, Australia
Conference dates 27-30 January 2015
Proceedings title Conferences in Research and Practice in Information Technology: Proceedings of the 13th Australasian Symposium on Parallel and Distributed Computing (AusPDC 2015)
Publisher Australian Computer Society Inc.
Place of publication Sydney, Australia
Start page 31
End page 40
Total pages 10
Abstract As we run to the end of the silicon roadmap, the rapidly escalating cost of design, fabrication and test in future systems-on-chip may justify a re- evaluation of homogeneous reconfigurable mesh ar- chitectures. Ultimately, the geometric constraints of extreme nanoscale device layout may support only simple functional arrays with predominately nearest neighbour connectivity. However, these have proved to be difficult to configure and program effectively as even small load imbalances, unnecessary synchroniza- tion overheads or delayed accesses to remote data can prevent typical applications from running efficiently on large distributed arrays of processors. We describe an approach to the problem of configuring a system- on-chip comprising an array of small interconnected processors that imposes a common structure on dis- tributed programs and trades some code efficiency for ease of programming and ease of verification. Zeta is a stack-based, concatenative language that bears some similarity to Forth. It has been developed to man- age the complexities of simulation and code genera- tion in this multi-coprocessor environment. Zeta pro- grams implement the computation and connections of directed acyclic graphs (DAGs) by manipulating a stack of state variables. State information can be passed forward (in time) through the directed acyclic graph as needed using a virtual bus construct. This paper describes the key features of the language and illustrates its use via an example implementation of an LDPC decoder.
Subjects Circuits and Systems
Signal Processing
Keyword(s) concatenative language
stack-based
multi-coprocessor programming
Copyright notice © 2015, Australian Computer Society, Inc
ISBN 9781921770456
Versions
Version Filter Type
Access Statistics: 111 Abstract Views  -  Detailed Statistics
Created: Thu, 11 Feb 2016, 08:45:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us