Time space tradeoffs in vector algorithms for APL functions

Authors:
T. Budd
Affiliations:
Oregon State Univ., Corvalis
Venue:
ACM SIGPLAN Notices
Year:
1988

Citing 5
Cited 0

Data parallel algorithms

Communications of the ACM - Special issue on parallelism
Parallel speedup of sequential machines: a defense of parallel computation thesis

ACM SIGACT News
An APL compiler

An APL compiler
Some properties of APL programs

APL '75 Proceedings of seventh international conference on APL
Programming with idioms in APL

APL '79 Proceedings of the international conference on APL: part 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

When considering algorithms which will run on processors in which large vectors of values can be manipulated in time which is independent of the length of the vector, many issues of time versus space arise which are not important, or of less importance, on more conventional machines. This paper explores various alternative techniques which might be used in an implementation of APL on such a machine, and considers some of these time/space tradeoffs.