There has been a lot of work on parallelizable hashing. Web search for "tree hashing" will turn up much of it. Several of the SHA-3 competition candidates, including at least the winner Keccak and finalist Skein, had discussions in their submissions of how to do a tree hash with their algorithm.