Search for dissertations about: "trivial computation"

Showing result 1 - 5 of 20 swedish dissertations containing the words trivial computation.

  2. 1. Improving Execution Efficiency by Targeting Redundancy and Parallelism

    Author : Mafijul Islam; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; trivial computation; redundancy; performance; thread-level parallelism; thread-level speculation; chip-multiprocessors; looptripcount; energy-efficiency; instruction reuse; control speculation.;

    Abstract : .... READ MORE

  4. 2. Techniques to Cancel Execution Early to Improve Processor Efficiency

    Author : Mafijul Islam; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; processor design; energy-efficiency; narrow-width cache; instruction reuse; zero-value cache; resource-efficient; narrow-width load; complexity-effective; small value locality; register file cache; frequent value locality; trivial instruction; silent load; high-performance; zero load;

    Abstract : The evolution of computer systems to continuously improve execution efficiency has traditionally embraced various approaches across microprocessor generations. Unfortunately, contemporary processors still suffer from several inefficiencies although they offer an unprecedented level of computing capabilities. READ MORE

  5. 3. Maximally Supersymmetric Models in Four and Six Dimensions

    Author : Fredrik Ohlsson; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Taub-NUT space; Flat connections; Topologically non-trivial connections; 0 theory; Maximal supersymmetry; 2; Circle fibrations; Yang-Mills theory;

    Abstract : We consider two examples of maximally supersymmetric models; the N=4 Yang-Mills theory in four dimensions and the (2,0) theory in six dimensions. The first part of the thesis serves as an introduction to the topics covered in the appended research papers, and begins with a self-contained discussion of principal fibre bundles and symplectic geometry. READ MORE

  6. 4. Time and space efficient algorithms for packet classification and forwarding

    Author : Mikael Sundström; Luleå tekniska universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Dependable Communication and Computation Systems; Kommunikations- och beräkningssystem;

    Abstract : The Internet consists of a mesh of routers (nodes) connected by links (edges) and the traffic through the Internet is divided into flows where each flow is an ordered sequence of packets, or datagrams. Each packet consists of a header and a piece of data, also referred to as payload. READ MORE

  7. 5. Automatic Verification of Petri Netsin a CLP framework

    Author : Hans Olsén; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : This thesis presents an approach to automatic verification of Petri Nets. The method is formulated in a CLP framework and the class of systems we consider is characterized syntactically as a special class of Constraint Logic Programs. The state space of the system in question coincides with the least fixpoint of the program. READ MORE