University of California, Berkeley Progress Report 95/96

Abstract of Stanley's thesis:

We explain the execution time of serial and parallel symmetric eigensolvers and the limits imposed by the algorithm, the eigenproblem, the hardware, and the implementation. Comparing the actual execution time against the limitations imposed by the computer hardware allows us to quantify the affect on execution time of each of the important hardware and software design decisions. We objectively compare algorithms and the limits on their execution time without interference from implementation details.