Muntz and Uzgalis An example is given below to illustrate the two allocation schemes just described. .S£i!I2£l® Page .size = 3 nodes Input sequence 10, 6, 12, 5, 15, 9, 2, 13. … The dotted areas indicate nodes on the sane page. If all nodes are accessed with equal probability the average number of page transitions in a search is 15/8. Slflll£Sa_Aliocation i - — - — - 1 Average number of page transitions in a search is 13/8. 115
Kleinrock, Leonard · California univ los angeles dept of computer science · Data processing · Data transmission systems · Digital computers · Interfaces · Mathematical models · Networks · Optimization · Queueing theory · Simulation · Time sharing
Internet Archive · Defense Technical Information Center · Public domain (US government work). Free to use for anything.
