'A linear algebra framework for automatic determination of optimal data layouts' by Mahmut Kandemir et al.

Add to your list(s) Download to your calendar using vCal

• Sam Bayliss (Imperial College London)
• Wednesday 17 December 2008, 12:00-12:30
• Room 503/EEE.

If you have a question about this talk, please contact George A Constantinides.

In this talk – I’ll make a brief presentation of a 1999 “IEEE transactions on Parallel and distributed systems” paper by Mahmut Kandemir in which he presents a formal definition of spatial and temporal locality in terms of hyperplanes and determines optimal memory layouts for arrays accessed within loop nests. The principles explained will probably seem obvious to those who’ve been doing memory oriented work and easily accessible to those in the group who have been working in other areas.

This talk is part of the CAS Talks series.

This talk is included in these lists:

• Andrea Picciau's list
• CAS Talks
• Circuits and Systems Group: Internal Seminars
• Room 503/EEE

Note that ex-directory lists are not shown.