Name
Abstract | ||
|---|---|---|
Very long instruction word (VLIW) machines potentially provide the most direct way to exploit instruction-level parallelism; however, they cannot be used to emulate current general-purpose instruction set architectures. In addition, programs scheduled for a particular implementation of a VLIW model cannot be guaranteed to be binary compatible with other implementations of the same machine model with a different number of functional units or functional units with different latencies. This paper describes an architecture, named dynamically trace scheduled VLIW (DTSVLIW), that can be used to implement machines that execute code of current RISC or CISC instruction set architectures in a VLIW fashion, with backward code compatibility. Preliminary measurements of the DTSVLIW performance, obtained with an execution-driven simulator running the SPECint95 benchmark suite, are also presented. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1006/jpdc.2000.1661 | J. Parallel Distrib. Comput. |
Keywords | Field | DocType |
ilp,vliw,dtsvliw,dynamic instruction scheduling,ilp.,dynamically scheduling vliw instruction,instruction scheduling,very long instruction word,dynamic scheduling,instruction set architecture,functional unit | Very long instruction word,Computer science,Instruction set,Scheduling (computing),Parallel computing,Reduced instruction set computing,Binary code compatibility,Complex instruction set computing,Systems architecture,Benchmark (computing),Distributed computing | Journal |
Volume | Issue | ISSN |
60 | 12 | Journal of Parallel and Distributed Computing |
Citations | PageRank | References |
7 | 0.55 | 29 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. F. de Souza | 1 | 7 | 0.89 |
| P. Rounce | 2 | 12 | 2.19 |