Results 1 to 10 of about 43,501 (214)
COMPARISON OF INSTRUCTION SCHEDULING AND REGISTER ALLOCATION FOR MIPS AND HPL-PD ARCHITECTURE FOR EXPLOITATION OF INSTRUCTION LEVEL PARALLELISM [PDF]
Engineering 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
Topic 7: Parallel Computer Architecture and Instruction Level Parallelism [PDF]
, 2006 Peer ...
Eduard Ayguadé +3 more
openalex +5 more sources
Instruction-level parallelism in Prolog [PDF]
Proceedings 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
+7 more sources
Limits of instruction-level parallelism [PDF]
Proceedings of the fourth international conference on Architectural support for programming languages and operating systems - ASPLOS-IV, 1991 Growing interest in ambitious multiple-issue machines and heavilypipelined machines requires a careful examination of how much instructionlevel parallelism exists in typical programs. Such an examination is complicated by the wide variety of hardware and software techniques for increasing the parallelism that can be exploited, including branch ...
David W. Wall
openalex +3 more sources
Instructional Level Parallelism
, 2019 This paper is a review of the developments in Instruction level parallelism. It takes into account all the changes made in speeding up the execution. The various drawbacks and dependencies due to pipelining are discussed and various solutions to overcome them are also incorporated.
Taposh Dutta-Roy
openalex +4 more sources
Limits of Instruction-Level Parallelism Capture
Procedia Computer Science, 2013 AbstractWe analyse the capacity of different running models to benefit from the Instruction-Level Parallelism (ILP). First, we show where the locks to the capture of distant ILP reside. We show that i) fetching in parallel, ii) renaming memory references and iii) removing parasitic true dependencies on the stack management are the keys to capture ...
Bernard Goossens, David Parello
openalex +3 more sources
Software thread integration for instruction-level parallelism [PDF]
ACM Transactions on Embedded Computing Systems, 2013 Multimedia applications require a significantly higher level of performance than previous workloads of embedded systems. They have driven digital signal processor (DSP) makers to adopt high-performance architectures like VLIW (Very-Long Instruction Word).
Won So, Alexander G. Dean
+6 more sources
Topic 8 Parallel Computer Architecture and Instruction-Level Parallelism [PDF]
, 2003 Parallel computer architecture and instruction-level parallelism are hot topics at Euro-Par conferences, since these techniques are present in most contemporary computing systems. At Euro-Par 2003, 18 papers were submitted to the topic, from which 1 distinguished, 4 regular and 4 short papers were accepted.
Stamatis Vassiliadis +3 more
openalex +3 more sources
Employing register channels for the exploitation of instruction level parallelism [PDF]
ACM SIGPLAN Notices, 1990 A multiprocessor system capable of exploiting fine-grained parallelism must support efficient synchronization and data passing mechanisms. This paper demonstrates the use of shared register channels as the communication mechanism among processors in a multiprocessor chip.
Rajiv Gupta
openalex +4 more sources
Increasing Instruction-Level Parallelism with Instruction Precomputation [PDF]
, 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 +4 more sources