Implications of structured programming for machine architecture
Communications of the ACM
Advances in Computer Architecture
Advances in Computer Architecture
High-Level Language Computer Architecture
High-Level Language Computer Architecture
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Stack Computers: An Introduction
Computer
Representing the Effect of Instruction Prefetch in a Microprocessor Performance Model
IEEE Transactions on Computers
On the Development of a Measurement System for High Level Language Program Statistics
IEEE Transactions on Computers
An optimistic implementation of the stack-heap
Journal of Systems and Software
| Hi-index | 14.99 |
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.