PERFORMANCE TESTS OF PYRAMID STAR-ID ALGORITHM WITH MEMORY ADAPTIVE K-VECTOR
Conference Paper
Overview
Identity
Additional Document Info
View All
Overview
abstract
This paper presents results obtained with a C/C++ implementation of the Pyramid star identification algorithm enhanced by the memory adaptive k-vector. Specifically, the paper focuses in the benchmark results of Pyramid run time versus the amount of memory allocated for the k-vector. A discussion about the tradeoff relations between memory allocated for the k-vector and speed, and the impact of cache misses in modern processors for very long k-vectors is presented.