Accounting for memory bank contention and delay in high-bandwidth multiprocessors
- 1 January 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 8 (9) , 943-958
- https://doi.org/10.1109/71.615440
Abstract
No abstract availableThis publication has 40 references indexed in Scilit:
- The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel AlgorithmsSIAM Journal on Computing, 1998
- A Reliable Randomized Algorithm for the Closest-Pair ProblemJournal of Algorithms, 1997
- Can shared-memory model serve as a bridging model for parallel computation?Published by Association for Computing Machinery (ACM) ,1997
- Efficient Low-Contention Parallel AlgorithmsJournal of Computer and System Sciences, 1996
- Towards efficiency and portabilityPublished by Association for Computing Machinery (ACM) ,1996
- A comparison of parallel algorithms for connected componentsPublished by Association for Computing Machinery (ACM) ,1994
- Simulation-based comparison of hash functions for emulated shared memoryPublished by Springer Nature ,1993
- CRAY X-MP and Y-MP memory performanceParallel Computing, 1991
- Block, multistride vector, and FFT accesses in parallel memory systemsIEEE Transactions on Parallel and Distributed Systems, 1991
- Organization of Semiconductor Memories for Parallel-Pipelined ProcessorsIEEE Transactions on Computers, 1977