Abstract
Several different computer architectures have been suggested or built to overcome the Von Neumann bottleneck. Particularly in image processing, data structures and algorithm organization may benefit from a good match with the new architectures. Such a match may be defined as the degree of exploitation of the system resources (including time) to obtain the specific solution. A diagram that shows the existing match between classes of machines, data structures, and computational structures is given in this paper. A comparison of the performance of extreme architectures on a limited number of benchmarks, chosen from the most popular IP tasks, concludes this work.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
