A Multithreaded Implementation for TransLucid

Authors:
Toby Rahilly;John Plaice
Affiliations:
-;-
Venue:
COMPSAC '08 Proceedings of the 2008 32nd Annual IEEE International Computer Software and Applications Conference
Year:
2008

Citing 0
Cited 3

A type system for hybrid intensional-imperative programming support in GIPSY

C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
The practical uses of TransLucid

Proceedings of the first international workshop on Context-aware software technology and applications
Formally specifying and analyzing a parallel virtual machine for lazy functional languages using Maude

Proceedings of the fifth international workshop on High-level parallel programming and applications

Quantified Score

Hi-index	0.00

Visualization

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.