Abstract
Magnetic Bubble Memory (MBM) is a mass storage device. Unlike the discs and the tapes, MBM can perform certain functions like data rearrangement, data sorting, information retrieval and update. So, the algorithms on the MBM are different from the algorithms for other mass storage devices.
Finding the transpose of a given square matrix is an important one in several applications and large matrices are usually stored in a secondary storage device. We present a new algorithm for transposing a given matrix that is stored in a MBM. The algorithm is asymptotically optimal.