Search for dissertations about: "Online Algorithms"

Showing result 1 - 5 of 86 swedish dissertations containing the words Online Algorithms.

  1. 1. Reactive Concurrent Data Structures and Algorithms for Synchronization

    Author : Phuong Ha; Chalmers University of Technology; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; non-blocking; reactive; multi-word atomic primitives; online algorithms; shared memory; concurrent data structures; distributed data structures; randomization; online financial problems; synchronization; spin-locks;

    Abstract : Parallelism plays a significant role in high-performance computing systems, from large clusters of computers to chip-multithreading (CMT) processors. Performance of the parallel systems comes not only from concurrently runningmore processing hardware but also from utilizing the hardware efficiently. READ MORE

  2. 2. Distributed Optimization and Control : Primal--Dual, Online, and Event-Triggered Algorithms

    Author : Xinlei Yi; Karl H. Johansson; Dimos V. Dimarogonas; John S. Baras; Antonis Papachristodoulou; KTH; []
    Keywords : ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; TEKNIK OCH TEKNOLOGIER; NATURAL SCIENCES; ENGINEERING AND TECHNOLOGY; Distributed nonconvex optimization; distributed online convex optimization; distributed event-triggered control; primal-dual algorithm; stochastic gradient descent; zeroth-order algorithm; Electrical Engineering; Elektro- och systemteknik;

    Abstract : In distributed optimization and control, each network node performs local computation based on its own information and information received from its neighbors through a communication network to achieve a global objective. Although many distributed optimization and control algorithms have been proposed, core theoretical problems with important practical relevance remain. READ MORE

  3. 3. From Art Galleries to Terrain Modelling --- A Meandering Path through Computational Geometry

    Author : Mikael Hammar; Data Vetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; system; numerisk analys; Datalogi; systems; control; numerical analysis; Approximation Algorithms; Computational Geometry; Online Algorithms; Art Gallery Problem; Linear Search; Traveling Salesman Problem; R-Tree; Delaunay Triangulation; Polygon Exploration; Computer science; Shortest Watchman Routes; kontroll; Mathematics; Matematik;

    Abstract : We give approximation and online algorithms as well as data structures for some well studied problems in computational geometry. The thesis is divided into three parts. In part one, we study problems related to guarding, exploring and searching geometric environments. READ MORE

  4. 4. Shared Resources in Distributed Systems: Analytical Tools for Evaluation and Self-stabilizing Provisioning

    Author : Iosif Salem; Chalmers University of Technology; []
    Keywords : NATURVETENSKAP; TEKNIK OCH TEKNOLOGIER; NATURAL SCIENCES; ENGINEERING AND TECHNOLOGY; self-stabilization; smart grid; online algorithms; shared object systems; resource sharing; software-defined networks; distributed algorithms;

    Abstract : Distributed computing is an established computing paradigm of modern computing systems.The nodes of a distributed system interact either by sharing resources or via a communication network. In both cases, provisioning of shared resources is a challenge, for example when resource demand and supply varies or when the system is prone to failures. READ MORE

  5. 5. Scheduling Algorithms For Fault-Tolerant Real-Time Systems

    Author : Risat Pathan; Chalmers University of Technology; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Online Scheduling; Partitioned Scheduling; Rate-Monotonic Scheduling; Multiprocessors; Uniprocessor; Task-Splitting Algorithms; Periodic Task Scheduling; Real-Time Systems; Fault-Tolerant Scheduling;

    Abstract : This thesis deals with the problem of designing efficient fault-tolerant real-time scheduling algorithms for independent periodic tasks on uni- and multiprocessor platforms. The well-known Rate-Monotonic (RM) scheduling algorithm is assumed as it is widely used in many commercial systems due to its simplicity and ease of implementation. READ MORE