Scheduling algorithms for large DSP problems
Over the past years, several scheduling techniques have been proposed for high level synthesis. However, the main focus of the research in this area has been in the development of optimal algorithms for small problems. Since the scheduling problem as been shown to be NP-complete, simpler algorithms must be investigated for scheduling large problems. In this sense, it will be shown that by using simple algorithms it is possible to acheive solutions close to optimal in a very short time.