Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 44 for “"Basic Blocks"”.

  1. Constraint Programming Techniques for Optimal Instruction Scheduling

    … to expose maximum instruction level parallelism. Basic blocks and superblocks are commonly used regions of code in a program for instruction scheduling. Instruction scheduling coupled with register allocation is also a well studied problem to produce better machine code. Scheduling basic blocks …

    waterloo Repository record for Constraint Programming Techniques for Optimal Instruction Scheduling (opens in a new tab)

  2. Learning Instruction Scheduling Heuristics from Optimal Data

    … generate instruction scheduling heuristics for basic blocks and super blocks. A basic block is a block of code with a single flow of control and a super block is a collection of basic blocks with a single entry point but multiple exit points. We improve previous techniques for automated …

    waterloo Repository record for Learning Instruction Scheduling Heuristics from Optimal Data (opens in a new tab)

  3. Selective software-implemented hardware fault tolerance tecnhiques to detect soft errors in processors with reduced overhead

    … approaches are taken: (1) removing checkers from basic blocks: all the basic blocks are protected by SETA, but only selected basic blocks have checkers inserted, and (2) selectively protecting basic blocks: only a set of basic blocks is protected. The techniques and their selective versions are …

    brazil-ufrgs Repository record for Selective software-implemented hardware fault tolerance tecnhiques to detect soft errors in processors with reduced overhead (opens in a new tab)

  4. Selective Software-Implemented Hardware Fault Tolerance Techniques to Detect Soft Errors in Processors with Reduced Overhead

    … approaches are taken: (1) removing checkers from basic blocks: all the basic blocks are protected by SETA, but only selected basic blocks have checkers inserted, and (2) selectively protecting basic blocks: only a set of basic blocks is protected. The techniques and their selective versions are …

    alicante Repository record for Selective Software-Implemented Hardware Fault Tolerance Techniques to Detect Soft Errors in Processors with Reduced Overhead (opens in a new tab)

  5. Hardware-software design methods for security and reliability of MPSoCs

    … in the application processors is divided into basic blocks. The basic blocks in the application processors are statically instrumented with special instructions that allow communication with the MONITOR at runtime. The MONITOR verifies the execution of all the processors at runtime using …

    unsw Repository record for Hardware-software design methods for security and reliability of MPSoCs (opens in a new tab)

  6. A new approach to malware detection

    … control-flow graph and instruction classes of basic blocks as the signature of malware. This research direction is robust against certain obfuscation, such as variable substitution, instruction reordering. But only using instruction classes to detect obfuscated basic blocks will cause high …

    concordia Download PDF for A new approach to malware detection (opens in a new tab)

  7. WCET-aware compilation techniques for clustered VLIW processors

    … Our approach iteratively selects a set of basic blocks that may have impact on the WCET found by using WCET-aware graph reduction, performs live range splitting for a set of selected variables in those basic blocks if the set of basic blocks has impact on the WCET, computes the priorities …

    unsw Repository record for WCET-aware compilation techniques for clustered VLIW processors (opens in a new tab)

  8. General-purpose Reconfigurable Functional Cache architecture

    … purpose applications. We map frequently used basic blocks, loops, procedures, and functions, from a program on this reconfigurable cache. These program blocks are mapped on to the cache in terms of basic ALU instructions, along with the flow in terms of the dependencies between them. The cache …

    iastate Repository record for General-purpose Reconfigurable Functional Cache architecture (opens in a new tab)

  9. Compilation and Binary Editing for Performance and Security

    … analysis tools to identify the boundaries of basic blocks and the types of edges between them without examining individual instructions. A similar compilation mechanism is used to create individually relocatable basic blocks that can be relocated anywhere in memory at runtime to simplify …

    maryland Repository record for Compilation and Binary Editing for Performance and Security (opens in a new tab)

  10. The transactional HW/SW stack for fault tolerant embedded computing

    … that assembles programs into Transac- tional Basic Blocks, together with a novel microprocessor, the TransactiOnal Basic Block Architecture (ToBBA), which provides fine-grained error detection and deter- ministic error rollback and elimination using the Transactional Basic Blocks (TBBs) both …

    brazil-ufrgs Repository record for The transactional HW/SW stack for fault tolerant embedded computing (opens in a new tab)

  11. An implementation of an iterative global flow analysis algorithm

    … of a program, where the nodes correspond to basic blocks and the edges represent possible program control flows. In order to test the effectiveness of this algorithm, a general purpose optimizing module was written in XPL which analyzes ALGOL-E programs for constant computations, common …

    nps Repository record for An implementation of an iterative global flow analysis algorithm (opens in a new tab)

  12. Enhancing instruction-level parallelism through compiler-controlled speculation

    … parallelism (ILP) is extremely limited within basic blocks of non-numeric programs (1) (2) (3). An effective VLIW or superscalar processor must optimize and schedule instructions across basic block boundaries to achieve higher performance. An effective structure for ILP compilation is the …

    uiuc Repository record for Enhancing instruction-level parallelism through compiler-controlled speculation (opens in a new tab)

  13. A unified approach to instruction scheduling and register allocation on clustered VLIW processors

    … problem of scheduling a set of operations of a basic block on a clustered VLIW processor where for any two functional units, the two subsets of operations executed on these two functional units are either the same or disjoint. The objective is to minimise the schedule length for all the …

    unsw Repository record for A unified approach to instruction scheduling and register allocation on clustered VLIW processors (opens in a new tab)

  14. On the Near-Optimality of List Scheduling Heuristics for Local and Global Instruction Scheduling

    … scheduler capable of scheduling even very large blocks within a popular benchmark suite in a reasonable amount of time. I improved the architectural model and optimal scheduler by allowing for an issue width not equal to the number of functional units, instructions that monopolize the processor …

    waterloo Repository record for On the Near-Optimality of List Scheduling Heuristics for Local and Global Instruction Scheduling (opens in a new tab)

  15. A hierarchical dependence check and folded rename mapping based scalable dispatch stage

    … source operands for all the instructions in some basic blocks are produced either in the same basic block or in the immediately preceding basic block. In such a case, the rename tag of the producers can be represented as a number relative to the beginning of the respective basic blocks. Moreover, …

    iastate Repository record for A hierarchical dependence check and folded rename mapping based scalable dispatch stage (opens in a new tab)

  16. Modulo7 : A Full Stack Music Information Retrieval and Structured Querying Engine

    … musical notes instead of acoustic pitches as the basic blocks of representation of musical data). Modulo7 is implemented as a full stack deployment, with server components that parse various sources of music data into its own efficient internal representation and a client component that allows …

    jhu Repository record for Modulo7 : A Full Stack Music Information Retrieval and Structured Querying Engine (opens in a new tab)

  17. An Optimization Framework for Embedded Processors with Auto-Modify Addressing Modes

    … with considerations for memory accesses across basic blocks, because existing work mainly considers intra-basic-block information. We then use the available offset registers to try to further reduce the number of address arithmetic instructions after layout assignment.

    gatech Repository record for An Optimization Framework for Embedded Processors with Auto-Modify Addressing Modes (opens in a new tab)

  18. POOR MAN’S TRACE CACHE: A VARIABLE DELAY SLOT ARCHITECTURE

    … processor is reduced as multiple non contiguous basic blocks along a given path are encountered in one fetch cycle. 3. Replication of a branch instruction along multiple paths provides path separability for branches, which positively impacts branch prediction accuracy. PMTC mechanism requires …

    mtu Repository record for POOR MAN’S TRACE CACHE: A VARIABLE DELAY SLOT ARCHITECTURE (opens in a new tab)

  19. A hybrid-scheduling approach for energy-efficient superscalar processors

    … key observation that all instructions and all basic-blocks in a program are not equal; some blocks are inherently easy to schedule at compile-time, whereas others are not. In this scheme, programs are thus partitioned into low power “static regions” and high power “dynamic regions”. Static …

    texas Repository record for A hybrid-scheduling approach for energy-efficient superscalar processors (opens in a new tab)

  20. Adaptive ordering of code transformations in an optimizing compiler

    … static estimation of runtime frequencies of basic blocks. Termed "Estimated Virtual Execution", this approach reduces the search time by 40%--60%.

    rice Repository record for Adaptive ordering of code transformations in an optimizing compiler (opens in a new tab)

Page 1 of 3