We prove that evaluating a Boolean decision tree of height h requires
Omega(h/(m + logh)) time on any EREW PRAM with communication width m
and any number of processors. Since this function can be easily comput
ed in time O(root h) on a CREW PRAM with communication width 1 using 2
(o(h)) processors, this gives a separation between the two models when
ever the EREW PRAM has communication width m is an element of o(root h
). (C) 1997 Academic Press.