This Article 
 Bibliographic References 
 Add to: 
Algorithmic Phase Diagrams
February 1987 (vol. 36 no. 2)
pp. 231-233
R. Hockney, Department of Computer Science, Reading University
Algorithmic phase diagrams are a neat and compact representation of the results of comparing the execution time of several algorithms for the solution of the same problem. As an example we show the recent results of Gannon and Van Rosendale on the solution of multiple tridiagonal systems of equations in the form of such diagrams. The act of preparing these diagrams has revealed an unexpectedly complex relationship between the best algorithm and the number and size of the tridiagonal systems, which was not evident from the algebraic formulae in the original paper. Even so, for a particular computer, one diagram suffices to predict the best algorithm for all problems that are likely to be encountered-the prediction being read directly from the diagram without complex calculation.
Index Terms:
parallel computation, Algorithm analysis, algorithmic phase diagrams, characterization of algorithms, n, parallel algorithms
R. Hockney, "Algorithmic Phase Diagrams," IEEE Transactions on Computers, vol. 36, no. 2, pp. 231-233, Feb. 1987, doi:10.1109/TC.1987.1676886
Usage of this product signifies your acceptance of the Terms of Use.