Boolean Matrix Transpose Algorithm follows Parallel Computing Strategy

Sanil Shanker KP

doi:https://doi.org/10.14445/22315373/IJMTT-V35P533

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 35 | Number 4 | Year 2016 | Article Id. IJMTT-V35P533 | DOI : https://doi.org/10.14445/22315373/IJMTT-V35P533

Boolean Matrix Transpose Algorithm follows Parallel Computing Strategy

Sanil Shanker KP

Abstract

In 2016, Sanil put forward an algorithm to transpose Zero- One matrix. This paper explains the algorithm’s parallel nature with the support of an example.

Keywords

Boolean Matrix, Parallel computing.

References

[1] Stephen Warshall, A Theorem on Boolean Matrices. Journal of the ACM. Volume 9 Issue 1, Jan. 1962 Pages 11-12.
[2] Daniel Hills W and Bruce M Boghosian, Parallel Scientific Computation, Science, Vol 261, Pp. 856- 863.
[3] Sanil Shanker KP, An Algorithm to Transpose Zero- One Matrix, International Journal of Computer Science and Information Technologies, Vol. 7 (4) , 2016, 1960- 1961.

Citation :

Sanil Shanker KP, "Boolean Matrix Transpose Algorithm follows Parallel Computing Strategy," International Journal of Mathematics Trends and Technology (IJMTT), vol. 35, no. 4, pp. 225-227, 2016. Crossref, https://doi.org/10.14445/22315373/IJMTT-V35P533