Working Set
نویسنده
چکیده
The working set is a dynamic subset of a process’s address space that must be loaded in main memory to ensure acceptable processing efficiency. Working set policies can be tuned for close-tooptimal throughput and response time. They prevent thrashing. The working set is the reference standard for all virtual memory management policies.
منابع مشابه
Investigation on Environmental Factors Influencing Water Erosion (case study:Taleghan basin, Varkesh subbasin)
The purpose of current study is to investigate the effects of some of environmental factors on erosion value, to find the most important governing factors and the relation between erosion of working units and environmental factors (soil characteristics, slope, aspect, elevation, lithology, geomorphology faces and vegetation cover percentage). Working units map was prepared using geomorphology...
متن کاملUsing the Resizable Working-set Notion for Software Distributed Shared Memory
This paper proposes an adaptive invalidate/update protocol for software distributed shared memory(DSM), which use the working-set notion of a conventional operating system as the criteria for determining whether to update or invalidate. The proposed protocol can adjust the amount of update messages as changing the value of working-set size. The proposed protocol was implemented in CVM[4], a sof...
متن کاملUnderstanding the Working Sets of Data Mining Applications
Data mining applications discover useful information or patterns in large sets of data. Because they can be highly parallelizable and computationally intensive, data mining applications have the potential to take advantage of the large numbers of processors predicted for future multi-core systems. However, the potential performance of these applications on this emerging platform is likely to be...
متن کاملGeneralized Working Sets for Segment Reference
Tne working set concept is extended for programs that reference segments of different sizes. The generalized working set policy (GWS) keeps as its resident set those segments whose retention costs do not exceed their retrieval costs. The GWS is a model for the entire class of demand-fetching memory policies that satisfy a resident set inclusion property. A generalized optimal policy (GOPT) is a...
متن کاملFast Training of Linear Programming Support Vector Machines Using Decomposition Techniques
Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decomposition techniques leads to infinite loops. To solve this problem and to further speed up training, in this paper, we propose an improved decomposition techniques for training LP-SVMs. If an infinite loop is detected, we inclu...
متن کامل