| |
Browse All Reviews > Software (D) > Operating Systems (D.4) > Storage Management (D.4.2) > Swapping (D.4.2...)
|
|
 |
|
|
| |
|
|
| |
1-3 of 3
Reviews about "Swapping (D.4.2...)":
|
Date Reviewed |
| |
Optimal prefetching via data compression
Vitter J., Krishnan P. Journal of the ACM 43(5): 771-793, 1996. Type: Article
The work reported here is based on the observation that lossless data compression methods implicitly or explicitly predict incoming source symbols and that similar predictions would be highly applicable to the problem of prefetching th...
|
Sep 1 1997 |
| |
Memory management for B-trees
Spirn J., Tsur S. Performance Evaluation 5(3): 159-174, 1985. Type: Article
This paper examines page replacement policies for B-trees under the assumptions that nonleaf tree nodes occupy a page and that keys are independently and randomly accessed. The latter assumption is a little bothersome for real systems,...
|
Mar 1 1986 |
| |
Static grouping of small objects to enhance performance of a paged virtual memory
Stamos J. ACM Transactions on Computer Systems 2(2): 155-180, 1984. Type: Article
In this paper the author discusses program restructuring techniques used to statically relocate objects in virtual memory. This work, done in the context of the SMALL-TALK-80 interactive programming environment, investigates five type...
|
Mar 1 1985 |
| |
|
|
| |
|
