National Repository of Grey Literature 3 records found  Search took 0.00 seconds. 
Software Execution Acceleration Using Automatic Instruction Set Extensions
Melo, Stanislav ; Dolíhal, Luděk (referee) ; Masařík, Karel (advisor)
One of the important feature of application specific processors is performance. To maximize it, the processor must adapt to needs of application that it is going to perform. One of the ways to do that is to search for appropriate instructions that can be joined into one special instruction. This instruction is then implemented in hardware as a single function block. This bachelor's thesis describes problem of finding and selecting suitable candidates for instruction-set extension. It also provides brief overview of the few best known algorithms that solve this problem. Moreover the thesis deals with the single-cut algorithm and its implementation in more detail.
Program Instrumentation Enabling Coverage Measurement
Václavík, Jan ; Peringer, Petr (referee) ; Smrčka, Aleš (advisor)
This thesis deals with the design and the implementation of the Ginstrum tool for compile time instrumentation of C programs. The tool is implemented as a GCC Plugin and instruments places in program that access memory, write to memory or call functions. The tool also provides compile information that can be used for the code coverage measurement during testing and dynamic analysis.
Software Execution Acceleration Using Automatic Instruction Set Extensions
Melo, Stanislav ; Dolíhal, Luděk (referee) ; Masařík, Karel (advisor)
One of the important feature of application specific processors is performance. To maximize it, the processor must adapt to needs of application that it is going to perform. One of the ways to do that is to search for appropriate instructions that can be joined into one special instruction. This instruction is then implemented in hardware as a single function block. This bachelor's thesis describes problem of finding and selecting suitable candidates for instruction-set extension. It also provides brief overview of the few best known algorithms that solve this problem. Moreover the thesis deals with the single-cut algorithm and its implementation in more detail.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.