Problems with this page?
Contact the mm-net webmaster
Last modified Fri Jan 28 11:07:29 GMT 2005
University of Cyprus, Nicosia, Cyprus
March 14th-17th, 2004
The ACM Symposia on Applied Computing provides a generalist forum for presenting and debating computing applications which draw on contemporary research techniques and methodologies. Although most of the contributions were not of direct relevance to MM-NET, memory-management issues were central to the following papers:
Automatic Parallel Code Generation for Tiled Nested Loops
Georgios Goumas, Nikolaos Drosinos, Maria Athanasaki, Nectarios Koziris, National Technical University of Athens, Greece
This paper discussed a framework for generating MPI code for tiled nestings for loops. Transformations are introduced for generating arbitrary parellipiped tilings of 2D structures to exploit better cache locality and to minimise communication overheads. However, I found the results unconvincing as I do not think that they adequately explore the space of tilings v structure size v number of processors v local memory/cache size.
A Back-end for GHC based on Categorical Multi-Combinators
Ricardo Massa F. Lima, Rafael Dueire Lins, Andre L. M. Santos, Universidade Federal de Pernambuco, Brazil
This paper discussed the modification of the GHC compiler for Haskell to generate code for the μΓCMC (Categorical Multi-Combinator) machine which eliminates environment cells by pushing the environment directly onto the reduction stack. New optimisations include the avoidance of unnecessary bindings, the automatic generation of type specific copying garbage collectors and simplifying structured cells to reduce heap overheads. While performance is around half of GHC, this is attributed to the use of general variables rather than registers, and of C rather than assembly language, in the μΓCMC implementation.
FSM-Hume: Programming Resource-Limited Systems using Bounded
Automata
Greg Michaelson, Heriot-Watt University, UK, Kevin Hammond, University of St Andrews, UK, Jocelyn Serot, Blaise Pascal University, France
Our paper presented space cost models for the finite-state machine subset of Hume, a novel language based on concurrent finite state automata controlled by generalised pattern matching and recursive functions. The models give very accurate predictions of stack and heap use on realistic examples.
The Symposium WWW pages are at: http://www.acm.org/conferences/sac/sac2004/
The Proceedings are published by ACM Press, ISBN 1-58113-812-1.
I would like to thank MM-NET for supporting my attendance at the Symposium.
Greg Michaelson, MACS, Heriot-Watt University.
Problems with this page?
Contact the mm-net webmaster
Last modified Fri Jan 28 11:07:29 GMT 2005