Conflict Sensitivity of Algorithms. Part 1. A CRAY X-MP Study.
Donald A. Calahan · 1985
The delay of algorithm execution due to memory conflicts in a 16-processor CRAY X-MP extension is considered. The association between memory access delays of reads and writes, and delays in the resultant algorithm execution is studied by defining an incremental algorithm delay sensitivity and relating it to simulated large-delay and random variations. It is shown that, by division algorithms with zero incremental sensitivity, library software highly resistant to large delays may be achieved in a multiprocessor X-MP. Additional keywords: Linear algebra; Supercomputers; Simulators. (Author)