Conflict-free access of vectors with power-of-two strides
Valero, M.; Lang, T.; Ayguade, E.
An address mapping and an access order is presented for con flict-free access to vectors with any initial address and pow er-of-two strides. We show that for this conflict-free access it is necessary that the memory be unmatched and present an implementation for M=2T, where M is the number of modules and T the module latency. Moreover, the implementation allows the masking of the latency of the address calculation, of the map per, and of the bus arbiter.