Scheduling of Partitioned Regular Algorithms on Processor Arravs with
暂无分享,去创建一个
[1] Alice C. Parker,et al. The high-level synthesis of digital systems , 1990, Proc. IEEE.
[2] Jean-Marc Delosme,et al. Optimization of Computation Time for Systolic Arrays , 1992, IEEE Trans. Computers.
[3] Lothar Thiele,et al. On the design of piecewise regular processor arrays , 1989, IEEE International Symposium on Circuits and Systems,.
[4] Yu-Chin Hsu,et al. A formal approach to the scheduling problem in high level synthesis , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[5] Yves Robert,et al. Constructive Methods for Scheduling Uniform Loop Nests , 1994, IEEE Trans. Parallel Distributed Syst..
[6] Jürgen Teich,et al. Partitioning of processor arrays: a piecewise regular approach , 1993, Integr..
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[8] Yves Robert,et al. Resource-constrained scheduling of partitioned algorithms on processor arrays , 1996, Integr..
[9] Sun-Yuan Kung,et al. Scheduling partitioned algorithms on processor arrays with limited communication supports , 1993, Proceedings of International Conference on Application Specific Array Processors (ASAP '93).
[10] L. Thiele,et al. Synthesis methods for domain-specific multiprocessor systems including memory design , 1993, Proceedings of IEEE Workshop on VLSI Signal Processing.
[11] Mohamed I. Elmasry,et al. Global optimization approach for architectural synthesis , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..