@conference {18025,
	title = {Two techniques for reconciling algorithm parallelism with memory constraints},
	booktitle = {Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures},
	series = {SPAA {\textquoteright}02},
	year = {2002},
	month = {2002///},
	pages = {95 - 98},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {The utility of algorithm parallelism for coping with increased processor to memory latencies using "latency hiding" is part of the folklore of parallel computing. Latency hiding techniques increase the traffic to memory and therefore may "hit another wall": limited bandwidth to memory. The current paper attempts to stimulate research in the following general direction: show that algorithm parallelism need not conflict with limited bandwidth.A general technique for using parallel algorithms to enhance serial implementation in the face of processor-memory latency problems is revisited. Two techniques for alleviating memory bandwidth constraints are presented. Both techniques can be incorporated in a compiler.There is often considerable parallelism in many of the algorithms which are known as useful serial algorithms. Interestingly enough, all the examples provided for the use of the two techniques come from such serial algorithms.},
	keywords = {memory systems constraints, Parallel algorithms, prefetching},
	isbn = {1-58113-529-7},
	doi = {10.1145/564870.564884},
	url = {http://doi.acm.org/10.1145/564870.564884},
	author = {Vishkin, Uzi}
}
