Essays about: "Linked-Lists"
Showing result 1 - 5 of 7 essays containing the word Linked-Lists.
-
1. A JVM-Managed Concurrent Unrolled List-Based Set Using Lazy Synchronization
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The multicore revolution of the early 21st century has introduced a multitude of multiprocessor synchronization techniques for designing concurrent data structures. This thesis explores the concept of “unrolling”, or storing multiple data items per node, in order to increase the concurrent throughput of linked-lists, or more specifically list-based sets of linked nodes. READ MORE
-
2. Real Time Depth Sorting of Transparent Fragments
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Using transparency is an important technique for modelling partial coverage in computer graphics and is used for a variety of effects such as hair, fur, glass, smoke and particle effects. Replacing the per object sorting as the dominant algorithm used in real time 3D engines with anew algorithm with less rendering artifacts could let artists use more transparency and effects in their scenes. READ MORE
-
3. Efficient Multi-Core Implementation of the IPsec Encapsulating Security Payload Protocol for a Single Security Association
University essay from Linköpings universitet/Programvara och systemAbstract : As the mobile Internet traffic increases, the workload of the base stations processing this traffic increases with it. To cope with this, the telecommunication providers responsible for the systems deployed in these base stations have looked to parallelism. READ MORE
-
4. Rendering Light and Shadows for Transparent Objects
University essay from Lunds universitet/Institutionen för datavetenskapAbstract : This masters thesis presents a new approach to enable complex illuminationand shadowing for transparent objects such as glass or smoke. This is achievedby combining two algorithms which are intended to run in a real-time environment commonly found in modern computer games. READ MORE
-
5. Implementing Order Relations on Graphs
University essay from Institutionen för informationsteknologiAbstract : The design of automatic verification methods for programs manipulating dynamic data structures is a challenging problem. We consider programs that operate on a data structures with one next-pointer, such as singly linked lists and circular lists. We refer to such data structures as heaps. READ MORE