Abstract
We give a parallel algorithm for the problem of computing the row minima of a totally monotone two-dimensional matrix. Whereas the previous best CREW-PRAM algorithm for this problem ran in O(log n log log n) time with O( n log log n ) processors, our algorithms runs in O(log n) time with O( n) processors in the (weaker) EREW-PRAM model. Thus we simultaneously improve the time complexity without any deterioration in the time × processors product, even using a weaker model of parallel computation.
Full Text
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call