scientific article; zbMATH DE number 3473307
From MaRDI portal
Publication:4057587
zbMATH Open0302.68052MaRDI QIDQ4057587FDOQ4057587
Authors: Richard L. Mattson, Jan Gecsei, Donal R. Slutz, Irving L. Traiger 
Publication date: 1972
Title of this publication is not available (Why is that?)
Cited In (13)
- A proof of the optimality of the MIN paging algorithm using linear programming duality
- An optimal demand prepaging algorithm
- A short proof of optimality for the MIN cache replacement algorithm
- A new approach to optimal cache scheduling
- Response-time simulation of multivariate point process models for multiprogrammed jobstreams
- Cache optimization and performance modeling of batched, small, and rectangular matrix multiplication on Intel, AMD, and Fujitsu processors
- Performance predictions for extended paged memories
- A decomposable model of program paging behaviour
- Adaptive execution techniques of parallel programs for multiprocessors
- Optimal control of demand-paging systems
- Analysis of storage hierarchy
- Stack distance density and page fault probability in virtual memory systems
- A formula for incorporating weights into scoring rules
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4057587)
