Abstract
Abstract We describe a new strategy to solve geometric problems that trades off time × processors in hypercubic networks. Let N be the size of the input. Using a hypercube of size N1+1/κ propose O(κlog N) time solutions for the ECDF searching, closest points, and convex hull problems. Such a strategy, based on the sparse enumeration sort, is of practical interest, since it provides time-optimal parallel algorithms that arc simple and have small constants related to their running times.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 callMore From: International Journal of Parallel, Emergent and Distributed Systems
Paper Title
Journal
Date
