Based on the concepts such as needed set, needed position and so on, needed parallel-outermost reduction strategy is introduced in this paper. By minimizing needed sets, this strategy is complete for the regular term rewriting systems, is efficient like call by need strategy, and can satisfy all demands of applicability, efficiency andcomputability.