Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Papagiannis, Anastasios"'
Autor:
Kolokasis, Iacovos G., Evdorou, Giannos, Papagiannis, Anastasios, Zakkak, Foivos, Kozanitis, Christos, Akram, Shoaib, Pratikakis, Polyvios, Bilas, Angelos
Big data analytics frameworks, such as Spark and Giraph, need to process and cache massive amounts of data that do not always fit on the heap. Therefore, frameworks temporarily move long-lived objects outside the managed heap (off-heap) on a fast sto
Externí odkaz:
http://arxiv.org/abs/2111.10589
Autor:
Xanthakis, Giorgos, Saloustros, Giorgos, Batsaras, Nikos, Papagiannis, Anastasios, Bilas, Angelos
Key-value (KV) separation is a technique that introduces randomness in the I/O access patterns to reduce I/O amplification in LSM-based key-value stores for fast storage devices (NVMe). KV separation has a significant drawback that makes it less attr
Externí odkaz:
http://arxiv.org/abs/2106.03840
Autor:
Mikrou, Stella, Papagiannis, Anastasios, Saloustros, Giorgos, Marazakis, Manolis, Bilas, Angelos
With the current rate of data growth, processing needs are becoming difficult to fulfill due to CPU power and energy limitations. Data serving systems and especially persistent key-value stores have become a substantial part of data processing stacks
Externí odkaz:
http://arxiv.org/abs/2008.13402
Autor:
Batsaras, Nikos, Saloustros, Giorgos, Papagiannis, Anastasios, Fatourou, Panagiota, Bilas, Angelos
Over the past years, there has been an increasing number of key-value (KV) store designs, each optimizing for a different set of requirements. Furthermore, with the advancements of storage technology the design space of KV stores has become even more
Externí odkaz:
http://arxiv.org/abs/2003.00103
Publikováno v:
In The Journal of Systems & Software November 2014 97:47-64
Publikováno v:
Euro-Par 2020: Parallel Processing Workshops
Memory-mapped I/O (mmio) is emerging as a viable alternative for accessing directly-attached fast storage devices compared to explicit I/O with system calls. Mmio removes the need for costly lookups in the DRAM I/O cache for cache hits, as they are h
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
High Performance Computing (9783319460789); 2016, p638-648, 11p
Autor:
Mavridis, Stelios, Sfakianakis, Yannis, Papagiannis, Anastasios, Marazakis, Manolis, Bilas, Angelos
Publikováno v:
2014 30th Symposium on Mass Storage Systems & Technologies (MSST); 2014, p1-10, 10p
Publikováno v:
ACM SIGOPS Operating Systems Review; January 2017, Vol. 50 Issue: 2 p3-11, 9p