论文信息 - Lower bound on latency for VLIW ASIP datapaths - 字舞流文

Lower bound on latency for VLIW ASIP datapaths

Gustavo de Veciana | Margarida F. Jacome

[1] Minjoong Rim,et al. Lower-bound performance estimation for the high-level synthesis scheduling problem , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2] Eduard Cerny,et al. A recursive technique for computing lower-bound performance of schedules , 1996, TODE.

[3] Rajiv Jain,et al. Experience with the ADAM Synthesis System , 1989, 26th ACM/IEEE Design Automation Conference.

[4] R. Mucci. A comparison of efficient beamforming algorithms , 1984 .

[5] Srinivas Devadas,et al. Instruction selection, resource allocation, and scheduling in the AVIV retargetable code generator , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[6] Giri Tiruvuri,et al. Estimation of lower bounds in scheduling algorithms for high-level synthesis , 1998, TODE.