var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=http://www.cslab.ece.ntua.gr/~knikas/files/knikas.bib&jsonp=1&theme=simple&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=http://www.cslab.ece.ntua.gr/~knikas/files/knikas.bib&jsonp=1&theme=simple\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=http://www.cslab.ece.ntua.gr/~knikas/files/knikas.bib&jsonp=1&theme=simple\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2023\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n FaaSCell: A Case for Intra-node Resource Management: Work-In-Progress.\n \n \n \n \n\n\n \n Katsakioris, C.; Alverti, C.; Nikas, K.; Psomadakis, S.; Karakostas, V.; and Koziris, N.\n\n\n \n\n\n\n In Proceedings of the 1st Workshop on SErverless Systems, Applications and MEthodologies, of SESAME'23, pages 57-60, 2023. Association for Computing Machinery\n \n\n\n\n
\n\n\n\n \n \n \"FaaSCell:Paper\n  \n \n \n \"FaaSCell: paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{sesame22ckatsak,\n\tauthor   = {Katsakioris, Christos and Alverti, Chloe and Nikas, Konstantinos and Psomadakis, Stratos and Karakostas, Vasileios and Koziris, Nectarios},\n\ttitle \t = {FaaSCell: {A} Case for Intra-node Resource Management: Work-In-Progress},\n\tyear \t = {2023},\n\tpublisher = {Association for Computing Machinery},\n\turl \t = {https://doi.org/10.1145/3592533.3592812},\n\tdoi \t = {10.1145/3592533.3592812},\n\tbooktitle = {Proceedings of the 1st Workshop on SErverless Systems, Applications and MEthodologies},\n\tpages \t = {57-60},\n\tlocation = {Rome, Italy},\n\tseries \t = {SESAME'23}, \n\turl_Paper = {papers/2023-sesame-faascell.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Vitamin-V: Virtual Environment and Tool-boxing for Trustworthy Development of RISC-V based Cloud Services.\n \n \n \n \n\n\n \n Arelakis, A.; Arnau, J. M.; Berral, J. L.; Call, A.; Canal, R.; Carlo, S. D.; Costa, J.; Gizopoulos, D.; Karakostas, V.; Lubrano, F.; Nikas, K.; Nikolakopoulos, Y.; Otero, B.; Papadimitriou, G.; Papaefstathiou, I.; Pnevmatikatos, D. N.; Raho, D.; Rigo, A.; Rodríguez, E.; Savino, A.; Scionti, A.; Tampouratzis, N.; and Torregrosa, A. J.\n\n\n \n\n\n\n CoRR, abd/2305.10982. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"Vitamin-V:Paper\n  \n \n \n \"Vitamin-V: paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{vitaminv23,\n\tauthor    = {Aggelos Arelakis and J. M. Arnau and Josep Lluis Berral and Aaron Call and Ramon Canal and\n\t\t\t\t\tStefano Di Carlo and J. Costa and Dimitris Gizopoulos and Vasileios Karakostas and Francesco Lubrano and\n\t\t\t\t\t\tKonstantinos Nikas and Y. Nikolakopoulos and Beatriz Otero and George Papadimitriou and Ioannis Papaefstathiou and\n\t\t\t\t\t\tDionisios N. Pnevmatikatos and Daniel Raho and Alvise Rigo and E. Rodr{\\'{\\i}}guez and Alessandro Savino and Alberto Scionti and\n\t\t\t\t\t\tNikolaos Tampouratzis and Antonio J. Torregrosa},\n\ttitle     = {Vitamin-V: Virtual Environment and Tool-boxing for Trustworthy Development of {RISC-V} based Cloud Services},\n\tjournal   = {CoRR},\n\tvolume    = {abd/2305.10982},\n\t_number   = {n/a},\n\t_pages    = {e6174},\n\tyear      = {2023},\n\tdoi       = {10.48550/ARXIV.2305.10982},\n\turl       = {https://doi.org/10.48550/arXiv.2305.10982},\n\turl_Paper = {papers/2023-vitaminv.pdf}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n FaaS in the Age of (Sub-)μs I/O: A Performance Analysis of Snapshotting.\n \n \n \n \n\n\n \n Katsakioris, C.; Alverti, C.; Karakostas, V.; Nikas, K.; Goumas, G.; and Koziris, N.\n\n\n \n\n\n\n In Proceedings of the 15th ACM International Conference on Systems and Storage, of SYSTOR '22, pages 13–25, New York, NY, USA, 2022. Association for Computing Machinery\n \n\n\n\n
\n\n\n\n \n \n \"FaaSPaper\n  \n \n \n \"FaaS paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{systor22ckatsak,\n\tauthor   = {Katsakioris, Christos and Alverti, Chloe and Karakostas, Vasileios and Nikas, Konstantinos and Goumas, Georgios and Koziris, Nectarios},\n\ttitle \t = {FaaS in the Age of (Sub-)<i>μs</i> I/O: A Performance Analysis of Snapshotting},\n\tyear \t = {2022},\n\tisbn \t = {9781450393805},\n\tpublisher = {Association for Computing Machinery},\n\taddress  = {New York, NY, USA},\n\turl \t = {https://doi.org/10.1145/3534056.3534938},\n\tdoi \t = {10.1145/3534056.3534938},\n\tbooktitle = {Proceedings of the 15th ACM International Conference on Systems and Storage},\n\tpages \t = {13–25},\n\tnumpages = {13},\n\tkeywords = {FaaS, virtualization, snapshots, storage, persistent memory, serverless},\n\tlocation = {Haifa, Israel},\n\tseries \t = {SYSTOR '22}, \n\turl_Paper = {papers/2022-systor-faas.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A flexible multi-temporal and multi-modal framework for Sentinel-1 and Sentinel-2 analysis ready data.\n \n \n \n \n\n\n \n Upadhyay, P.; Czerkawski, M.; Davison, C.; Cardona, J.; Macdonald, M.; Andonovic, I.; Michie, C.; Atkinson, R.; Papadopoulou, N.; Nikas, K.; and Tachtatzis, C.\n\n\n \n\n\n\n In volume 14, 2022. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n \n \"A paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{mdpi22Tactatis,\n\tauthor    = {Priti Upadhyay and Mikolaj Czerkawski and\n\t\t\t\t Christopher Davison and Javier Cardona and\n\t\t\t\t Malcolm Macdonald and Ivan Andonovic and\n\t\t\t\t Craig Michie and Robert Atkinson and\n\t\t\t\t Nikela Papadopoulou and\n\t\t\t\t Konstantinos Nikas and Christos Tachtatzis},\n\ttitle     = {A flexible multi-temporal and multi-modal framework for Sentinel-1 and Sentinel-2 analysis ready data},\n\tjournal\t  = {Remote Sensing},\n\tvolume    = {14},\n\tyear      = {2022},\n\tnumber    = {5},\n\tarticle-number = {1120},\n\turl       = {https://www.mdpi.com/2072-4292/14/5/1120},\n\tdoi       = {10.3390/rs14051120},\n\tissn      = {2072-4292},\n\turl_Paper = {papers/2022-remote_sensing.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Exploiting Page Table Locality for Agile TLB Prefetching.\n \n \n \n \n\n\n \n Vavouliotis, G.; Alvarez, L.; Karakostas, V.; Nikas, K.; Koziris, N.; Jiménez, D. A.; and Casas, M.\n\n\n \n\n\n\n In 48th ACM/IEEE Annual International Symposium on Computer Architecture, ISCA 2021, Valencia, Spain, June 14-18, 2021, pages 85–98, 2021. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"ExploitingPaper\n  \n \n \n \"Exploiting paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{isca21Vavouliotis,\n\tauthor    = {Georgios Vavouliotis and\n\t\t         Lluc Alvarez and\n\t\t\t\t Vasileios Karakostas and\n\t\t\t\t Konstantinos Nikas and\n\t\t\t\t Nectarios Koziris and\n\t\t\t\t Daniel A. Jim{\\'{e}}nez and\n\t\t\t\t Marc Casas},\n\ttitle     = {Exploiting Page Table Locality for Agile {TLB} Prefetching},\n\tbooktitle = {48th {ACM/IEEE} Annual International Symposium on Computer Architecture,\n\t\t\t     {ISCA} 2021, Valencia, Spain, June 14-18, 2021},\n\tpages     = {85--98},\n\tpublisher = {{IEEE}},\n\tyear      = {2021},\n\turl       = {https://doi.org/10.1109/ISCA52012.2021.00016},\n\tdoi       = {10.1109/ISCA52012.2021.00016},\n\turl_Paper = {papers/2021-isca-tlb_prefetching.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n RCU-HTM: A generic synchronization technique for highly efficient concurrent search trees.\n \n \n \n \n\n\n \n Siakavaras, D.; Nikas, K.; Goumas, G.; and Koziris, N.\n\n\n \n\n\n\n Concurrency and Computation: Practice and Experience. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"RCU-HTM:Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{ccpe21rcu,\n\tauthor    = {Dimitrios Siakavaras and\n\t\t         Konstantinos Nikas and \n\t\t\t     Georgios Goumas and \n\t\t\t     Nectarios Koziris},\n\ttitle     = {RCU-HTM: A generic synchronization technique for highly efficient concurrent search trees},\n\tjournal   = {Concurrency and Computation: Practice and Experience},\n\t_volume   = {n/a},\n\t_number   = {n/a},\n\t_pages    = {e6174},\n\tyear      = {2021},\n\tdoi       = {https://doi.org/10.1002/cpe.6174},\n\turl       = {https://onlinelibrary.wiley.com/doi/abs/10.1002/cpe.6174},\n\t__url_Paper = {https://onlinelibrary.wiley.com/doi/pdf/10.1002/cpe.6174}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A Configurable TLB Hierarchy for the RISC-V Architecture.\n \n \n \n \n\n\n \n Papadopoulos, N. C.; Karakostas, V.; Nikas, K.; Koziris, N.; and Pnevmatikatos, D. N.\n\n\n \n\n\n\n In 30th International Conference on Field-Programmable Logic and Applications, FPL 2020, Gothenburg, Sweden, August 31 - September 4, 2020, pages 85–90, 2020. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n \n \"A paper\n  \n \n \n \"A slides\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{fpl20TLBRiscV,\n  \tauthor    = {Nikolaos Charalampos Papadopoulos and\n                 Vasileios Karakostas and\n                 Konstantinos Nikas and\n                 Nectarios Koziris and\n                 Dionisios N. Pnevmatikatos},\n\ttitle     = {A Configurable {TLB} Hierarchy for the {RISC-V} Architecture},\n\tbooktitle = {30th International Conference on Field-Programmable Logic and Applications,\n\t\t               {FPL} 2020, Gothenburg, Sweden, August 31 - September 4, 2020},\n\tpages     = {85--90},\n\tyear      = {2020},\n\turl       = {https://doi.org/10.1109/FPL50879.2020.00024},\n\tdoi       = {10.1109/FPL50879.2020.00024},\n\turl_Paper = {papers/2020-fpl-tlb_riscv.pdf},\n    url_Slides= {slides/2020-fpl-tlb_riscv.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Enabling Virtual Memory Research on RISC-V with a Configurable TLB Hierarchy for the Rocket Chip Generator.\n \n \n \n \n\n\n \n Papadopoulos, N. C.; Karakostas, V.; Nikas, K.; Koziris, N.; and Pnevmatikatos, D. N.\n\n\n \n\n\n\n CoRR, abs/2009.07723. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"EnablingPaper\n  \n \n \n \"Enabling paper\n  \n \n \n \"Enabling slides\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{carrv20TLBRiscV,\n  \tauthor    = {Nikolaos Charalampos Papadopoulos and\n                 Vasileios Karakostas and\n                 Konstantinos Nikas and\n                 Nectarios Koziris and\n                 Dionisios N. Pnevmatikatos},\n\ttitle     = {Enabling Virtual Memory Research on {RISC-V} with a Configurable {TLB}\n\t\t               Hierarchy for the Rocket Chip Generator},\n\tjournal   = {CoRR},\n\tvolume    = {abs/2009.07723},\n    year      = {2020},\n    url       = {https://arxiv.org/abs/2009.07723},\n\turl_Paper = {papers/2020-carrv-tlb_riscv.pdf},\n    url_Slides= {slides/2020-carrv-tlb_riscv.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Efficient Concurrent Range Queries in B+-trees using RCU-HTM.\n \n \n \n \n\n\n \n Siakavaras, D.; Billis, P.; Nikas, K.; Goumas, G. I.; and Koziris, N.\n\n\n \n\n\n\n In SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020, pages 571–573, 2020. \n \n\n\n\n
\n\n\n\n \n \n \"EfficientPaper\n  \n \n \n \"Efficient paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{spaa20RangeQueries,\n  \tauthor    = {Dimitrios Siakavaras and\n\t\t       Panagiotis Billis and\n\t\t\t   Konstantinos Nikas and\n\t\t\t   Georgios I. Goumas and\n\t\t\t   Nectarios Koziris},\n\ttitle     = {Efficient Concurrent Range Queries in B+-trees using {RCU-HTM}},\n\tbooktitle = {{SPAA} '20: 32nd {ACM} Symposium on Parallelism in Algorithms and\n\t              Architectures, Virtual Event, USA, July 15-17, 2020},\n\tpages     = {571--573},\n\tyear      = {2020},\n\turl       = {https://doi.org/10.1145/3350755.3400237},\n\tdoi       = {10.1145/3350755.3400237},\n\turl_Paper = {papers/2020-spaa-RangeQueries.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Enhancing and Exploiting Contiguity for Fast Memory Virtualization.\n \n \n \n \n\n\n \n Alverti, C.; Psomadakis, S.; Karakostas, V.; Gandhi, J.; Nikas, K.; Goumas, G. I.; and Koziris, N.\n\n\n \n\n\n\n In 47th ACM/IEEE Annual International Symposium on Computer Architecture, ISCA 2020, Valencia, Spain, May 30 - June 3, 2020, pages 515–528, 2020. \n \n\n\n\n
\n\n\n\n \n \n \"EnhancingPaper\n  \n \n \n \"Enhancing paper\n  \n \n \n \"Enhancing slides\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{isca20CA,\n  author\t= {Chloe Alverti and\n\t           Stratos Psomadakis and\n\t\t\t   Vasileios Karakostas and \n\t\t\t   Jayneel Gandhi and \n\t\t\t   Konstantinos Nikas and\n\t\t\t   Georgios I. Goumas and\n\t\t\t   Nectarios Koziris},\n  title  \t= {Enhancing and Exploiting Contiguity for Fast Memory Virtualization},\n  booktitle = {47th {ACM/IEEE} Annual International Symposium on Computer Architecture,\n                 {ISCA} 2020, Valencia, Spain, May 30 - June 3, 2020},\n  pages     = {515--528},\n  year      = {2020},\n  url       = {https://doi.org/10.1109/ISCA45697.2020.00050},\n  doi       = {10.1109/ISCA45697.2020.00050},\n  url_Paper = {papers/2020-isca-CA.pdf},\n  url_Slides= {slides/2020-isca-CA.pptx}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n CYBELE - Fostering precision agriculture & livestock farming through secure access to large-scale HPC enabled virtual industrial experimentation environments fostering scalable big data analytics.\n \n \n \n \n\n\n \n Perakis, K.; Lampathaki, F.; Nikas, K.; Georgiou, Y.; Marko, O.; and Maselyne, J.\n\n\n \n\n\n\n Comput. Networks, 168. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"CYBELEPaper\n  \n \n \n \"CYBELE paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{compnet20CYBELE,\n  author    = {Konstantinos Perakis and\n               Fenareti Lampathaki and\n               Konstantinos Nikas and\n               Yiannis Georgiou and\n               Oskar Marko and\n               Jarissa Maselyne},\n  title     = {{CYBELE} - Fostering precision agriculture {\\&} livestock farming\n               through secure access to large-scale {HPC} enabled virtual industrial\n               experimentation environments fostering scalable big data analytics},\n  journal   = {Comput. Networks},\n  volume    = {168},\n  year      = {2020},\n  url       = {https://doi.org/10.1016/j.comnet.2019.107035},\n  doi       = {10.1016/j.comnet.2019.107035},\n  url_Paper\t= {papers/2020-compnet-CYBELE.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n ACTiManager: An end-to-end interference-aware cloud resource manager.\n \n \n \n \n\n\n \n Psomadakis, S.; Gerangelos, S.; Siakavaras, D.; Papadakis, I. A.; Vemmou, M.; Skalidi, A.; Karakostas, V.; Nikas, K.; Koziris, N.; and Goumas, G. I.\n\n\n \n\n\n\n In Proceedings of the 20th International Middleware Conference Demos and Posters, Middleware 2019, Davis, CA, USA, December 9-13, 2019, pages 27–28, 2019. ACM\n \n\n\n\n
\n\n\n\n \n \n \"ACTiManager:Paper\n  \n \n \n \"ACTiManager: paper\n  \n \n \n \"ACTiManager: slides\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{middleware19ACTiMANAGER,\n  author    = {Stratos Psomadakis and\n               Stefanos Gerangelos and\n               Dimitrios Siakavaras and\n               Ioannis A. Papadakis and\n               Marina Vemmou and\n               Aspa Skalidi and\n               Vasileios Karakostas and\n               Konstantinos Nikas and\n               Nectarios Koziris and\n               Georgios I. Goumas},\n  title     = {ACTiManager: An end-to-end interference-aware cloud resource manager},\n  booktitle = {Proceedings of the 20th International Middleware Conference Demos\n               and Posters, Middleware 2019, Davis, CA, USA, December 9-13, 2019},\n  pages     = {27--28},\n  publisher = {{ACM}},\n  year      = {2019},\n  url       = {https://doi.org/10.1145/3366627.3368114},\n  doi       = {10.1145/3366627.3368114},\n  url_Paper = {papers/2019-middleware_actimanager.pdf},\n  url_Slides= {slides/2019-middleware-actimanager_poster.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n DICER: Diligent Cache Partitioning for Efficient Workload Consolidation.\n \n \n \n \n\n\n \n Nikas, K.; Papadopoulou, N.; Giantsidis, D.; Karakostas, V.; Goumas, G. I.; and Koziris, N.\n\n\n \n\n\n\n In Proceedings of the 48th International Conference on Parallel Processing, ICPP 2019, Kyoto, Japan, August 05-08, 2019, pages 15:1-15:10, 2019. ACM\n \n\n\n\n
\n\n\n\n \n \n \"DICER:Paper\n  \n \n \n \"DICER: paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 13 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{icpp19dicer,\n  author\t= {Konstantinos Nikas and\n\t\t\t      Nikela Papadopoulou and\n\t\t\t      Dimitra Giantsidis and\n\t\t          Vasileios Karakostas and\n\t\t\t      Georgios I. Goumas and\n\t\t\t      Nectarios Koziris},\n  title  \t= {{DICER}: Diligent Cache Partitioning for Efficient Workload Consolidation},\n  booktitle = {Proceedings of the 48th International Conference on Parallel Processing,\n\t\t            {ICPP} 2019, Kyoto, Japan, August 05-08, 2019},\n  pages = {15:1-15:10},\n  publisher = {{ACM}},\n  year  = {2019},\n  url       = {https://doi.org/10.1145/3337821.3337891},\n  doi       = {10.1145/3337821.3337891},\n  url_Paper = {papers/2019-icpp-DICER.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Performance Prediction of NUMA Placement: A Machine-Learning Approach.\n \n \n \n \n\n\n \n Arapidis, F.; Karakostas, V.; Papadopoulou, N.; Nikas, K.; Goumas, G. I.; and Koziris, N.\n\n\n \n\n\n\n In 2018 IEEE International Conference on Cloud Computing Technology and Science, CloudCom 2018, Nicosia, Cyprus, December 10-13, 2018, pages 296–301, 2018. \n \n\n\n\n
\n\n\n\n \n \n \"PerformancePaper\n  \n \n \n \"Performance paper\n  \n \n \n \"Performance slides\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{cloudcom18numa,\n\t  author  = {Fanourios Arapidis and\n\t\t          Vasileios Karakostas and\n\t\t\t      Nikela Papadopoulou and\n\t\t\t      Konstantinos Nikas and\n\t\t\t      Georgios I. Goumas and\n\t\t\t      Nectarios Koziris},\n\t   title  = {Performance Prediction of {NUMA} Placement: {A} Machine-Learning Approach},\n\t   booktitle = {2018 {IEEE} International Conference on Cloud Computing Technology\n\t\t\t        and Science, CloudCom 2018, Nicosia, Cyprus, December 10-13, 2018},\n\t    pages = {296--301},\n\t    year  = {2018},\n\t    crossref  = {DBLP:conf/cloudcom/2018},\n\t    url       = {https://doi.org/10.1109/CloudCom2018.2018.00064},\n\t    doi       = {10.1109/CloudCom2018.2018.00064},\n  \t\turl_Paper = {papers/2018-xtremecloud_numa_placement.pdf},\n\t\turl_Slides= {slides/2018-xtremecloud_numa_placement.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Efficient resource management for data centers: the ACTiCLOUD approach.\n \n \n \n \n\n\n \n Karakostas, V.; Goumas, G. I.; Lakew, E. B.; Elmroth, E.; Gerangelos, S.; Kolberg, S.; Nikas, K.; Psomadakis, S.; Siakavaras, D.; Svärd, P.; and Koziris, N.\n\n\n \n\n\n\n In Proceedings of the 18th International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation, Pythagorion, Greece, July 15-19, 2018., pages 244–246, 2018. \n \n\n\n\n
\n\n\n\n \n \n \"EfficientPaper\n  \n \n \n \"Efficient paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{samos18acticloud,\n\t  author    = {Vasileios Karakostas and\n\t\t           Georgios I. Goumas and\n\t\t\t\t   Ewnetu Bayuh Lakew and\n\t\t\t\t   Erik Elmroth and\n\t\t\t\t   Stefanos Gerangelos and\n\t\t\t\t   Simon Kolberg and\n\t\t\t\t   Konstantinos Nikas and\n\t\t\t\t   Stratos Psomadakis and\n\t\t\t\t   Dimitrios Siakavaras and\n\t\t\t\t   Petter Sv{\\"{a}}rd and\n\t\t\t\t   Nectarios Koziris},\n\t    title   = {Efficient resource management for data centers: the ACTiCLOUD approach},\n\t    booktitle = {Proceedings of the 18th International Conference on Embedded Computer\n\t\t\t         Systems: Architectures, Modeling, and Simulation, Pythagorion, Greece,\n\t\t\t\t\tJuly 15-19, 2018.},\n\t\tpages   = {244--246},\n\t    year    = {2018},\n\t    crossref = {DBLP:conf/samos/2018},\n\t\turl       = {https://doi.org/10.1145/3229631.3236095},\n\t\tdoi       = {10.1145/3229631.3236095},\n  \t\turl_Paper = {papers/2018-samos_acticloud.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Fast Concurrent Skip Lists with HTM.\n \n \n \n \n\n\n \n Kardaras, M.; Siakavaras, D.; Nikas, K.; Goumas, G.; and Koziris, N.\n\n\n \n\n\n\n In 11th International Symposium on High-Level Parallel Programming and Applications, HLPP 2018, Orléans, France, July 12-13, 2018, 2018. \n \n\n\n\n
\n\n\n\n \n \n \"Fast paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{hlpp18skiplists,\n  author    = {Marios Kardaras and\n               Dimitrios Siakavaras and\n               Konstantinos Nikas and\n               Georgios Goumas and\n               Nectarios Koziris},\n  title     = {Fast Concurrent Skip Lists with HTM},\n  booktitle = {11th International Symposium on High-Level Parallel Programming\n\t           and Applications, {HLPP} 2018, Orl\\'eans, France, July 12-13, 2018},\n  _pages     = {1--13},\n  year      = {2018},\n  _crossref  = {DBLP:conf/IEEEpact/2017},\n  _url       = {https://doi.org/10.1109/PACT.2017.17},\n   url_Paper = {papers/2018-hlpp-skiplistsHTM.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n PPTA: Prefetch-Process-Thread-Alternation to Speed Up Dijkstra's Algorithm.\n \n \n \n \n\n\n \n Kanellopoulos, K.; Nikas, K.; Siakavaras, D.; Karakostas, V.; Goumas, G.; and Koziris, N.\n\n\n \n\n\n\n In 11th Workshop on Programmability and Architectures for Heterogeneous Multicores (MULTIPROG2018), 2018, 2018. \n \n\n\n\n
\n\n\n\n \n \n \"PPTA: paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{multiprog18ppta,\n  author    = {Konstantinos Kanellopoulos and\n               Konstantinos Nikas and\n               Dimitrios Siakavaras and\n\t\t\t   Vasileios Karakostas and\n               Georgios Goumas and\n               Nectarios Koziris},\n  title     = {{PPTA}: {Prefetch-Process-Thread-Alternation} to Speed Up Dijkstra's Algorithm},\n  booktitle = {11th Workshop on Programmability and Architectures for Heterogeneous Multicores\n\t           (MULTIPROG2018), 2018},\n  year      = {2018},\n  url_Paper = {papers/2018-multiprog-ppta.pdf}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n RCU-HTM: Combining RCU with HTM to Implement Highly Efficient Concurrent Binary Search Trees.\n \n \n \n \n\n\n \n Siakavaras, D.; Nikas, K.; Goumas, G. I.; and Koziris, N.\n\n\n \n\n\n\n In 26th International Conference on Parallel Architectures and Compilation Techniques, PACT 2017, Portland, OR, USA, September 9-13, 2017, pages 1–13, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"RCU-HTM:Paper\n  \n \n \n \"RCU-HTM: paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{pact17RCU,\n  author    = {Dimitrios Siakavaras and\n               Konstantinos Nikas and\n               Georgios I. Goumas and\n               Nectarios Koziris},\n  title     = {RCU-HTM: Combining RCU with HTM to Implement Highly Efficient Concurrent Binary Search Trees},\n  booktitle = {26th International Conference on Parallel Architectures and Compilation\n\t                 Techniques, {PACT} 2017, Portland, OR, USA, September 9-13, 2017},\n  pages     = {1--13},\n  year      = {2017},\n  crossref  = {DBLP:conf/IEEEpact/2017},\n  url       = {https://doi.org/10.1109/PACT.2017.17},\n  url_Paper = {papers/2017-pact-RCU.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n ACTiCLOUD:Enabling the Next Generation of Cloud Applications.\n \n \n \n \n\n\n \n Goumas, G.; Nikas, K.; Lakew, E. B.; Kotselidis, C.; Attwood, A.; Elmroth, E.; Flouris, M.; Foutris, N.; Goodacre, J.; Grohmann, D.; Karakostas, V.; Koutsourakis, P.; Kersten, M.; Lujàn, M.; Rustad, E.; Thomson, J.; Tomás, L.; Vesterkjaer, A.; Webber, J.; Zhang, Y.; and Koziris, N.\n\n\n \n\n\n\n In 37th IEEE International Conference on Distributed Computing Systems, ICDCS 2017, Atlanta, GA, USA, June 5-8, 2017, pages 1836–1845, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"ACTiCLOUD:EnablingPaper\n  \n \n \n \"ACTiCLOUD:Enabling paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{icdcs17acticloud,\n  author    = {Georgios Goumas and \n               Konstantinos Nikas and \n               Ewnetu Bayuh Lakew and  \n               Christos Kotselidis and \n               Andrew Attwood and \n               Erik Elmroth and \n               Michail Flouris and \n               Nikos Foutris and \n               John Goodacre and \n               Davide Grohmann and \n               Vasileios Karakostas and \n               Panagiotis Koutsourakis and \n               Martin Kersten and \n               Mikel Lujàn and \n               Einar Rustad and \n               John Thomson and \n               Luis Tomás and \n               Atle Vesterkjaer and \n               Jim Webber and \n               Ying Zhang and \n               Nectarios Koziris},\n  title     = {ACTiCLOUD:Enabling the Next Generation of Cloud Applications},\n  booktitle = {37th {IEEE} International Conference on Distributed Computing Systems,\n\t                 {ICDCS} 2017, Atlanta, GA, USA, June 5-8, 2017},\n  pages     = {1836--1845},\n  year      = {2017},\n  url       = {https://doi.org/10.1109/ICDCS.2017.252},\n  url_Paper = {papers/2017-icdcs-acticloud.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An efficient and fair scheduling policy for multiprocessor platforms.\n \n \n \n \n\n\n \n Marinakis, T.; Haritatos, A.; Nikas, K.; Goumas, G. I.; and Anagnostopoulos, I.\n\n\n \n\n\n\n In IEEE International Symposium on Circuits and Systems, ISCAS 2017, Baltimore, MD, USA, May 28-31, 2017, pages 1–4, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n \n \"An paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{iscas17scheduling,\n\t  author    = {Theodoros Marinakis and\n\t\t           Alexandros{-}Herodotos Haritatos and\n\t\t\t\t   Konstantinos Nikas and\n\t\t\t\t   Georgios I. Goumas and\n\t\t\t\t   Iraklis Anagnostopoulos},\n  \t  title     = {An efficient and fair scheduling policy for multiprocessor platforms},\n\t  booktitle = {{IEEE} International Symposium on Circuits and Systems, {ISCAS} 2017,\n\t\t                 Baltimore, MD, USA, May 28-31, 2017},\n\t  pages     = {1--4},\n\t  year      = {2017},\n\t  crossref  = {DBLP:conf/iscas/2017},\n\t  doi       = {10.1109/ISCAS.2017.8050758},\n\t  url       = {https://doi.org/10.1109/ISCAS.2017.8050758},\n\t  url_Paper = {papers/2017-iscas-scheduling.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Combining HTM and RCU to Implement Highly Efficient Balanced Binary Search Trees.\n \n \n \n \n\n\n \n Siakavaras, D.; Nikas, K.; Goumas, G. I.; and Koziris, N.\n\n\n \n\n\n\n In 12th ACM SIGPLAN Workshop on Transactional Computing (TRANSACT 2017), 2017. \n \n\n\n\n
\n\n\n\n \n \n \"Combining paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{transact17RCU,\n  author    = {Dimitrios Siakavaras and\n               Konstantinos Nikas and\n               Georgios I. Goumas and\n               Nectarios Koziris},\n  title     = {Combining HTM and RCU to Implement Highly Efficient Balanced Binary Search Trees},\n  booktitle = {12th ACM SIGPLAN Workshop on Transactional Computing ({TRANSACT} 2017)},\n  year      = {2017},\n  url_Paper = {papers/2017-transact-RCU.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Improving QoS and Utilisation in modern multi-core servers with Dynamic Cache Partitioning.\n \n \n \n \n\n\n \n Papadakis, I.; Nikas, K.; Karakostas, V.; Goumas, G. I.; and Koziris, N.\n\n\n \n\n\n\n In Proceedings of the Joined Workshops COSH 2017 and VisorHPC 2017, COSH/VisorHPC@HiPEAC 2017, Stockholm, Sweden, January 24, 2017., pages 21–26, 2017. TUM Library\n \n\n\n\n
\n\n\n\n \n \n \"ImprovingPaper\n  \n \n \n \"Improving paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{cosh17QoS,\n  author    = {Ioannis Papadakis and\n               Konstantinos Nikas and\n               Vasileios Karakostas and\n               Georgios I. Goumas and\n               Nectarios Koziris},\n  title     = {Improving QoS and Utilisation in modern multi-core servers with Dynamic\n               Cache Partitioning},\n  booktitle = {Proceedings of the Joined Workshops {COSH} 2017 and VisorHPC 2017,\n               COSH/VisorHPC@HiPEAC 2017, Stockholm, Sweden, January 24, 2017.},\n  pages     = {21--26},\n  publisher = {{TUM} Library},\n  year      = {2017},\n  url       = {https://doi.org/10.14459/2017md1344298},\n  url_Paper = {papers/2017-cosh-QoS.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A resource-centric Application Classification Approach.\n \n \n \n \n\n\n \n Haritatos, A.; Nikas, K.; Goumas, G. I.; and Koziris, N.\n\n\n \n\n\n\n In Proceedings of the 1st COSH Workshop on Co-Scheduling of HPC Applications, COSH@HiPEAC 2016, Prague, Czech Republic, January 19, 2016., pages 7–12, 2016. TUM Library\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n \n \"A paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{cosh16coscheduling,\n  author    = {Alexandros{-}Herodotos Haritatos and\n               Konstantinos Nikas and\n               Georgios I. Goumas and\n               Nectarios Koziris},\n  title     = {A resource-centric Application Classification Approach},\n  booktitle = {Proceedings of the 1st {COSH} Workshop on Co-Scheduling of {HPC} Applications,\n               COSH@HiPEAC 2016, Prague, Czech Republic, January 19, 2016.},\n  pages     = {7--12},\n  publisher = {{TUM} Library},\n  year      = {2016},\n  url       = {https://doi.org/10.14459/2016md1286948},\n  url_Paper = {papers/2016-cosh-Classification.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Contention-Aware Scheduling Policies for Fairness and Throughput.\n \n \n \n \n\n\n \n Haritatos, A.; Papadopoulou, N.; Nikas, K.; Goumas, G. I.; and Koziris, N.\n\n\n \n\n\n\n In Co-Scheduling of HPC Applications [extended versions of all papers from COSH@HiPEAC 2016, Prague, Czech Republic, January 19, 2016], volume 28, of Advances in Parallel Computing, pages 22–45, 2016. IOS Press\n \n\n\n\n
\n\n\n\n \n \n \"Contention-AwarePaper\n  \n \n \n \"Contention-Aware paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{cosh16ContentionAware,\n  author    = {Alexandros{-}Herodotos Haritatos and\n               Nikela Papadopoulou and\n               Konstantinos Nikas and\n               Georgios I. Goumas and\n               Nectarios Koziris},\n  title     = {Contention-Aware Scheduling Policies for Fairness and Throughput},\n  booktitle = {Co-Scheduling of {HPC} Applications [extended versions of all papers\n               from COSH@HiPEAC 2016, Prague, Czech Republic, January 19, 2016]},\n  series    = {Advances in Parallel Computing},\n  volume    = {28},\n  pages     = {22--45},\n  publisher = {{IOS} Press},\n  year      = {2016},\n  url       = {https://doi.org/10.3233/978-1-61499-730-6-22},\n  url_Paper = {papers/2016-cosh-ContentionAwareScheduling.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Massively Concurrent Red-Black Trees with Hardware Transactional Memory.\n \n \n \n \n\n\n \n Siakavaras, D.; Nikas, K.; Goumas, G. I.; and Koziris, N.\n\n\n \n\n\n\n In 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2016, Heraklion, Crete, Greece, February 17-19, 2016, pages 127–134, 2016. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"MassivelyPaper\n  \n \n \n \"Massively paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{pdp16RBT,\n  author    = {Dimitris Siakavaras and\n               Konstantinos Nikas and\n               Georgios I. Goumas and\n               Nectarios Koziris},\n  title     = {Massively Concurrent Red-Black Trees with Hardware Transactional Memory},\n  booktitle = {24th Euromicro International Conference on Parallel, Distributed,\n               and Network-Based Processing, {PDP} 2016, Heraklion, Crete, Greece,\n               February 17-19, 2016},\n  pages     = {127--134},\n  publisher = {{IEEE} Computer Society},\n  year      = {2016},\n  url       = {https://doi.org/10.1109/PDP.2016.65},\n  url_Paper = {papers/2016-pdp-RBT.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Performance Analysis of Concurrent Red-Black Trees on HTM Platforms.\n \n \n \n \n\n\n \n Siakavaras, D.; Nikas, K.; Goumas, G. I.; and Koziris, N.\n\n\n \n\n\n\n In 10th ACM SIGPLAN Workshop on Transactional Computing (TRANSACT 2015), 2015. \n \n\n\n\n
\n\n\n\n \n \n \"Performance paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{transact15TSX,\n  author    = {Dimitrios Siakavaras and\n               Konstantinos Nikas and\n               Georgios I. Goumas and\n               Nectarios Koziris},\n  title     = {Performance Analysis of Concurrent Red-Black Trees on HTM Platforms},\n  booktitle = {10th ACM SIGPLAN Workshop on Transactional Computing ({TRANSACT} 2015)},\n  year      = {2015},\n  url_Paper = {papers/2015-transact-RBT.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Memory link compression to speedup scientific workloads.\n \n \n \n \n\n\n \n Alverti, C.; Goumas, G. I.; Nikas, K.; Arelakis, A.; Koziris, N.; and Stenström, P.\n\n\n \n\n\n\n In 8th International Workshop on Programmability and Architectures for Heterogeneous Multicores (MULTIPROG 2015), 2015. \n \n\n\n\n
\n\n\n\n \n \n \"Memory paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{multiprog15Compress,\n  author    = {Chloe Alverti and\n               Georgios I. Goumas and\n               Konstantinos Nikas and\n\t\t\t   Angelos Arelakis and\n               Nectarios Koziris and\n               Per Stenstr{\\"{o}}m},\n  title     = {Memory link compression to speedup scientific workloads},\n  booktitle = {8th International Workshop on Programmability and Architectures for Heterogeneous Multicores ({MULTIPROG} 2015)},\n  year      = {2015},\n  url_Paper = {papers/2015-multiprog-mlinkcompression.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2014\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n LCA: a memory link and cache-aware co-scheduling approach for CMPs.\n \n \n \n \n\n\n \n Haritatos, A.; Goumas, G. I.; Anastopoulos, N.; Nikas, K.; Kourtis, K.; and Koziris, N.\n\n\n \n\n\n\n In International Conference on Parallel Architectures and Compilation, PACT '14, Edmonton, AB, Canada, August 24-27, 2014, pages 469–470, 2014. ACM\n \n\n\n\n
\n\n\n\n \n \n \"LCA:Paper\n  \n \n \n \"LCA: paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{pact14LCA,\n  author    = {Alexandros{-}Herodotos Haritatos and\n               Georgios I. Goumas and\n               Nikos Anastopoulos and\n               Konstantinos Nikas and\n               Kornilios Kourtis and\n               Nectarios Koziris},\n  title     = {{LCA:} a memory link and cache-aware co-scheduling approach for CMPs},\n  booktitle = {International Conference on Parallel Architectures and Compilation,\n               {PACT} '14, Edmonton, AB, Canada, August 24-27, 2014},\n  pages     = {469--470},\n  publisher = {{ACM}},\n  year      = {2014},\n  url       = {http://doi.acm.org/10.1145/2628071.2628123},\n  url_Paper = {papers/2014-pact-LCA.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n NUMA-CIC: Issues and Challenges for Scaling Scientific Applications on a Large Scale ccNuma Prototype.\n \n \n \n \n\n\n \n Siakavaras, D.; Nikas, K.; Anastopoulos, N.; and Goumas, G. I.\n\n\n \n\n\n\n PRACE-1IP Whitepaper, 2014.\n \n\n\n\n
\n\n\n\n \n \n \"NUMA-CIC:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{prace14numacic,\n\tauthor    =\t{Dimitrios Siakavaras and \n                 Konstantinos Nikas and\n                 Nikolaos Anastopoulos and\n\t\t\t     Georgios I. Goumas},\n\ttitle     =\t{NUMA-CIC: Issues and Challenges for Scaling Scientific Applications on a Large Scale ccNuma Prototype},\n\thowpublished =\t{PRACE-1IP Whitepaper},\n\tyear      =\t{2014},\n\turl       =\t{papers/2014-prace-numacic.pdf},\n}\n\n\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2013\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Energy-Efficient Sparse Matrix Autotuning with CSX - A Trade-off Study.\n \n \n \n \n\n\n \n Meyer, J. C.; Cebrian, J. M.; Natvig, L.; Karakasis, V.; Siakavaras, D.; and Nikas, K.\n\n\n \n\n\n\n In 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum, Cambridge, MA, USA, May 20-24, 2013, pages 931–937, 2013. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"Energy-EfficientPaper\n  \n \n \n \"Energy-Efficient paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{hppac13csx,\n  author    = {Jan Christian Meyer and\n               Juan M. Cebrian and\n               Lasse Natvig and\n               Vasileios Karakasis and\n               Dimitris Siakavaras and\n               Konstantinos Nikas},\n  title     = {Energy-Efficient Sparse Matrix Autotuning with {CSX} - {A} Trade-off\n               Study},\n  booktitle = {2013 {IEEE} International Symposium on Parallel {\\&} Distributed Processing,\n               Workshops and Phd Forum, Cambridge, MA, USA, May 20-24, 2013},\n  pages     = {931--937},\n  publisher = {{IEEE}},\n  year      = {2013},\n  url       = {https://doi.org/10.1109/IPDPSW.2013.219},\n  url_Paper = {papers/2013-hppac-energycsx.pdf}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Energy-centric Study of Conjugate Gradient Method.\n \n \n \n \n\n\n \n Nikas, K.; Siakavaras, D.; Karakasis, V.; Meyer, J. C.; and Natvig, L.\n\n\n \n\n\n\n PRACE-2IP Whitepaper, 2013.\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{prace13cg,\n\tauthor    =\t{Konstantinos Nikas and\n\t\t         Dimitrios Siakavaras and \n                 Vasileios Karakasis and\n                 Jan Christian Meyer and\n\t\t\t     Lasse Natvig},\n\ttitle     =\t{An Energy-centric Study of Conjugate Gradient Method},\n\thowpublished =\t{PRACE-2IP Whitepaper},\n\tyear      =\t{2013},\n\turl       =\t{papers/2013-prace-cg.pdf},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Energy-efficient Sparse Matrix Auto-tuning with CSX.\n \n \n \n \n\n\n \n Meyer, J. C.; Natvig, L.; Siakavaras, D.; Nikas, K.; Anastopoulos, N.; and Goumas, G. I.\n\n\n \n\n\n\n PRACE-2IP Whitepaper, 2013.\n \n\n\n\n
\n\n\n\n \n \n \"Energy-efficientPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{prace13csx,\n\tauthor    =\t{Jan Christian Meyer and\n\t\t\t     Lasse Natvig and\n                 Dimitrios Siakavaras and \n                 Konstantinos Nikas and\n                 Nikolaos Anastopoulos and\n\t\t\t     Georgios I. Goumas},\n\ttitle     =\t{Energy-efficient Sparse Matrix Auto-tuning with CSX},\n\thowpublished =\t{PRACE-2IP Whitepaper},\n\tyear      =\t{2013},\n\turl       =\t{papers/2013-prace-csx.pdf},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2012\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n An Approach to Parallelize Kruskal's Algorithm Using Helper Threads.\n \n \n \n \n\n\n \n Katsigiannis, A.; Anastopoulos, N.; Nikas, K.; and Koziris, N.\n\n\n \n\n\n\n In 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, IPDPS 2012, Shanghai, China, May 21-25, 2012, pages 1601–1610, 2012. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n \n \"An paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{mtaap12kruskal,\n  author    = {Anastasios Katsigiannis and\n               Nikos Anastopoulos and\n               Konstantinos Nikas and\n               Nectarios Koziris},\n  title     = {An Approach to Parallelize Kruskal's Algorithm Using Helper Threads},\n  booktitle = {26th {IEEE} International Parallel and Distributed Processing Symposium\n               Workshops {\\&} PhD Forum, {IPDPS} 2012, Shanghai, China, May 21-25,\n               2012},\n  pages     = {1601--1610},\n  publisher = {{IEEE} Computer Society},\n  year      = {2012},\n  url       = {https://doi.org/10.1109/IPDPSW.2012.201},\n  url_Paper = {papers/2012-mtaap-kruskal.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Using State-of-the-Art Sparse Matrix Optimizations for Accelerating the Performance of Multiphysics Simulations.\n \n \n \n \n\n\n \n Karakasis, V.; Goumas, G. I.; Nikas, K.; Koziris, N.; Ruokolainen, J.; and Räback, P.\n\n\n \n\n\n\n In Applied Parallel and Scientific Computing - 11th International Conference, PARA 2012, Helsinki, Finland, June 10-13, 2012, Revised Selected Papers, volume 7782, of Lecture Notes in Computer Science, pages 531–535, 2012. Springer\n \n\n\n\n
\n\n\n\n \n \n \"UsingPaper\n  \n \n \n \"Using paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{para12csx_elmer,\n  author    = {Vasileios Karakasis and\n               Georgios I. Goumas and\n               Konstantinos Nikas and\n               Nectarios Koziris and\n               Juha Ruokolainen and\n               Peter R{\\"{a}}back},\n  title     = {Using State-of-the-Art Sparse Matrix Optimizations for Accelerating\n               the Performance of Multiphysics Simulations},\n  booktitle = {Applied Parallel and Scientific Computing - 11th International Conference,\n               {PARA} 2012, Helsinki, Finland, June 10-13, 2012, Revised Selected\n               Papers},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {7782},\n  pages     = {531--535},\n  publisher = {Springer},\n  year      = {2012},\n  url       = {https://doi.org/10.1007/978-3-642-36803-5_40},\n  url_Paper = {papers/2012-para-csx.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Using State-Of-The-Art Sparse Matrix Optimizations for Accelerating the Performance of Elmer.\n \n \n \n \n\n\n \n Karakasis, V.; Goumas, G. I.; Nikas, K.; koziris , N.; Ruokolainen, J.; and Räback, P.\n\n\n \n\n\n\n PRACE-1IP Whitepaper, 2012.\n \n\n\n\n
\n\n\n\n \n \n \"UsingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{prace12elmer,\n\tauthor    =\t{Vasileios Karakasis and\n\t\t\t     Georgios I. Goumas and\n                 Konstantinos Nikas and\n                 Nectarios koziris and\n\t\t\t     Juha Ruokolainen and\n\t             Peter R{\\"{a}}back},\n\ttitle     =\t{Using State-Of-The-Art Sparse Matrix Optimizations for Accelerating the Performance of Elmer},\n\thowpublished =\t{PRACE-1IP Whitepaper},\n\tyear      =\t{2012},\n\turl       =\t{papers/2012-prace-csx_elmer.pdf},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2009\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm.\n \n \n \n \n\n\n \n Nikas, K.; Anastopoulos, N.; Goumas, G. I.; and Koziris, N.\n\n\n \n\n\n\n In ICPP 2009, International Conference on Parallel Processing, Vienna, Austria, 22-25 September 2009, pages 388–395, 2009. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"EmployingPaper\n  \n \n \n \"Employing paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{icpp09dijkstra,\n  author    = {Konstantinos Nikas and\n               Nikos Anastopoulos and\n               Georgios I. Goumas and\n               Nectarios Koziris},\n  title     = {Employing Transactional Memory and Helper Threads to Speedup Dijkstra's\n               Algorithm},\n  booktitle = {{ICPP} 2009, International Conference on Parallel Processing, Vienna,\n               Austria, 22-25 September 2009},\n  pages     = {388--395},\n  publisher = {{IEEE} Computer Society},\n  year      = {2009},\n  url       = {https://doi.org/10.1109/ICPP.2009.60},\n  url_Paper = {papers/2009-icpp-dijkstra.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Early experiences on accelerating Dijkstra's algorithm using transactional memory.\n \n \n \n \n\n\n \n Anastopoulos, N.; Nikas, K.; Goumas, G. I.; and Koziris, N.\n\n\n \n\n\n\n In 23rd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2009, Rome, Italy, May 23-29, 2009, pages 1–8, 2009. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"EarlyPaper\n  \n \n \n \"Early paper\n  \n \n \n \"Early slides\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{mtaap09dijkstra,\n  author    = {Nikos Anastopoulos and\n               Konstantinos Nikas and\n               Georgios I. Goumas and\n               Nectarios Koziris},\n  title     = {Early experiences on accelerating Dijkstra's algorithm using transactional\n               memory},\n  booktitle = {23rd {IEEE} International Symposium on Parallel and Distributed Processing,\n               {IPDPS} 2009, Rome, Italy, May 23-29, 2009},\n  pages     = {1--8},\n  publisher = {{IEEE}},\n  year      = {2009},\n  url       = {https://doi.org/10.1109/IPDPS.2009.5161103},\n  url_Paper = {papers/2009-mtaap-dijkstra.pdf},\n  url_Slides= {slides/2009-mtaap-presentation.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2008\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n An adaptive bloom filter cache partitioning scheme for multicore architectures.\n \n \n \n \n\n\n \n Nikas, K.; Horsnell, M.; and Garside, J. D.\n\n\n \n\n\n\n In Proceedings of the 2008 International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation (IC-SAMOS 2008), Samos, Greece, July 21-24, 2008, pages 25–32, 2008. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n \n \"An paper\n  \n \n \n \"An slides\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DBLP:conf/samos/NikasHG08,\n  author    = {Konstantinos Nikas and\n               Matthew Horsnell and\n               Jim D. Garside},\n  title     = {An adaptive bloom filter cache partitioning scheme for multicore architectures},\n  booktitle = {Proceedings of the 2008 International Conference on Embedded Computer\n               Systems: Architectures, Modeling and Simulation {(IC-SAMOS} 2008),\n               Samos, Greece, July 21-24, 2008},\n  pages     = {25--32},\n  publisher = {{IEEE}},\n  year      = {2008},\n  url       = {https://doi.org/10.1109/ICSAMOS.2008.4664843},\n  timestamp = {Thu, 25 May 2017 01:00:00 +0200},\n  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/samos/NikasHG08},\n  bibsource = {dblp computer science bibliography, http://dblp.org},\n  url_Paper = {papers/2008-samos-abfcp.pdf},\n  url_Slides= {slides/2008-samos-abfcp.pdf}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);