 | 2009 |
|---|
| 13 |       | Håkan Sundell:
Wait-Free Multi-Word Compare-And-Swap using Greedy Helping and Grabbing.
PDPTA 2009: 494-500 |
| 12 |  | Anders Gidenstam,
Marina Papatriantafilou,
Håkan Sundell,
Philippas Tsigas:
Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting.
IEEE Trans. Parallel Distrib. Syst. 20(8): 1173-1187 (2009) |
| 2008 |
|---|
| 11 | | Håkan Sundell,
Philippas Tsigas:
Lock-free deques and doubly linked lists.
J. Parallel Distrib. Comput. 68(7): 1008-1020 (2008) |
| 2007 |
|---|
| 10 | | Håkan Sundell,
Philippas Tsigas:
Practical and Lock-Free Doubly Linked Lists.
PDPTA 2007: 264-270 |
| 2005 |
|---|
| 9 | | Håkan Sundell:
Wait-Free Reference Counting and Memory Management.
IPDPS 2005 |
| 8 | | Anders Gidenstam,
Marina Papatriantafilou,
Håkan Sundell,
Philippas Tsigas:
Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting.
ISPAN 2005: 202-207 |
| 7 | | Håkan Sundell,
Philippas Tsigas:
Fast and lock-free concurrent priority queues for multi-thread systems.
J. Parallel Distrib. Comput. 65(5): 609-627 (2005) |
| 2004 |
|---|
| 6 | | Håkan Sundell,
Philippas Tsigas:
Lock-Free and Practical Doubly Linked List-Based Deques Using Single-Word Compare-and-Swap.
OPODIS 2004: 240-255 |
| 5 | | Håkan Sundell,
Philippas Tsigas:
Scalable and lock-free concurrent dictionaries.
SAC 2004: 1438-1445 |
| 4 | | Håkan Sundell,
Philippas Tsigas:
Lock-Free and Practical Deques using Single-Word Compare-And-Swap
CoRR cs.DC/0408016: (2004) |
| 2003 |
|---|
| 3 | | Håkan Sundell,
Philippas Tsigas:
Fast and Lock-Free Concurrent Priority Queues for Multi-Thread Systems.
IPDPS 2003: 84 |
| 2000 |
|---|
| 2 | | Håkan Sundell,
Philippas Tsigas,
Yi Zhang:
A simple and fast Wait-Free Snapshot Algorithm for Real-Time Systems.
OPODIS 2000: 91-106 |
| 1 | | Håkan Sundell,
Philippas Tsigas:
Space efficient wait-free buffer sharing in multiprocessor real-time systems based on timing information.
RTCSA 2000: 433-440 |
