Arquitetura de máquina de pilha, implementação e avaliação de processador em uma descrição de alto nível.

Abstract

Machines with stack oriented architecture are an alternative to register architectures found in today’s computers. In a stack machine, the instructions do not need address operands because the stack behavior limits the access to a position on the top of it, although some approaches allow addressing of up to two operands. This approach may have some advantages over registers machines, since this machine works naturally with stack for any arithmetic, logic or function call. While in registers machines, stack structures need to be mounted and accessed in memory, which typically has lower performance compared to using registers. On the other hand, the register machine has greater flexibility compared to no operand stack machines, as the explicit addressing operands does not require any drive in the memory structure so that the operands are allocated on top of a stack. However, the stack machine programming is substantially different from the typically programming used in registers machine, making them incompatible. With this, we propose a study of the stack machines in order to analyze architectural changes which are likely to have greater impact on system performance. Still, it is expected to obtain a performance comparison with a register-based architecture.