Library Automation and Digital Archive
Fakultas Ilmu Komputer
Universitas Indonesia

Pencarian Sederhana

Find Similar Add to Favorite

Call Number SEM-193
Collection Type Indeks Artikel prosiding/Sem
Title Efficient transposition algorithms for large matrices, Hal. 656-665
Author S.D. Kaushik; C.H. Huang; J.R. Johnson; R.W> Johnson; Padayappan;
Publisher Proceedings supercomputing'93 Portland, Oregon November 15-19
Subject Tensor product; stride permutation, matrix transposition, parallel algorithm, external memory
Lokasi : Perpustakaan Fakultas Ilmu Komputer
Nomor Panggil ID Koleksi Status
Tidak ada review pada koleksi ini: 40561
We present transposition algorithms for matrices ahtat do not fit in main memory. Transposition is interpreted as a permutation of the vector obtained by mapping a matrix to linear memory. Algorithms are derived from factorizations of this permutation, using a class of permutations related to the tensor product. Using this p\formulation of transpotision, we first obtain several known algorithms and then we derive a new algorithms which reduces the numver of isk accesses required. The new algorithm was compared to exeisting algorithms using an implementaion on the intel iPSC/860. This comparison shows the benefits of the new algorithm.