• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 213
Next 10 →

WSCLoca- A Simple and Effective Algorithm for Virtual Memory Management

by Richard W. Cart
"... A new virtual memory management algorithm WSCLOCK has been synthesized from the local working set (WS) algorithm, the global CLOCK algorithm, and a new load control mechanism for auxiliary memory access. The new algorithm combines the most useful feature of WS-a natural and efti:ctive load control t ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
A new virtual memory management algorithm WSCLOCK has been synthesized from the local working set (WS) algorithm, the global CLOCK algorithm, and a new load control mechanism for auxiliary memory access. The new algorithm combines the most useful feature of WS-a natural and efti:ctive load control

Data Mountain: Using Spatial Memory for Document Management

by George Robertson, Mary Czerwinski, Kevin Larson, Daniel C. Robbins, David Thiel, Maarten Van Dantzich , 1998
"... Effective management of documents on computers has been a central user interface problem for many years. One common approach involves using 2D spatial layouts of icons representing the documents, particularly for information workspace tasks. This approach takes advantage of human 2D spatial cognitio ..."
Abstract - Cited by 273 (14 self) - Add to MetaCart
. We describe a new technique for document management called the Data Mountain, which allows users to place documents at arbitrary positions on an inclined plane in a 3D desktop virtual environment using a simple 2D interaction technique. We discuss how the design evolved in response to user feedback

EELRU: Simple and Effective Adaptive Page Replacement

by Yannis Smaragdakis, Scott Kaplan, Paul Wilson , 1999
"... Despite the many replacement algorithms proposed throughout the years, approximations of Least Recently Used (LRU) replacement are predominant in actual virtual memory management systems because of their simplicity and e ciency. LRU, however, exhibits well-known performance problems for regular acce ..."
Abstract - Cited by 64 (1 self) - Add to MetaCart
Despite the many replacement algorithms proposed throughout the years, approximations of Least Recently Used (LRU) replacement are predominant in actual virtual memory management systems because of their simplicity and e ciency. LRU, however, exhibits well-known performance problems for regular

Energy Management of Virtual Memory on Diskless Devices

by Jerry Hom Ulrich , 2001
"... In a pervasive computing environment, applications are able to run across different platforms with significantly different resources. Such platforms range from highperformance desktops to handheld PDAs. This paper discusses a compiler approach to reduce the energy consumption of a diskless device wh ..."
Abstract - Add to MetaCart
where the swap space is provided by a remotely mounted file system accessible via a wireless connection. Predicting swapping events at compile time allows effective energy management of a PDAs wireless communication component such as a 802.11 or Bluetooth The compiler activates and deactivates

A Simple and Efficient Algorithm for Cycle Collection

by Chin-yang Lin, Ting-wei Hou
"... The lack of collecting cyclic garbage is generally considered the major weakness of reference counting. Reference counted systems handle this problem by incorporating either a global tracing collector, or a ”partial ” tracing collector that considers only the cycle candidates but needs several trace ..."
Abstract - Add to MetaCart
garbage objects, thus improving the efficiency of the algorithm. The pseudocode and its correctness proof are also presented. Finally, an implementation based on Jikes Research Virtual Machine is provided to demonstrate the effectiveness of the new algorithm. Categories and Subject Descriptors D.3

Management

by Reza Azimi, Livio Soares, Michael Stumm, Thomas Walsh, Angela Demke Brown
"... Traditionally, operating systems use a coarse approximation of memory accesses to implement memory management algorithms by monitoring page faults or scanning page table entries. With finer-grained memory access information, however, the operating system can manage memory much more effectively. Prev ..."
Abstract - Add to MetaCart
Traditionally, operating systems use a coarse approximation of memory accesses to implement memory management algorithms by monitoring page faults or scanning page table entries. With finer-grained memory access information, however, the operating system can manage memory much more effectively

CoolCAMs: Power-Efficient TCAMs for Forwarding Engines

by Francis Zane, Girija Narlikar, Anindya Basu - IN IEEE INFOCOM , 2003
"... Ternary Content-Addressable Memories (TCAMs) are becoming very popular for designing high-throughput forwarding engines on routers: they are fast, cost-effective and simple to manage. However, a major drawback of TCAMs is their high power consumption. This paper presents architectures and algorithms ..."
Abstract - Cited by 93 (0 self) - Add to MetaCart
Ternary Content-Addressable Memories (TCAMs) are becoming very popular for designing high-throughput forwarding engines on routers: they are fast, cost-effective and simple to manage. However, a major drawback of TCAMs is their high power consumption. This paper presents architectures

Dynamic Grouping in an Object Oriented Virtual Memory Hierarchy

by Ifor Williams Mario, Mario Wolczko - Proceedings of the 1987 European Conference on Object-Oriented Programming, Lecture Notes in Computer Science , 1987
"... Object oriented programming environments frequently suffer serious performance degradation because of a high level of paging activity when implemented using a conventional virtual memory system. Although the fine-grained, persistent nature of objects in such environments is not conducive to efficien ..."
Abstract - Add to MetaCart
. This paper investigates the effectiveness of a simple dynamic grouping strategy based on dynamic behaviour and compares it with a static grouping scheme based on static properties. These schemes are also compared with near-optimal and random cases. 1 Introduction Virtual memory enables programs much larger

Scheduling and Page Migration for Multiprocessor Compute Servers

by Rohit Chandra, Scott Devine, Ben Verghese, Anoop Gupta, Mendel Rosenblum - INTERNATIONAL CONFERENCE ON ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS , 1994
"... Several cache-coherent shared-memory multiprocessors have been developed that are scalable and offer a very tight coupling between the processing resources. They are therefore quite attractive for use as compute servers for multiprogramming and parallel application workloads. Process scheduling and ..."
Abstract - Cited by 103 (5 self) - Add to MetaCart
and memory management, however, remain challenging due to the distributed main memory found on such machines. This paper examines the effects of OS scheduling and page migration policies on the performance of such compute servers. Our experiments are done on the Stanford DASH, a distributed-memory cache

Chapter 1 ENERGY MANAGEMENT OF VIRTUAL MEMORY ON DISKLESS DEVICES ∗

by Jerry Hom, Ulrich Kremer
"... In a pervasive computing environment, applications are able to run across different platforms with significantly different resources. Such platforms range from high-performance desktops to handheld PDAs. This paper discusses a compiler approach to reduce the energy consumption of a diskless device w ..."
Abstract - Add to MetaCart
where the swap space is provided by a remotely mounted file system accessible via a wireless connection. Predicting swapping events at compile time allows effective energy management of a PDAs wireless communication component such as a 802.11 or Bluetooth card. The compiler activates and de
Next 10 →
Results 1 - 10 of 213
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University