This paper turns a discrete Hartley transform (DHT) of length N=N₁N₂ (N₁ is odd) into N₁ DHT's of length N₂ and some additional operations. The additional operations can also be turned to N₂ DHT's of length N₁. Therefore，a MIMD parallel Algo-rithm is obtained. If N₁ processors are available,M(N₂)+1/2N+3/2 N₂?2 multiplication steps and A (N₂)+1/2N+5/2N₂?1 addition steps are enough for computing a DHT of length N=N₁N₂, where M(N₂) and A(N₂) represent the number of multiplications and additions for a DHT of length N₂ respectively. The efficiency of the parallel algorithm with respect to itself is approximately 1.