Skip to main content
Back to USENIX
  • Conferences
  • Students
Sign in

USENIX Conference Policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

Performance Implications of Multiple Pointer Sizes

Jeffrey C. Mogul, Joel F. Bartlett, Robert N. Mayo and Amitabh Srivastava, Digital Equipment Corporation, Western Research Laboratory

Many users need 64-bit architectures: 32-bit systems cannot support the largest applications, and 64-bit systems perform better for some applications. However, performance on some other applications can suffer from the use of large pointers; large pointers can also constrain feasible problem size. Such applications are best served by a 64-bit machine that supports the use of both 32-bit and 64-bit pointer variables.

This paper analyzes several programs and programming techniques to understand the performance implications of different pointer sizes. Many (but not all) programs show small but definite performance consequences, primarily due to cache and paging effects.

Jeffrey C. Mogul, Digital Equipment Corporation, Western Research Laboratory

Joel F. Bartlett, Digital Equipment Corporation, Western Research Laboratory

Robert N. Mayo, Digital Equipment Corporation, Western Research Laboratory

Amitabh Srivastava, Digital Equipment Corporation, Western Research Laboratory

BibTeX
@inproceedings {260467,
author = {Jeffrey C. Mogul and Joel F. Bartlett and Robert N. Mayo and Amitabh Srivastava},
title = {Performance Implications of Multiple Pointer Sizes},
booktitle = {USENIX 1995 Technical Conference (USENIX 1995 Technical Conference)},
year = {1995},
address = {New Orleans, LA},
url = {https://www.usenix.org/conference/usenix-1995-technical-conference/performance-implications-multiple-pointer-sizes},
publisher = {USENIX Association},
month = jan
}
Download

Links

Paper: 
http://usenix.org/publications/library/proceedings/neworl/full_papers/mogul.ps
  • Log in or register to post comments

© USENIX
EIN 13-3055038

  • Privacy Policy
  • Contact Us