Skip Navigation

The Computer Journal 1991 34(5):428-437; doi:10.1093/comjnl/34.5.428
© 1991 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (5)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Naor, D.
Right arrow Articles by Matloff, N. S.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Performance of Priority Queue Structures in a Virtual Memory Environment

D. Naor *, C. U. Martel * and N. S. Matloff *

Computer Science Division, University of California, Davis, CA 95616, USA

In this paper we study the performance of data structures in a Virtual Memory (VM) environment. As an example, we investigate the performance of priority queues which are used to implement the event-list in discrete event simulation programs. We treat this problem empirically, and present measurements of page fault performance for a few implementations under different settings. Some measurements are done on a real system, and others are obtained by simulating a VM environment. We suggest new versions of existing data structures which are tailored specifically for use in a VM environment. We investigate alternative page replacement and node alignment strategies and discuss their effect on performance.

Received June 1989. revised August 1990.

* Computer Science Division, University of California, Davis, CA 95616, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.