We present a parallel algorithm for solving triangular systems of linear 
equations on distributed-memory multiprocessor machines. 

The parallelism is achieved by partitioning the rows of the coefficient 
matrix in segments of a fixed size and distributing these sets in a 
wrap-around fashion among the processors, connected in a ring.
The granularity of the algorithm is controlled by varying the segment size.

The algorithm is compared to other previously published algorithms and 
is shown to provide a better performance.