Abstract: The multiprocessor document allocation problem（MDAP）is very important in mapping the data onto the given architecture.As the MDAP is NP complete,many algorithms that approximate optimal solutions are developed.This paper gives a new greedy algorithm by adopting the concept of hypervertex and the occurrence frequency of the document unit,and its better performance is obtained.