The N-FINDER algorithm is widely used for endmember extraction from hyperspectral images. One of the disadvantages of N-FINDER is that its sequential implementations have long run times due to their relatively large computational complexity. A fast parallel version of N-FINDER is developed in this paper. This version combined with the use of Hyperspectral Image Reduction for Endmember Extraction technique (HIREE) provides an algorithm that is 8 times faster than the original N-FINDER sequential algorithm.