Anders Gidenstam

Citado por

	Total	Desde 2019
Citas	431	128
Índice h	12	6
Índice i10	14	5

2004200520062007200820092010201120122013201420152016201720182019202020212022202320243 10 8 7 8 12 15 12 17 21 27 35 22 25 69 23 26 26 15 19 19

Acceso público

Ver todo

6 artículos

0 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Philippas TsigasProfessor of Computer Science, Chalmers University of TechnologyDirección de correo verificada de chalmers.se
Marina PapatriantafilouAssoc. Professor; Computer Science and Engineering, Chalmers UniversityDirección de correo verificada de chalmers.se
Håkan SundellAssociate Professor in Computer Science, University of BoråsDirección de correo verificada de hb.se
Phuong Hoai HaUniversity of Tromso, NorwayDirección de correo verificada de cs.uit.no
Vi Ngoc-Nha TranAssociate Professor at UiT The Arctic University of NorwayDirección de correo verificada de uit.no
Ibrahim UmarUniversity of TromsøDirección de correo verificada de uit.no
Boris KoldehofeProfessor of Computer Science, TU IlmenauDirección de correo verificada de tu-ilmenau.de
Yiannis NikolakopoulosZeroPoint TechnologiesDirección de correo verificada de zptcorp.com
Ulf JohanssonProfessor of Computer Science, Jönköping UniversityDirección de correo verificada de ju.se
Ivan WalulyaDepartment of Computer Science and Engineering, Chalmers University of TechnologyDirección de correo verificada de chalmers.se
Daniel CedermanPostdoc, Chalmers University of TechnologyDirección de correo verificada de chalmers.se
Tuwe LöfströmDepartment of Computing, Jönköping School of Engineering, Jönköping UniversityDirección de correo verificada de ju.se
Henrik LinussonEkkono Solutions ABDirección de correo verificada de ekkono.ai
Henrik BoströmProfessor of computer science - data science systems, KTH Royal Institute of TechnologyDirección de correo verificada de kth.se

Seguir

Anders Gidenstam

University of Borås

Dirección de correo verificada de gidenstam.org - Página principal

Computer science parallell algorithms lock-free data structures lock-free algorithms lock-free memory management


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
Efficient and reliable lock-free memory reclamation based on reference counting A Gidenstam, M Papatriantafilou, H Sundell, P Tsigas IEEE Transactions on Parallel and Distributed Systems 20 (8), 1173-1187, 2008	96	2008
Cache-aware lock-free queues for multiple producers/consumers and weak memory consistency A Gidenstam, H Sundell, P Tsigas Principles of Distributed Systems: 14th International Conference, OPODIS …, 2010	40	2010
Allocating memory in a lock-free manner A Gidenstam, M Papatriantafilou, P Tsigas Algorithms–ESA 2005: 13th Annual European Symposium, Palma de Mallorca …, 2005	33	2005
A lock-free algorithm for concurrent bags H Sundell, A Gidenstam, M Papatriantafilou, P Tsigas Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011	31	2011
Lock‐Free Concurrent Data Structures D Cederman, A Gidenstam, P Ha, H Sundell, M Papatriantafilou, P Tsigas Programming multi‐core and many‐core computing systems, 59-79, 2017	29	2017
NBmalloc: Allocating memory in a lock-free manner A Gidenstam, M Papatriantafilou, P Tsigas Algorithmica 58 (2), 304-338, 2010	26	2010
A consistency framework for iteration operations in concurrent data structures Y Nikolakopoulos, A Gidenstam, M Papatriantafilou, P Tsigas 2015 IEEE International Parallel and Distributed Processing Symposium, 239-248, 2015	19	2015
Multiword atomic read/write registers on multiprocessor systems A Larsson, A Gidenstam, PH Ha, M Papatriantafilou, P Tsigas Journal of Experimental Algorithmics (JEA) 13, 1.7-1.30, 2009	15	2009
Adaptive plausible clocks A Gidenstam, M Papatriantafilou 24th International Conference on Distributed Computing Systems, 2004 …, 2004	15	2004
Venn predictors for well-calibrated probability estimation trees U Johansson, T Löfström, H Sundell, H Linusson, A Gidenstam, ... Conformal and Probabilistic Prediction and Applications, 3-14, 2018	14	2018
LFTHREADS: a lock-free thread library A Gidenstam, M Papatriantafilou ACM SIGARCH Computer Architecture News 36 (5), 88-92, 2009	12	2009
Dynamic and fault-tolerant cluster management A Gidenstam, B Koldehofe, M Papatriantafilou, P Tsigas Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05), 237-244, 2005	12	2005
Multi-word atomic read/write registers on multiprocessor systems A Larsson, A Gidenstam, PH Ha, M Papatriantafilou, P Tsigas European Symposium on Algorithms, 736-748, 2004	11	2004
Practical and efficient lock-free garbage collection based on reference counting A Gidenstam, M Papatriantafilou, H Sundell, P Tsigas Chalmers tekniska högsk., 2005	10	2005
D1. 2 initial specification of energy, platform and component modelling framework C Kessler, L Li, U Dastgeer, A Gidenstam, A Atalar, A Dobre EU FP7 project EXCESS (611183), Tech. Rep, 2014	9	2014
D1. 1 Early validation of system-wide energy compositionality and affecting factors on the EXCESS platforms C Kessler, L Li, U Dastgeer, P Tsigas, A Gidenstam, P Renaud-Goud, ... Project Deliverable, EU FP7 project Execution Models for Energy-Efficient …, 2014	9	2014
LFthreads: A lock-free thread library A Gidenstam, M Papatriantafilou Proceedings of the 11th international conference on Principles of …, 2007	9	2007
“Blocking without Locking” or LFTHREADS: A lock-free thread library A Gidenstam, M Papatriantafilou Technical report MPI–I–2007–1–003, 2007	9*	2007
D2. 3 power models, energy models and libraries for energy-efficient concurrent data structures and algorithms PH Ha, VNN Tran, I Umar, A Atalar, A Gidenstam, P Renaud-Goud, ... arXiv preprint arXiv:1801.10556, 2018	8*	2018
Modeling energy consumption of lock-free queue implementations A Atalar, A Gidenstam, P Renaud-Goud, P Tsigas 2015 IEEE International Parallel and Distributed Processing Symposium, 229-238, 2015	7	2015

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores