The following pages link to (Q4057587):
Displaying 14 items.
- Adaptive execution techniques of parallel programs for multiprocessors (Q666102) (← links)
- A short proof of optimality for the MIN cache replacement algorithm (Q845965) (← links)
- A new approach to optimal cache scheduling (Q1122358) (← links)
- A decomposable model of program paging behaviour (Q1219162) (← links)
- Optimal control of demand-paging systems (Q1229618) (← links)
- Stack distance density and page fault probability in virtual memory systems (Q1229757) (← links)
- Analysis of storage hierarchy (Q1230652) (← links)
- An optimal demand prepaging algorithm (Q1244996) (← links)
- A formula for incorporating weights into scoring rules (Q1575143) (← links)
- On the smoothness of paging algorithms (Q1743122) (← links)
- A proof of the optimality of the MIN paging algorithm using linear programming duality (Q1924620) (← links)
- Performance predictions for extended paged memories (Q2543770) (← links)
- Response-time simulation of multivariate point process models for multiprogrammed jobstreams (Q3860836) (← links)
- Cache optimization and performance modeling of batched, small, and rectangular matrix multiplication on Intel, AMD, and Fujitsu processors (Q6601380) (← links)
