Efficient Sorting Using Registers and Caches

Efficient Sorting Using Registers and Caches (2000)

by Lars Arge , Jeff Chase , Jeffrey S. Vitter , Rajiv Wickremesinghe

Venue:	in Proceedings of the 4th Workshop on Algorithm Engineering (WAE 2000
Citations:	18 - 5 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Efficient Sorting Using Registers and Caches	user correction - Legacy Corrections
AUTHOR NAME	Lars Arge	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science, Duke University, Durham	SVM HeaderParse 0.2
AUTHOR ADDR	NC 27708, U.S.A.	SVM HeaderParse 0.1
AUTHOR NAME	Jeff Chase	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science, Duke University, Durham	SVM HeaderParse 0.2
AUTHOR ADDR	NC 27708, U.S.A.	SVM HeaderParse 0.1
AUTHOR NAME	Jeffrey S. Vitter	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science, Duke University, Durham	SVM HeaderParse 0.2
AUTHOR ADDR	NC 27708, U.S.A.	SVM HeaderParse 0.1
AUTHOR NAME	Rajiv Wickremesinghe	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science, Duke University, Durham	SVM HeaderParse 0.2
AUTHOR ADDR	NC 27708, U.S.A.	SVM HeaderParse 0.1
ABSTRACT	Modern computer systems have increasingly complex memory systems.Common machine models for algorithm analysis do not reflect many of the features...	user correction - Legacy Corrections
YEAR	2000	INFERENCE
VENUE	in Proceedings of the 4th Workshop on Algorithm Engineering (WAE 2000	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	2002	INFERENCE
VOLUME	7	INFERENCE
CITATIONS	16 found	ParsCit 1.0