International Conference on Parallel Computing in Electrical Engineering, (PARELEC'04)
Compiler Scheduling for STA-Processors
Dresden, Germany
September 07-September 10
ISBN: 0-7695-2080-4
This paper presents an adaptation of the list scheduling algorithm to generate code for processors of the Synchronous Transfer Architecture (STA) by applying techniques known from RISC and TTA. The proposed scheduling approach is based on informed, deterministic algorithms that can be implemented run-time efficiently. Although the presented compiler prototype does not generate optimized code, it provides a proof-of-concept of the feasibility of the proposed compiler architecture.
Citation:
Gordon Cichon, P. Robelly, H. Seidel, M. Bronzel, Gerhard Fettweis, "Compiler Scheduling for STA-Processors," parelec, pp.45-60, International Conference on Parallel Computing in Electrical Engineering, (PARELEC'04), 2004