Evaluation of loop grouping methods based on orthogonal projection spaces
暂无分享,去创建一个
Nectarios Koziris | George K. Papakonstantinou | Panayiotis Tsanakas | Georgios I. Goumas | Ioannis Drositis
[1] Nectarios Koziris,et al. Lower Time and Processor Bounds for Efficient Mapping of Uniform Dependence Algorithms into Systolic Arrays , 1997, Parallel Algorithms Appl..
[2] Weijia Shang,et al. Time Optimal Linear Schedules for Algorithms with Uniform Dependencies , 1991, IEEE Trans. Computers.
[3] Dan I. Moldovan,et al. Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays , 1986, IEEE Transactions on Computers.
[4] Yves Robert,et al. Mapping Uniform Loop Nests Onto Distributed Memory Architectures , 1993, Parallel Comput..
[5] Jang-Ping Sheu,et al. Partitioning and Mapping Nested Loops on Multiprocessor Systems , 1991, IEEE Trans. Parallel Distributed Syst..
[6] Nectarios Koziris,et al. Mapping nested loops onto distributed memory multiprocessors , 1997, Proceedings 1997 International Conference on Parallel and Distributed Systems.
[7] Yves Robert,et al. Constructive Methods for Scheduling Uniform Loop Nests , 1994, IEEE Trans. Parallel Distributed Syst..
[8] Jih-Kwon Peir,et al. Minimum Distance: A Method for Partitioning Recurrences for Multiprocessors , 1989, IEEE Trans. Computers.
[9] Stephen H. Friedberg,et al. Linear Algebra , 2018, Computational Mathematics with SageMath.