A multithreaded implementation for TransLucid

Access & Terms of Use
metadata only access
Abstract
We present an implementation of the TransLucid language, in which expressions are evaluated in a dynamic context of arbitrary dimensionality. The basis for this implementation is the TransLucid Virtual Machine (TVM), whose execution supposes a centralised cache storing intermediate computed values and whose individual threads compute the values for (identifier, context) pairs. The TVM is designed so that it is efficiently implementable on a wide variety of physical architectures. © 2008 IEEE.
Persistent link to this record
DOI
Link to Publisher Version
Additional Link
Author(s)
Plaice, John
Rahilly, Toby
Supervisor(s)
Creator(s)
Editor(s)
Translator(s)
Curator(s)
Designer(s)
Arranger(s)
Composer(s)
Recordist(s)
Conference Proceedings Editor(s)
Other Contributor(s)
Corporate/Industry Contributor(s)
Publication Year
2008
Resource Type
Conference Paper
Degree Type
UNSW Faculty