In virtual machine systems, with the increase in the number of VMs and the demands of the applications, the main memory is becoming a bottleneck for the application performance. To improve paging performance and alleviating thrashing behavior for memory-intensive or I/O-intensive virtual machine workloads, we proposed hypervisor based remote paging, which allows a virtual machine to transparent...

In this paper we consider the paging problem when the page request sequence is drawn from a distribution, and give an application to computer networking. In the IP-paging problem the page inter-request times are chosen according to independent distributions. For this model we construct a very simple deterministic algorithm whose page fault rate is at most 5 times that of the best online algorit...

In this paper we introduce a methodology for the analysis of the paging activity of parallel programs running on massively parallel systems. The methodology includes parallel program monitoring and the analysis of the collected data. We study the correlation of the paging activities of individual node programs in the SPMD execution mode and its effect on scheduling.

We propose a novel paging strategy based on the theory of optimal search with discrete efforts. When compared to conventional paging methods, the proposed scheme increases the mobile station discovery rate while decreasing the average number of times that a mobile station has to be paged in a location area. The proposal is fully compatible with existing cellular structures, and requires minimal...

This paper explores tracking strategies for mobile users in personal communication networks which are based on the topology of the cells. We introduce the notion of topology-based strategies in a very general form. In particular, the known paging areas, overlapping paging areas, reporting centers, and distance-based strategies are covered by this notion. We then compare two topology-based strat...

| We propose a novel paging strategy based on the theory of optimal search with discrete eeort. When compared to conventional paging methods, the proposed scheme increases the mobile station discovery rate while decreasing the average number of times that a mobile station has to be paged in a location area. The proposal is fully compatible with existing cellular structure and requires minimal c...