The Elliptic Curve Method (ECM) of factorization can be used in the relation collection phase of the Number Field Sieve (NFS) to help identify smooth integers. This requires rapidly finding small prime factors for a large number of composites, each of a few machine words in size. We present a software implementation of ECM that is optimized for high throughput operation and compare it with recently proposed hardware implementations of ECM.