Abstract: Parallelizing simplex type algorithms is one of the most challenging problems. The aim of this paper is to present a parallel implementation of the cosine simplex algorithm. We adopt the row distribution scheme in our implementation. This paper presents a computational study that shows the speedup among the serial and parallel version in medium-scale randomly generated full dense LP problems. Preliminary computational results on randomly generated dense linear programs support our results.