<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>7062</REFNUM><AUTHORS><AUTHOR>O'Donnell,J.T.</AUTHOR></AUTHORS><YEAR>1993</YEAR><TITLE>Data parallel implementation of Extensible Sparse Functional Arrays</TITLE><PLACE_PUBLISHED>Proc. Parallel Architectures and Languages Europe (PARLE'93), LNCS 694 </PLACE_PUBLISHED><PUBLISHER>LNCS, Springer</PUBLISHER><PAGES>68-79</PAGES><LABEL>O'Donnell:1993:7062</LABEL><KEYWORDS><KEYWORD>data parallel</KEYWORD></KEYWORDS<ABSTRACT>Three important generalised array structures --- extensible arrays, sparse arrays and functional arrays --- are slow to access unless their use is severely restricted. All three can be combined in a powerful new active data structure called `ESF arrays'. ESF arrays may grow or shrink dynamically, they can be searched quickly, and changes to them can be rolled back in a single operation. A new data parallel algorithm implements every operation on an ESF array in a small constant time, without placing any restrictions on the use of those operations. The algorithm is suitable both for massively parallel architectures and for VLSI implementation.</ABSTRACT></RECORD></RECORDS></XML>