Results 1 to 10 of about 46,626 (281)

COMPARISON OF INSTRUCTION SCHEDULING AND REGISTER ALLOCATION FOR MIPS AND HPL-PD ARCHITECTURE FOR EXPLOITATION OF INSTRUCTION LEVEL PARALLELISM [PDF]

open access: diamondEngineering Heritage Journal, 2018
The integrated approaches for instruction scheduling and register allocation have been promising area of research for code generation and compiler optimization.
Rajendra Kumar
doaj   +3 more sources

Exploiting instruction- and data-level parallelism [PDF]

open access: greenIEEE Micro, 1997
Simultaneous multithreaded vector architectures combine the best of data-level and instruction-level parallelism and perform better than either approach could separately. Our design achieves performance equivalent to executing 15 to 26 scalar instructions/cycle for numerical applications.
Roger Espasa, Mateo Valero
openalex   +5 more sources

Dual-IS: Instruction Set Modality for Efficient Instruction Level Parallelism

open access: green, 2022
Exploiting instruction level parallelism (ILP) is a widely used method for increasing performance of processors. While traditional very long instruction word (VLIW) processors can exploit ILP energy-efficiently thanks to static instruction scheduling, they suffer from bad code density with serial parts that cannot utilize the multi-issue capabilities ...
Kari Hepola   +2 more
openalex   +3 more sources

Instruction-level parallelism in Prolog [PDF]

open access: bronzeProceedings of the 19th annual international symposium on Computer architecture - ISCA '92, 1992
The demand of increasing computation power for symbolic processing has given a strong impulse to the development of ASICs dedicated to the execution of prolog. Unlike past microcoded implementation based on the Warren machine model, novel trends in high performance Prolog processors suggest the implementation of RISC-based processors committed to ...
Alessandro De Gloria, Paolo Faraboschi
openalex   +3 more sources

Increasing Instruction-Level Parallelism with Instruction Precomputation [PDF]

open access: bronze, 2002
Value reuse improves a processor’s performance by dynamically caching the results of previous instructions and reusing those results to bypass the execution of future instructions that have the same opcode and input operands. However, continually replacing the least recently used entries could eventually fill the value reuse table with instructions ...
Joshua J. Yi   +2 more
openalex   +3 more sources

Scalable instruction-level parallelism through tree-instructions [PDF]

open access: goldProceedings of the 11th international conference on Supercomputing - ICS '97, 1997
We describe a representation of instruction-level parallelism which does not require checking dependencies at run-time, and which is suitable for processor implementations with varying issuewidth. In this approach, a program is represented as a sequence of tree-instructions, each containing multiple primitive operations and executable either in one or ...
Jaime H. Moreno, Mayan Moudgil
openalex   +2 more sources

Converting thread-level parallelism to instruction-level parallelism via simultaneous multithreading [PDF]

open access: bronzeACM Transactions on Computer Systems, 1997
To achieve high performance, contemporary computer systems rely on two forms of parallelism: instruction-level parallelism (ILP) and thread-level parallelism (TLP). Wide-issue super-scalar processors exploit ILP by executing multiple instructions from a single program in a single cycle. Multiprocessors (MP) exploit TLP by executing different threads in
Jack Lo   +5 more
openalex   +2 more sources

Register Saturation in Instruction Level Parallelism [PDF]

open access: greenInternational Journal of Parallel Programming, 2005
The registers constraints are usually taken into account during the scheduling pass of an acyclic data dependence graph (DAG): any schedule of the instructions inside a basic block must bound the register requirement under a certain limit. In this work, we show how to handle the register pressure before the instruction scheduling of a DAG.
Sid-Ahmed-Ali Touati
openalex   +5 more sources

Cimple: instruction and memory level parallelism [PDF]

open access: gold, 2018
To appear in PACT ...
Vladimir Kiriansky   +3 more
openalex   +3 more sources

Instruction Level Parallelism and Memory Synchronization

open access: bronzeINTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT
The simultaneous or parallel execution of a series of instructions within a computer program is known as instruction-level parallelism, or ILP. ILP stands for the average number of instructions executed throughout each stage of this parallel execution, to be more precise.
Rupam Sardar
openalex   +3 more sources

Home - About - Disclaimer - Privacy