Denning PJ. The working set model for program behavior. Communications of the ACM 1968; 11(5):323--333.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....p s CPU share relies on two measurements: the overall system load NR and as p s past load n(p) 5.5.2 Memory Physical memory on Linux and many other OSes is not a hard constraint: applications can use more virtual memory than the available physical memory. However, if the combined working set [22] of all applications exceeds the available physical memory, then the system thrashes. Thus, I can define the supply of memory to an application as the amount of memory it can use without the system thrashing (Section 2.3.3) There are three kinds of virtual memory pages that an application can ....

P. J. Denning. The working set model of program behavior. Communications of the ACM, 11(5):323--333, May 1968.

....SAD and OLR are easily extended to maintain that information, again allowing for accurate simulations without modification to the simulator. We will show how SAD and OLR can be applied to simulations of a compressed cache [WKS99] and of a variable space allocation policy such as Working Set (WS) [Den76]. In a shorter, earlier paper [KSW99] we presented the SAD and OLR algorithms, and provided a comparison to SD. In this paper, we present several extra results. The main result is the proof of optimality of the OLR algorithm. We also present the SAD2 algorithm, which is a supplement to SAD, and ....

....can then be reduced to a single reference. This reduction does not affect the simulation of time independent paging algorithms algorithms that do not consider the exact time of each reference in making replacement decisions. Such algorithms are LRU, OPT, etc. but not, for instance, Working Set [Den76], which must track every single memory reference. Blocking is so widely applicable that it is practically assumed in most simulation work. For the remainder of this paper, when we refer to an original trace, we are referring to a blocked trace. Blocking is also interesting in that it is ....

Peter J. Denning. The working set model for program behavior. Communications of the ACM, 19(5):285- 294, 1976.

....caching worthwhile. These results suggest that our framework can allow a more principled understanding of how components of the Web interact, leading to better insight into the entire Web as a system. II. BACKGROUND AND RELATED WORK The notion of temporal locality was first recognized by Denning [6] in his definition of the working set, which is the set of unique references contained within some fixed number of past references. This and other early work was in the domain of program memory references, as opposed to Web requests. Throughout this paper we refer simply to object references in ....

P. J. Denning, "The working set model for program behavior," Communications of the ACM, vol. 11, no. 5, pp. 323--333, May 1968.

....store the most recently accessed data from main memory. Due to the principle of locality, these recently accessed parts of memory are the most likely to be re used by the processor in the near future. Caches improve performance because most programs run on processors have large amounts of locality [3]. Locality means that after a processor accesses point x in memory, x and other locations close to x in memory tend to be accessed soon. Typically, researchers divide locality into two types. Temporal locality occurs when the processor reuses the same location in memory shortly after a previous ....

P. J. Denning. The working set model for program behavior. Communications of the ACM, 11(5):323-333, May 1968.

....focused on the behavior of individual applications. The memory and I O behavior of sequential applications received great attention during the early development of virtualmemory and file cache mechanisms and policies in traditional operating systems [22] For example, Denning s working set model [10], initially applied to memory access patterns, has also been examined as a model for sequential I O behavior [19] As with file systems, studies of commercial workloads [6, 18] have become more common in recent years. However, in this domain, the interaction or pipeline behavior of sequential ....

P. J. Denning. The working set model for program behavior. In Proceedings of the ACM symposium on Operating System Principles (SOSP), 1967.

....based on observations of past behavior has been studied extensively. Most of them exploit the recency and or frequency of past references. In traditional paging systems, temporal locality (recency information) is dominant and hence, a number of studies, such as the working set model by Denning [4], tried to characterize the temporal locality of page references. However, reference characteristics of Web environments are quite different from those of traditional computing environment due to the following reasons. First, reference streams seen by Web caches are generally the union of streams ....

P. J. Denning, "The Working Set Model for Program Behavior," Comm. ACM, vol.11. no.5, pp.323-333, 1968.

....hinges on the existence of a working sets at the function level and methods for identifying them accurately and eciently. In this paper we report on the experiments which show that programs exhibit a working set nature at the function level. While there is a large body of work on program behavior [24, 14, 9, 3, 21], to the best of our knowledge, there has been no e ort to study locality at the level of functions. 3 Background 3.1 De nitions Let N = f1; 2; ng be the set of functions which make up the program. Its dynamic behavior can be modelled as a sequence of accesses to the functions. Let = f ....

Peter J. Denning. The working set model for program behavior. In Proceedings of the ACM Symposium on Operating System Principles, pages 323-333. ACM, November 1967.

