By Topic

A Performance Analysis of the Implementation of Addressing Methods in Block-Structured Languages

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
De Prycker, M. ; Department of Computer Science, University of Ghent

Variable accesses and scope rule enforcements represent a major part of the execution time of block-structured high-level language programs. The performance of a computer system largely depends on the implementation of the variable addressing mechanism. Several lexical level addressing mechanisms exist to reduce this overhead, including the well-known display mechanism and a proposal by Tanenbaum. The choice among these mechanisms is not trivial, and requires a careful performance analysis.

Published in:

Computers, IEEE Transactions on  (Volume:C-31 ,  Issue: 2 )