Demand Paging in Windows NT
نویسندگان
چکیده
Demand paging is a fundamental part of today's computer systems. Understanding demand paging performance is critical if we are to analyze and predict the performance for large-scale applications. This work presents experiments that illuminate the meaning of paging performance metrics available under Windows NT. We find that under some memory access conditions the Windows NT Cache manager will induce more paging activity than is explicitly requested by an application while at the same time, paging activity is not attributed to the application at all.
منابع مشابه
Coordinated Thread Scheduling for Workstation Clusters Under Windows NT
Coordinated thread scheduling is a critical factor in achieving good performance for tightly-coupled parallel jobs on workstation clusters. We are building a coordinated scheduling system that coexists with the Windows NT scheduler which both provides coordinated scheduling and can generalize to provide a wide range of resource abstractions. We describe the basic approach, called “demand-based ...
متن کامل50-30-19 Windows NT Architecture
Windows NT is a 32-bit, preemptive multitasking operating system that includes comprehensive networking capabilities and several levels of security. Microsoft markets two version of Windows NT: one for workstations—appropriately named Windows NT Workstation—and a second for servers—Windows NT Server. This article, which describes the workings of the NT architecture, collectively references both...
متن کاملDesigning distributed multimedia systems using PARSE
With recent vast improvements in computer hardware, in particular, the processing capacity of multimedia database servers, and high performance of networks, distributed multimedia applications are becoming a reality. This paper presents an object-based approach to the design of distributed multimedia software. In particular, the PARSE methodology for designing parallel and distributed systems i...
متن کاملThe Competitiveness of on - Line Demand Paging
We investigate the performance ofon-line demand paging algorithms (in comparison with the optimal off-line demand paging algorithms) for generalized two level memo ries, which are two level memories whose second level is composed of different speed memories. We consider and model variants of this problem which are of practical inter est. We especially investigate LRU and FIFO, which are both ...
متن کاملUser-level Resource-constrained Sandboxing
The popularity of mobile and networked applications has resulted in an increased demand for execution “sandboxes”—environments that impose irrevocable restrictions on resource usage. Existing approaches rely on kernel modification for enforcing quantitative restrictions (e.g., limiting CPU utilization of an application to 25%). However, the general applicability of such approaches is constraine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007