Avaliação das técnicas de compactação aplicáveis a programas em linguagens funcionais em arquiteturas superescalares
The need for fasters processors and effcient executions has motivated the designers of new architectures and methods for code otimization. This paper presents important aspects of the superscalar architectures functional languages and the compaction methods used with imperative languages programs. I...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Portugués |
| Publicado: |
1997
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/24060 |
| Aporte de: |
| Sumario: | The need for fasters processors and effcient executions has motivated the designers of new architectures and methods for code otimization. This paper presents important aspects of the superscalar architectures functional languages and the compaction methods used with imperative languages programs. It also presents a compaction method known as pessimistic algorithms based on software pipelining_ The method makes a global compaction of the program and can be applied to programs written in functional languages can be extended to the compaction of general recursive functions and can be used with superscalar machines. |
|---|