Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees

Optimal Mappings of q-ary and Binomial T

Optimal Mappings of q-ary and Binomial Trees into Parallel Memory Modules for Fast and Conflict-Free Access to Path and Subtree Templates

✍ Sajal K. Das; M.Cristina Pinotti 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 444 KB

The main memory access latency can significantly slow down the overall performance of a computer system due to the fact that average cycle time of the main memory is typically a factor of 5 10 times higher than that of a processor. To cope with this problem, in addition to the use of caches, the mai