Modelling compilation as a search problem on a system with constraints :
The system will consist of
The code to be parellised will be tight loops and hence small.
The idea is to search the space of complied code to find the optimal one.
- a set of processors
- a set of memories
- an interconnect network
- a set of constraints
- number of processors
- size of memory
- which processor can access which memories in a cycle
- ordering imposed by the operations to be performed.
This is most probably NP complete, but speed is not the essence here.(Nawaaz)