Ingrid Y. Bucher
Abstract
The performance of an interleaved common memory accessed uniformly by multiple processors is modeled by queueing methods. The model includes access conflicts at the bank level while assuming an ideal access network.
A scaling relation is derived that is generally valid and indicates that memory access delays are given by the product of the bank reservation time and a function of the memory utilization, which is given by the average number of access requests arriving at a bank per bank reservation time. For light memory traffic, access delays are proportional to the square of the bank reservation time and the ratio of the number of active memory access streams to the number of memory banks.
Assuming random access patterns, an open and a closed queueing model are developed that are validated by simulations. Delay dependence on bank reservation time is quadratic for light loads and linear for very heavy loads.
A heuristic extension of our model for vector accessing of banks in sequential mode is proposed.
- 1 Calahan, D. A. and D. H. Bailey, "'Measurement and Analysis of Memory Conflicts on Vector Multiprocessors," in Performance Evaluation of Supercomputers, J. L. Martin, Ed., Elsevier, 1988.Google Scholar
- 2 Bucher, I. Y. and M. L. Simmons, "Measurements of Memory Access Contentions in Multiple Vector Proeessor Systems," to be published.Google Scholar
- 3 Chang, D. Y., D. J. Kuck, and D. H. Lawrie, "On the Effective Bandwidth of Parallel Memories," IEEE Trans. Comp., C-26 (1977), 480-489.Google ScholarDigital Library
- 4 Bailey, D. H., "Vector Computer Memory Bank Contention," IEEE Trans. Comp., C-36 (1987), 293-298. Google ScholarDigital Library
- 5 Calahan, D. A. "Some Results in Memory Conflict Analysis," Proceedings of Supercomputing 1989, 775-778. Google ScholarDigital Library
- 6 Tang, P. and R. H. Mendez, "Memory Conflicts and Machine Performance," Proceedings of Supercomputing 1989, 826-831. Google ScholarDigital Library
- 7 Denning, P. J. and J. P. Buzen, "The Operational Analysis of Queueing Network Models," Computing Surveys 10 (1978), 225-261. Google ScholarDigital Library
- 8 Kleinrock, L., "Queueing Theory," Vol. i, Wiley, New York, 1975.Google Scholar
Index Terms
- Access conflicts in multiprocessor memories queueing models and simulation studies
Recommendations
Access conflicts in multiprocessor memories queueing models and simulation studies
ICS '90: Proceedings of the 4th international conference on SupercomputingThe performance of an interleaved common memory accessed uniformly by multiple processors is modeled by queueing methods. The model includes access conflicts at the bank level while assuming an ideal access network.
A scaling relation is derived that is ...
Models of Access Delays in Multiprocessor Memories
The performance of an interleaved common memory accessed uniformly by multiple processors is modeled by queuing and simulation methods. The model includes access conflicts at the bank level while assuming an ideal access network. A general scaling law ...
Role-Based Access Control Models
Since the 1970s, computer systems have featured multiple applications and served multiple users, leading to heightened awareness of data security issues. System administrators and software developers focused on different kinds of access control to ...
Comments