In this paper, the methods and implementation techniques used for the nonsymmetric sparse
linear system solver, mcsparse on the Cedar system are described. A novel reordering
scheme (H∗) upon which the solver is based is presented. The tradeoffs discussed include
stability and fill-in control, hierarchical parallelism, and load balancing. Experimental results
demonstrating the effectiveness of the solver with respect to each of these issues are
presented. We also address the implications of this work for other parallel processing …