96/00444 Dynamic levelwise scheduling for sparse matrix factorization on vector computers

Dynamic levelwise scheduling for sparse

Dynamic levelwise scheduling for sparse matrix factorization on vector computers

✍ M. Montagna; G.P. Granelli; G.T. Vuong; R. Chahine 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 755 KB

In this paper the problem of the efficient implementation of sparse matrix factorization on vector computers is considered. A fine-grain dynamic levelwise scheduling algorithm (DLSA) is proposed. DLSA takes into account the dependences between update operations, thus avoiding the recurrence problem.