Abstract
Conventional processing techniques for pipelined vector processors such as the CRAY-XMP, or data-parallel computers, such as the Connection Machines, are generally applied only to independent multiple data processing. This paper describes a vector processing method for multiple processings including parallel rewriting of dynamic data structures with shared elements, and for multiple processings that may rewrite the same data item multiple times. This method enables vector processing when entering multiple data items into a hash table, address calculation sorting, and many other algorithms that handle lists, trees, graphs and other types of symbolic data structures. This method is applied to several algorithms; consequently, the performance is improved by a factor of ten on a Hitachi S-810.
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.
