Name
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. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1007/3-540-56891-3_6 | PARLE |
Keywords | Field | DocType |
extensible sparse functional arrays,data parallel implementation,data structure | Data structure,Parallel algorithm,Massively parallel,Computer science,Parallel computing,Very-large-scale integration,Extensibility | Conference |
ISBN | Citations | PageRank |
3-540-56891-3 | 4 | 0.49 |
References | Authors | |
4 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John T. O'Donnell | 1 | 90 | 19.59 |