Vectorization of track finding and fitting algorithms for HEP

Abstract The applicability of vector computers toward solving the problems of drift chamber track finding and fitting is discussed. Particular attention is paid to the Mark III tracking program, which appears amenable to such vectorization. Progress in the field by other groups is also discussed, and an attempt is made to extrapolate from present experience to situations of higher multiplicity and drift chamber complexity.