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