- 期刊
- OpenAccess
Fast and Scalable Parallel Algorithms for Matrix Chain Product and Matrix Powers on Reconfigurable Pipelined Optical Buses
並列摘要
Given N matrices A1, A2, …,A(subscript N) of size N×N, the matrix chain product problem is to compute A1×A2×...×A(subscript N). Given an N×N matrix A, the matrix powers problem is to calculate the first N powers of A, i.e., A, A^2, A^3, …, A(superscript N). We show that the two problems can be solved in (The equation in abbreviated.) and (The equation in abbreviated.) times respectively, where a＜ 2.3755, and p, the number of processors, can be arbitrarily chosen in the interval [l..N(superscript (a+1)] Our highly scalable algorithms can be implemented on a linear array with a reconfigurable pipelined bus system, which is a distributed memory system using optical interconnections.
延伸閱讀
- 林致瑄（2015）。A Particle Swarm Optimization Solution Approach for the Multi-Compartment Vehicle Routing Problem〔碩士論文，國立交通大學〕。華藝線上圖書館。https://doi.org/10.6842/NCTU.2015.00484
- 韓復華、朱佑旌、林致瑄（2016）。A PARTICLE SWARM OPTIMIZATION SOLUTION APPROACH FOR THE MULTI-COMPARTMENT VEHICLE ROUTING PROBLEM。運輸計劃季刊，45(2)，101-131。https://www.airitilibrary.com/Article/Detail?DocID=10177159-201606-201610050031-201610050031-101-131
- 韓復華、朱政威（2010）。IP Formulation and Metaheuristics for the Commuter Bus Routing Problem。運輸計劃季刊，39(2)，133-163。https://doi.org/10.6402/TPJ.201006.0133
- Qian, Y., & Ma, G. (2023). Optimization of Matrix Multiplication Algorithm based on FT-M7002 Chip. International Core Journal of Engineering, 9(3), 83-90. https://doi.org/10.6919/ICJE.202303_9(3).0011
- HATIRNAZ, İ., GÜRKAYNAK, F. K., & LEBLEBICI, Y. (2000). A Modular and Scalable Architecture for the Realization of High-speed Programmable Rank Order Filters Using Threshold Logic. VLSI Design, 2000(), 115-128. https://doi.org/10.1155/2000/98945