Issue No.02 - February (1988 vol.37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.2150
A problem that requires I inputs, K outputs and I computations is to be solved on a d-dimensional parallel processing machine (usually d>or=3). Finite transmission speed and other real-world conditions are assumed. It is proved that the time needed to solve the problem is t= Omega /sub max/ (I/sup 1/d/, K/sup 1/d/, T/sup 1/(d+1)/). This result is demonstrated for the standard algorithm for m
computational complexity; finite transmission speed; matrix multiplications; parallel algorithms; real-world conditions; computational complexity; matrix algebra; parallel algorithms.
D.C. Fisher, "Your Favorite Parallel Algorithms Might Not Be as Fast as You Think", IEEE Transactions on Computers, vol.37, no. 2, pp. 211-213, February 1988, doi:10.1109/12.2150