Data Structures and Algorithms


Towards a Group Theoretical Model for Algorithm Optimization

Authors: Sven de Smet

This paper proposes to use a group theoretical model for the optimization of algorithms. We first investigate some of the fundamental properties that are required in order to allow the optimization of parallelism and communication. Next, we explore how a group theoretical model of computations can satisfy these requirements. As an application example, we demonstrate how this group theoretical model can uncover new optimization possibilities in the polyhedral model.

Comments: 4 Pages.

Download: PDF

Submission history

[v1] 15 Jun 2011

Unique-IP document downloads: 246 times

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus