Håkan Sundell

Visar 26 publikationer

2017

Lock-Free Concurrent Data Structures

Daniel Cederman, A. Gidenstam, P. Ha et al
Programming multi-core and many-core computing systems, p. 29-58
Kapitel i bok
2014

ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List

Dang Nhan Nguyen, Philippas Tsigas, Håkan Sundell
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8878, p. 372-387
Paper i proceeding
2013

Brief Announcement: ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List

Dang Nhan Nguyen, Philippas Tsigas, Håkan Sundell
Distributed Computing. The 27th International Symposium on Distributed Computing (DISC 2013) (Lecture Notes in Computer Science series). Vol. 8205, p. 557-558
Paper i proceeding
2013

Lock-free Concurrent Data Structures

Daniel Cederman, Anders Gidenstam, Phuong Ha et al
arXiv
Kapitel i bok
2011

A Lock-Free Algorithm for Concurrent Bags

Håkan Sundell, Anders Gidenstam, Marina Papatriantafilou et al
Rapport
2011

A lock-free algorithm for concurrent bags

Håkan Sundell, A. Gidenstam, Marina Papatriantafilou et al
23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'11.San Jose, 4-6 June 2011, p. 335-344
Paper i proceeding
2010

Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency

Anders Gidenstam, Håkan Sundell, Philippas Tsigas
PRINCIPLES OF DISTRIBUTED SYSTEMS, Lecture Notes in Computer Science. Vol. 6490, p. 302-317
Paper i proceeding
2009

Brushing the Locks out of the Fur: A Lock-Free Work Stealing Library

Håkan Sundell, Philippas Tsigas
econd Swedish Workshop on Multi-Core Computing, (MCC '09)
Paper i proceeding
2009

NOBLE: non-blocking programming support via lock-free shared abstract data types

Håkan Sundell, Philippas Tsigas
SIGARCH Computer Architecture News. Vol. 36 (5), p. 80-87
Artikel i vetenskaplig tidskrift
2009

Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting

Anders Gidenstam, Marina Papatriantafilou, Håkan Sundell et al
IEEE Transactions on Parallel and Distributed Systems. Vol. 20 (8), p. 1173-1187
Artikel i vetenskaplig tidskrift
2008

Lock-Free Deques and Doubly Linked Lists

Håkan Sundell, Philippas Tsigas
Journal of Parallel and Distributed Computing. Vol. 68 (7), p. 1008-1020
Artikel i vetenskaplig tidskrift
2005

Practical and Efficient Lock-Free Garbage Collection Based on Reference Counting

Anders Gidenstam, Marina Papatriantafilou, Håkan Sundell et al
Rapport
2005

Fast and Lock-Free Concurrent Priority Queues for Multi-Thread Systems

Håkan Sundell, Philippas Tsigas
Journal of Parallel and Distributed Computing. Vol. 65 (5), p. 609-627
Artikel i vetenskaplig tidskrift
2005

Wait-Free Reference Counting and Memory Management

Håkan Sundell
IEEE/ACM 19th International Parallel & Distributed Processing Symposium (IPDPS 2005)
Paper i proceeding
2005

Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting

Anders Gidenstam, Marina Papatriantafilou, Håkan Sundell et al
Proceedings of the 8th International Symposium on Parallel Architectures, Algorithms & Networks, p. 202 - 207
Paper i proceeding
2004

Efficient and Practical Non-Blocking Data Structures

Håkan Sundell
Doktorsavhandling
2004

Lock-Free and Practical Deques using Single-Word Compare-And-Swap

Håkan Sundell, Philippas Tsigas
Rapport
2004

Scalable and Lock-Free Concurrent Dictionaries

Håkan Sundell, Philippas Tsigas
Proceedings of the 19th ACM Symposium on Applied Computing, p. 1438-1445
Paper i proceeding
2004

Lock-Free and Practical Doubly Linked List-Based Deques using Single-Word Compare-And-Swap

Håkan Sundell, Philippas Tsigas
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3544, p. 240-255
Artikel i vetenskaplig tidskrift
2004

Simple Wait-Free Snapshots for Real-Time Systems with Sporadic Tasks

Håkan Sundell, Philippas Tsigas
10th International Conference on Real-Time and Embedded Computing Systems and Applications, p. 325-340
Paper i proceeding
2003

Fast and Lock-Free Concurrent Priority Queues for Multi-Thread Systems

Håkan Sundell, Philippas Tsigas
Proceedings of the 17th IEEE/ACM International Parallel and Distributed Processing Symposium
Paper i proceeding
2002

NOBLE : A Non-Blocking Inter-Process Communication Library

Håkan Sundell, Philippas Tsigas
Proceedings of the 6th Workshop on Languages Compilers and Run-time Systems for Scalable Computers
Paper i proceeding
2000

Space Efficient Wait-Free Buffer Sharing in Multiprocessor Real-Time Systems Based on Timing Information

Håkan Sundell, Philippas Tsigas
Proceedings of the 7th IEEE International Conference on Real-Time Computing Systems and Applicatons (RTCSA 2000), p. 433-440
Paper i proceeding
2000

Simple and Fast Wait-Free Snapshots for Real-Time Systems

Håkan Sundell, Philippas Tsigas, Yi Zhang
Proceedings of the 4th International Conference On Principles Of Distributed Systems (OPODIS 2000), p. 91-106
Paper i proceeding

Spara referenser

Om du har installerat Zotero eller Mendeley på din dator kan du direkt ta ut referenser från de publikationer du ser i listan.

Du laddar ner dessa pluginer här:
Zotero
Mendeley

Det finns inga projekt att visa.
Det kan finnas fler projekt där Håkan Sundell medverkar, men du måste vara inloggad som anställd på Chalmers för att kunna se dem.