In this document we are going to analyze the parallelization of QR factorization by means of Householder transformations. This parallelization will be carried out on a machine with a mesh topology (a 2-D torus to be more precise). We use a cyclic distribution of the elements of the sparse matrix M we want to decompose over the processors. Each processor represents the nonzero elements of its part of the matrix by a one-dimensional doubly linked list data structure. Then, we describe the different procedures that constitute the parallel algorithm. As an application of QR factorization, we concentrate on the least squares problem and finally we present a evaluation of the efficiency of this algorithm for a set of test matrices from the Harwell-Boeing sparse matrix collection.