Philippas Tsigas
Showing 245 publications
How to Relax Instantly: Elastic Relaxation of Concurrent Data Structures
PARMA-CC: A Family of Parallel Multiphase Approximate Cluster Combining Algorithms
IP. LSH. DBSCAN : Integrated Parallel Density-Based Clustering Through Locality-Sensitive Hashing
STRETCH: Virtual Shared-Nothing Parallelism for Scalable and Elastic Stream Processing
pi-Lisco: parallel and incremental stream-based point-cloud clustering
Performance Analysis and Modelling of Concurrent Multi-access Data Structures
The Impact of Synchronization in Parallel Stochastic Gradient Descent
ASAP.SGD: Instance-based Adaptiveness to Staleness in Asynchronous SGD
ScaleJoin: a Deterministic, Disjoint-Parallel and Skew-Resilient Stream Join
MAD-C: Multi-stage Approximate Distributed Cluster-combining for obstacle detection and localization
TSLQueue: An Efficient Lock-Free Design for Priority Queues
Concurrent linearizable nearest neighbour search in LockFree-kD-tree
Consistent lock-free parallel stochastic gradient descent for fast and stable convergence
PARMA-CC: Parallel Multiphase Approximate Cluster Combining
MindTheStep-AsyncPSGD: Adaptive Asynchronous Parallel Stochastic Gradient Descent
Lock-Free Search Data Structures: Throughput Modeling with Poisson Processes
Lock-free concurrent data structures and how to model their performance
Modeling the performance of atomic primitives on modern architectures
MAD-C: Multi-stage Approximate Distributed Cluster-Combining for Obstacle Detection and Localization
Analysis of door openings of refrigerated display cabinets in an operational supermarket
Shared-object system equilibria: Delay and throughput analysis
Viper: Communication-layer determinism and scaling in low-latency stream processing
Concurrent linearizable nearest neighbour search in lockfree-kd-Tree
Viper: A module for communication-layer determinism and scaling in low-latency stream processing
Concurrent lock-free unbounded priority queue with mutable priorities
How lock-free data structures perform in dynamic environments: Models and analyses
Performance modeling of stream joins
Wait-Free Programming for General Purpose Computations on Graphics Processors
Peppher: Performance Portability and Programmability for Heterogeneous Many-Core Architectures
Maximizing determinism in stream processing under latency constraints
Lock-Free Concurrent Data Structures
Scalable Lock-Free Vector with Combining
Help-optimal and Language-portable Lock-free Concurrent Data Structures
Shared-object system equilibria: Delay and throughput analysis
Customization methodology for implementation of streaming aggregation in embedded systems
Highly concurrent stream synchronization in many-core embedded systems
A Systematic Methodology for Optimization of Applications Utilizing Concurrent Data Structures
Help-Optimal and Language-Portable Lock-Free Concurrent Data Structures
ScaleJoin: a Deterministic, Disjoint-Parallel and Skew-Resilient Stream Join
Modeling Energy Consumption of Lock-Free Queue Implementations
Analyzing the Performance of Lock-Free Data Structures: A Conflict-Based Model
Of concurrent data structures and iterations
ScaleJoin: a Deterministic, Disjoint-Parallel and Skew-Resilient Stream Join
Modeling Energy Consumption of Lock-Free Queue Implementations
A Consistency Framework for Iteration Operations in Concurrent Data Structures
Shared-object System Equilibria: Delay and Throughput Analysis
Concurrent Linearizable Nearest Neighbour Search in LockFree-kD-tree
Data-Streaming and Concurrent Data-Object Co-design: Overview and Algorithmic Challenges
The lock-free k-LSM relaxed priority queue
Performance and power consumption evaluation of concurrent queue implementations in embedded systems
Deterministic Real-Time Analytics of Geospatial Data Streams through ScaleGate Objects
A Graph-Based Analysis of Medical Queries of a Swedish Health Care Portal
Self-stabilizing TDMA algorithms for wireless ad-hoc networks without external reference
Modeling and Analyzing the Performance of Lock-Free Data Structures
ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List
Evaluation of message passing synchronization algorithms in embedded systems
Data structures for task-based priority scheduling
Brief announcement: Concurrent data structures for efficient streaming aggregation
Data structures for task-based priority scheduling
Concurrent Data Structures in Architectures with Limited Shared Memory Support
Enhancing Concurrent Data Structures with Concurrent Iteration Operations
Overlapping Communities for Identifying Misbehavior in Network Communications
Efficient lock-free binary search trees
A Local Seed Selection Algorithm for Overlapping Community Detection
A Study of the Behavior of Synchronization Methods in Commonly Used Languages and Systems
Concurrent Data Structures for Efficient Streaming Aggregation
Configurable Strategies for Work-stealing
Self-stabilizing TDMA Algorithms for Wireless Ad-hoc Networks without External Reference
Scalable group communication supporting configurable levels of consistency
Bridging Physical and Digital Traffic System Simulations with the Gulliver Test-Bed
Supporting Lock-Free Composition of Concurrent Data Objects: Moving Data Between Containers
Self-stabilizing TDMA Algorithms for Wireless Ad-Hoc Networks without External Reference
Lock-free Concurrent Data Structures
On Using the Gulliver Platform for Bridging Physical and Digital Traffic System Simulations
Work-stealing with Configurable Scheduling Strategies
Cooperative driving for best road network capacity
Topic 12: Theory and algorithms for parallel computation (Introduction)
Safe System-level Concurrency for Resource-Constrained Nodes
Towards Modeling Legitimate and Unsolicited Email Traffic Using Social Network Properties
KARYON: Towards Safety Kernels for Cooperative Vehicular Systems
Self-stabilizing (k,r)-clustering in Clock Rate-limited Systems
ACM Journal on Experimental Algorithmics Special Issue on Multicore Algorithms
Autonomous TDMA Alignment for VANETs
An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic
The anti-social behavior of spam
Security in wireless sensor networks
Mining Network-Level Communication Patterns of Email Traffic for Spotting Unsolicited Email
CoMarkSplit: A Concurrent Mark-Split Garbage Collector
Understanding the Performance of Concurrent Data Structures on Graphics Processors
Adapting Lock-Free Concurrent Data Objects to Support a Generic Move Operation
Dynamic Load Balancing using Work-Stealing
Progress guarantees when composing lock-free objects
A self-stabilizing (k,r)-clustering algorithm with multiple paths for wireless Ad-hoc networks
PEPPHER: Efficient and Productive Usage of Hybrid Computing Systems
Mapping Systems Security Research at Chalmers
A lock-free algorithm for concurrent bags
On Collection of Large-Scale Multi-Purpose Datasets on Internet Backbone Links
CluB: A Cluster Based Framework for Mitigating Distributed Denial of Service Attacks
A Lock-Free Algorithm for Concurrent Bags
Structural and Temporal Properties of Email and Spam Networks
Robust and scalable middleware for selfish-computer systems
Secure and self-stabilizing clock synchronization in sensor networks
Supporting Lock-Free Composition of Concurrent Data Objects
Towards a Software Transactional Memory for Graphics Processors
Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency
Supporting Lock-Free Composition of Concurrent Data Objects
Game authority for robust and scalable distributed selfish-computer systems
NBmalloc: Allocating Memory in a Lock-Free Manner
Self-stabilizing (k,r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
Mitigating Distributed Denial of Capability Attacks Using Sink Tree Based Quota Allocation
Supporting Lock-Free Composition of Concurrent Data Objects
Secure and Self-stabilizing Clock Synchronization in Sensor Networks
Analyzing the Social Structure and Dynamics of E-mail and Spam in Massive Backbone Internet Traffic
The Synchronization Power of Coalesced Memory Accesses
Self-stabilizing (k,r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
A* Algorithm for Graphics Processors
Supporting Lock-Free Composition of Concurrent Data Objects
Supporting Lock-Free Composition of Concurrent Data Objects
Brushing the Locks out of the Fur: A Lock-Free Work Stealing Library
CluB: A Cluster Based Method for Mitigating Distributed Denial of Service Attacks
GPU-Quicksort: A practical Quicksort algorithm for graphics processors
Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
NB-FEB: A Universal Scalable Easy-to-Use Synchronization Primitive for Manycore Architectures
Dynamic Transparency for 3D Visualization: Design and Evaluation
Secure and Self-stabilizing Clock Synchronization in Sensor Networks
Preliminary results on nb-feb, a synchronization primitive for parallel programming
Towards a Software Transactional Memory for CUDA
NOBLE: non-blocking programming support via lock-free shared abstract data types
Online search with time-varying price bounds
Non-blocking programming on multi-core graphics processors
ContikiSec: A Secure Network Layer for Wireless Sensor Networks under the Contiki Operating System
Wait-free Programming for General Purpose Computations on Graphics Processors
The Synchronization Power of Coalesced Memory Accesses
On Sorting and Load-Balancing on GPUs
Multiword atomic read/write registers on multiprocessor systems
NB-FEB: An Easy-to-Use and Scalable Universal Synchronization Primitive for Parallel Programming
A Taxonomy of 3D Occlusion Management for Visualization
DataMeadow: a visual canvas for analysis of large-scale multivariate data
On Sorting and Load-Balancing on GPUs
A Practical Quicksort Algorithm for Graphics Processors
Brief Announcement: Wait-free Programming for General Purpose Computations on Graphics Processors
A Practical Quicksort Algorithm for Graphics Processors
Evaluating motion constraints for 3D wayfinding in immersive and desktop virtual environments
The Synchronization Power of Coalesced Memory Accesses
Lock-Free Deques and Doubly Linked Lists
On Dynamic Load Balancing on Graphics Processors
Secure and Self-Stabilizing Clock Synchronization in Sensor Networks
Employing Dynamic Transparency for 3D Occlusion Management: Design Issues and Evaluation
CiteWiz: a tool for the visualization of scientific citation networks
Game Authority for Robust and Scalable Distributed Selfish Computer Systems
TrustNeighborhoods: Visualizing Trust in Distributed File Sharing Systems
Self-tuning reactive diffracting trees
LYDIAN: An Extensible Educational Animation Environment for Distributed Algorithms
View-projection animation for 3D occlusion management
DataMeadow: A Visual Canvas for Analysis of Large-Scale Multivariate Data
DataMeadow: A Visual Canvas for Analysis of Large-Scale Multivariate Data
Tour Generation for Exploration of 3D Virtual Environments
Topic 8 Distributed Systems and Algorithms
A Taxonomy of 3D Occlusion Management Techniques
Efficient Self-tuning Spin-locks Using Competitive Analysis
Secure and Fault-Tolerant Clock Synchronization in Sensor Networks
Competitive Freshness Algorithms for Wait-free Data Objects
Wait-Free Queue Algorithms for the Real-time Java Specification
Image-Space Dynamic Transparency for Improved Object Discovery in 3D Environments
Using 3D Audio Guidance to Locate Indoor Static Objects
View Projection Animation for Occlusion Reduction
Lightweight Causal Cluster Consistency
On Navigation Guidance for Exploration of 3D Environments
Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
Efficient Multi-Word Locking Using Randomization
Competitive Freshness Algorithms for Wait-free Data Objects
Practical and Efficient Lock-Free Garbage Collection Based on Reference Counting
Lightweight Causal Cluster Consistency
TrustNeighborhoods: Visualizing Trust in Distributed File Sharing Systems
Fast and Lock-Free Concurrent Priority Queues for Multi-Thread Systems
Reactive Spin-locks: A Self-tuning Approach
Lightweight Causal Cluster Consistency
Dynamic and fault-tolerant cluster management
Reactive Spin-locks: A Self-tuning Approach
Dynamic and fault-tolerant cluster management
Allocating memory in a lock-free manner
One-Way Trading with Time-Varying Exchange Rate Bounds
Reducing Occlusion in 3D Environments Through Smooth Camera Projection Animation
Simple Wait-Free Snapshots for Real-Time Systems with Sporadic Tasks
Multi-word Atomic Read/Write Registers on Multiprocessor Systems
Allocating memory in a lock-free manner
Self-tuning Reactive Distributed Trees for Counting and Balancing
Lightweight Causal Cluster Consistency
Multi-word Atomic Read/Write Registers on Multiprocessor Systems
Reactive multi-word synchronization for multiprocessors
Scalable and Lock-Free Concurrent Dictionaries
Lock-Free and Practical Deques using Single-Word Compare-And-Swap
Lock-Free and Practical Doubly Linked List-Based Deques using Single-Word Compare-And-Swap
CiteWiz: A Tool for the Visualization of Scientific Citation Networks
Animated Visualization of Causal Relations Through Growing 2D Geometry
3Dwm: A Platform for Research and Development of Three-Dimensional User Interfaces
Fast and Lock-Free Concurrent Priority Queues for Multi-Thread Systems
Growing Squares: Animated Visualization of Causal Relations
The Non-blocking Programming Paradigm in Large Scale Scientific Computations
Simple Wait-Free Snapshots for Real-Time Systems with Sporadic Tasks
Scalable and Lock-Free Concurrent Dictionaries Extended Version
Causality Visualization Using Animated Growing Polygons
Reactive multi-word synchronization for multiprocessors
Fast, reactive and lock-free multi-word compare-and-swap algorithms
NOBLE : A Non-Blocking Inter-Process Communication Library
Distributed Long-Lived List Coloring: how to dynamically allocate frequencies to cellular networks
Distributed Long-Lived List Colouring: How to Dynamically Allocate Frequencies in Cellular Networks
Self-Stabilization in Wait-Free Shared Memory Objects
Growing Squares: Animated Visualization of Causal Relations
Evaluating The Performance of Non-Blocking Synchronization on Shared Memory Multiprocessors
Distributed Frequency Allocation Algorithms for Cellular Networks: Trade-offs and tuning strategies
Simple and Fast Wait-Free Snapshots for Real-Time Systems
Wait-free handshaking using rainbow colouring
LYDIAN: An Educational Animation Environment for Distributed Algorithms and Protocols
Non-blocking Data Sharing in Multiprocessor Real-Time System
Towards a Library of Distributed Algorithms and Animations
Randomized Naming Using Wait-Free Shared Variables
Wait-free Snapshots in Real-time Systems: Algorithms and their Performance
Download publication list
You can download this list to your computer.
Filter and download publication list
As logged in user (Chalmers employee) you find more export functions in MyResearch.
You may also import these directly to Zotero or Mendeley by using a browser plugin. These are found herer:
Zotero Connector
Mendeley Web Importer
The service SwePub offers export of contents from Research in other formats, such as Harvard and Oxford in .RIS, BibTex and RefWorks format.
Showing 12 research projects
Relaxed Semantics Across the Data Analytics Stack (RELAX-DN)
INDEED: Information and Data-processing in Focus for Energy Efficiency
Scalability and quality control in AM - Big Data and ML in Production
WASP SAS: Structuring data for continuous processing and ML systems
VR Models and Techniques for Energy-Efficient Concurrent Data Access Designs
Big Data Processing in the context of Smart Buildings,
Future factories in the Cloud (FiC)
Execution Models for Energy-Efficient Computing Systems (EXCESS)
Performance Portability and Programmability for Heterogeneous Many-core Architectures (PEPPHER)