ON THE PAGING PERFORMANCE OF ARRAY ALGORITHMS.
Publication
, Journal Article
Trivedi, KS
Published in: IEEE Transactions on Computers
1977
Data paging is of primary concern for problems with large data bases and for many types of array problems. It is shown that prepaging reduces the paging problems of array algorithms operating on large arrays. Also shown is that the use of a submatrix algorithm considerably improves the locality. Methods of automating these performance-improvement techniques by means of a compiler in the context of a structured array language are considered.
Duke Scholars
Published In
IEEE Transactions on Computers
Publication Date
1977
Volume
C-26
Issue
10
Start / End Page
938 / 947
Related Subject Headings
- Computer Hardware & Architecture
- 4606 Distributed computing and systems software
- 4009 Electronics, sensors and digital hardware
- 1006 Computer Hardware
- 0805 Distributed Computing
- 0803 Computer Software
Citation
APA
Chicago
ICMJE
MLA
NLM
Trivedi, K. S. (1977). ON THE PAGING PERFORMANCE OF ARRAY ALGORITHMS. IEEE Transactions on Computers, C–26(10), 938–947.
Trivedi, K. S. “ON THE PAGING PERFORMANCE OF ARRAY ALGORITHMS.” IEEE Transactions on Computers C–26, no. 10 (1977): 938–47.
Trivedi KS. ON THE PAGING PERFORMANCE OF ARRAY ALGORITHMS. IEEE Transactions on Computers. 1977;C–26(10):938–47.
Trivedi, K. S. “ON THE PAGING PERFORMANCE OF ARRAY ALGORITHMS.” IEEE Transactions on Computers, vol. C–26, no. 10, 1977, pp. 938–47.
Trivedi KS. ON THE PAGING PERFORMANCE OF ARRAY ALGORITHMS. IEEE Transactions on Computers. 1977;C–26(10):938–947.
Published In
IEEE Transactions on Computers
Publication Date
1977
Volume
C-26
Issue
10
Start / End Page
938 / 947
Related Subject Headings
- Computer Hardware & Architecture
- 4606 Distributed computing and systems software
- 4009 Electronics, sensors and digital hardware
- 1006 Computer Hardware
- 0805 Distributed Computing
- 0803 Computer Software