Avancerad sökning

Visar resultat 1 - 5 av 224 avhandlingar som matchar ovanstående sökkriterier.

  1. 1. Efficient and Practical Non-Blocking Data Structures

    Författare :Håkan Sundell; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; shared data structure; abstract data type; snapshot; lock-free; priority queue; synchronization; non-blocking; skip list; shared memory; deque; real-time; doubly linked list; dictionary; wait-free; shared register;

    Sammanfattning : This thesis deals with how to design and implement efficient, practical and reliable concurrent data structures. The design method using mutual exclusion incurs serious drawbacks, whereas the alternative non-blocking techniques avoid those problems and also admit improved parallelism. LÄS MER

  3. 2. Type Domains for Abstract Interpretation : A critical study

    Författare :Per Mildner; Jonas Barklund; Håkan Millroth; Roland Bol; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Computing Science;

    Sammanfattning : Programming languages with dynamic typing such as Prolog do not require that the programmer declares the types of data or procedures. This flexibility, however, comes at a price. The lack of declarations makes it hard for a compiler to produce fast code since data must be assumed to be of any type. LÄS MER

  4. 3. Relations in Dependent Type Theory

    Författare :Carlos Gonzalía; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; formalized mathematics; relational systems; category theory; programming logics; constructive type theory; logical frameworks; relational database model;

    Sammanfattning : This thesis investigates how to express and reason about relational concepts and methods inside the constructive logical framework of Martin-Löf's monomorphic type theory. We cover several areas where the notion of relation is central, and show how to formalize the basic concepts of each area. LÄS MER

  5. 4. Efficient Implementation of Concurrent Data Structures on Multi-core and Many-core Architectures

    Författare :Bapi Chatterjee; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Synchronization Primitives; Lock-free Binary search tree; Lock-free; Concurrent Data Structures;

    Sammanfattning : Synchronization of concurrent threads is the central problem in order to design efficient concurrent data-structures. The compute systems widely available in market are increasingly becoming heterogeneous involving multi-core Central Processing Units (CPUs) and many-core Graphics Processing Units (GPUs). LÄS MER

  7. 5. Types for Crash Preventionn

    Författare :Lars Pareto; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; reliability; dependability; concurrent programming; denotational semantics; real-time systems and embedded systems; data-flow; dynamic storage management; applicative functional programming languages ; type systems;

    Sammanfattning : This thesis seeks to strengthen the capabilities of static polymorphic type-checking (as known from typed lambda calculus and functional programming) to allow a larger class of programming errors to be caught at compile time: the goal is to not only prevent illegal uses of data, but to also errors that lead to busy-loops, deadlocks, stack-overflows and heap-overflows. The thesis exploits that, for recursive programs, many correctness properties (including freedom from errors leading to busy-loops, etc. LÄS MER