The University of Edinburgh -
Division of Informatics
Forrest Hill & 80 South Bridge

MSc Thesis #9702

Title:An Investigation of Neighbourhood Search to Improve Cache Use
Date:Sep 1997
Abstract:Maximising cache use is an important objective in high performance computing. the frequency with which the cache is able to satisfy memory requests can, in some circumstances, be enhanced through re-mapping of the data in memory, thus transforming the problem to one of optimisation. The potential for neighbourhood search techniques, such as genetic algorithms, to find suitable memory transformations is the subject of this work. Tests on simulated code demonstrated the viability of this approach. When the search space was further correlated, by modifying the mutation operator, the choice of search method became less important. A simple hillclimber outperformed a genetic algorithm, thus highlighting the importance of the neighbourhood operator in neighbourhood search.

[Search These Pages] [DAI Home Page] [Comment]