....hinges on the existence of a working sets at the function level and methods for identifying them accurately and eciently. In this paper we report on the experiments which show that programs exhibit a working set nature at the function level. While there is a large body of work on program behavior [25, 11, 12, 10, 22], to the best of our knowledge, there has been no e ort to study locality at the level of functions. 3 The Simulation Platform Program simulation techniques can be classi ed into one of 3 categories: trace driven, program driven or execution driven. In the trace driven approach a memory ....

Peter J. Denning. The working set model for program behavior. In Proceedings of the ACM Symposium on Operating System Principles, pages 323-333. ACM, November 1967.

....does not have the design challenge. Just like LRU, it chooses the victim block in the global stack. However, it can use the advantages provided by the detection based schemes. 2. 4 Working Set Models Lastly, we would like to compare our work with the working set model, an early work by Denning [6]. A working set of a program is a set of its recently used pages. Specifically, at virtual time t, a program s working set W t (#) is the subset of all pages of the program, which have been referenced in the previous # virtual time units (the working set window) A working set replacement ....

P. J. Denning, "The Working Set Model for Program Behavior", Communications of the ACM, Vol. 11, No. 5, May, 1968, pp. 323-333.

....of different deltas in order to introduce a new trailer. This environment can be compared with a client server software development environment that consists of workstations connected to a file server. The latency for sequentially browsing a file (video) should be less than 100 milliseconds [3]. Similarly, jumping from one line (frame) of the file (video) to another and referencing different files (video clips) should not be noticeable. The client server nature should not impact the correctness or behavior of a program (previewing of an edited clip) Otherwise, it is difficult to ....

P. J. Denning. The Working Set Model for Program Behavior. Communications of the ACM, 11(5):323-333, 1968.

....trac. Our observations are illustrated by comparing the footprints of real and synthetic traces, and by simulating routing table lookups driven by both types of traces. 1 Introduction It is well established that memory reference strings of computer programs exhibit spatial and temporal locality [1]. This locality is the motivating concept behind the use of instruction and data caches, which play a critical role in improving the performance of contemporary computer systems. In this paper, we apply the concepts of locality and workload modeling originally developed for investigating program ....

....This is because we only consider generating repeating addresses when the hit index is below LRU POINTER. Thus, in terms of the total fill LRU stack with unique items InitializeStack; for count: 1 to SyntheticTraceLength do begin generate index from uniform random real in [0, 1] U: Random1; if (U 1 Theta) then index : round( U ( A Theta) Theta) 1 (1 Theta) else index : round(random Cc) adjust if index 1 then index : 1; determine the address to output R = Random2 if index LRU POINTER and R SelfRepeatRate then address = ....

P. J. Denning. Working set model for program behavior. Communications of the ACM, 11(5):323-333, 1968.

No context found.

Denning PJ. The working set model for program behavior. Communications of the ACM 1968; 11(5):323--333.

No context found.

P.J. Denning, The working set model for program behavior, Commun. ACM 11 (5) (1968) 323--333.

No context found.

P.J. Denning, "The Working Set Model for Program Behavior", CACM 19(5) pp.285-294 (1976).

No context found.

P.J. Denning, "The working set model for program behavior," Communications of the ACM 11 (1968), pp. 323--333.

No context found.

P. J. Denning. The working set model for program behavior. Commun. ACM, 11(5):323--333, May 1968.

No context found.

P. J. Denning. The working set model for program behavior. Communications of the ACM, 11(5):323--333, May 1968.

No context found.

P. J. Denning. The working set model for program behavior. Communications of the ACM, 11(5):323--333, 1968.

No context found.

P. J. Denning. The Working Set Model for Program Behavior. Communications of the ACM, 11(5), May 1968. 10

No context found.

Denning, P.J. The working set model for program behavior. Comm. ACM 11, 5 (May 1968), 323-333.

No context found.

P. J. Denning. The working set model for program behavior. Communications of the ACM, 11(5):323-333, May 1968.

No context found.

Peter J. Denning. The working set model for program behavior. Communications of the ACM, 11(5):323--333, May 1968.

No context found.

P. Denning, The working set model for program behavior, Comm. Assoc. Comput. Mach. 11 (1968), 323#333.

No context found.

Denning, P.J. The working set model for program behavior. Comm. ACM 1l, 5 (May 1968), 323-333.

No context found.

Denning, P. J., "The Working Set Model for Program Behavior", CACM 11, 5 (May 1968), pp. 323-333.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC