| A Method of Vector Processing for Shared Symbolic Data (1997) | |||||||||||||||||
Abstract | |||||||||||||||||
| Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such as the Cray-XMP, or dataparallel 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. Keywords. symbol processing; vector processing; hashing; sorting. 1. Introduction An attached... | |||||||||||||||||
Publication details | |||||||||||||||||
| |||||||||||||||||