default search action
Matias Bjørling
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j4]Shai Bergman
, Niklas Cassel
ZNSwap: un-Block your Swap. ACM Trans. Storage 19(2): 12:1-12:25 (2023) - [c12]Thomas Kim, Jekyeom Jeon, Nikhil Arora, Huaicheng Li, Michael Kaminsky, David G. Andersen, Gregory R. Ganger, George Amvrosiadis, Matias Bjørling:
RAIZN: Redundant Array of Independent Zoned Namespaces. ASPLOS (2) 2023: 660-673 - [c11]Krijn Doekemeijer, Nick Tehrany, Balakrishnan Chandrasekaran, Matias Bjørling, Animesh Trivedi:
Performance Characterization of NVMe Flash Devices with Zoned Namespaces (ZNS). CLUSTER 2023: 118-131 - [c10]Dongjoo Seo
Is Garbage Collection Overhead Gone? Case study of F2FS on ZNS SSDs. HotStorage 2023: 102-108 - [i2]Krijn Doekemeijer, Nick Tehrany, Balakrishnan Chandrasekaran, Matias Bjørling, Animesh Trivedi:
Performance Characterization of NVMe Flash Devices with Zoned Namespaces (ZNS). CoRR abs/2310.19094 (2023) - 2022
- [c9]Shai Bergman, Niklas Cassel, Matias Bjørling, Mark Silberstein:
ZNSwap: un-Block your Swap. USENIX ATC 2022: 1-18 - 2021
- [c8]Reza Salkhordeh, Kevin Kremer, Lars Nagel
Constant Time Garbage Collection in SSDs. NAS 2021: 1-9 - [c7]Matias Bjørling, Abutalib Aghayev, Hans Holmberg, Aravind Ramesh, Damien Le Moal, Gregory R. Ganger, George Amvrosiadis:
ZNS: Avoiding the Block Interface Tax for Flash-based SSDs. USENIX ATC 2021: 689-703
2010 – 2019
- 2018
- [c6]Huaicheng Li, Mingzhe Hao, Michael Hao Tong, Swaminathan Sundararaman, Matias Bjørling, Haryadi S. Gunawi:
The CASE of FEMU: Cheap, Accurate, Scalable and Extensible Flash Emulator. FAST 2018: 83-90 - 2017
- [c5]Matias Bjørling, Javier González, Philippe Bonnet
LightNVM: The Linux Open-Channel SSD Subsystem. FAST 2017: 359-374 - 2014
- [c4]Michael Yung Chung Wei, Matias Bjørling, Philippe Bonnet
I/O Speculation for the Microsecond Era. USENIX ATC 2014: 475-481 - [i1]Niv Dayan, Martin Kjær Svendsen, Matias Bjørling, Philippe Bonnet, Luc Bouganim:
EagleTree: Exploring the Design Space of SSD-Based Algorithms. CoRR abs/1401.6360 (2014) - 2013
- [j3]Niv Dayan, Martin Kjær Svendsen, Matias Bjørling, Philippe Bonnet
EagleTree: Exploring the Design Space of SSD-Based Algorithms. Proc. VLDB Endow. 6(12): 1290-1293 (2013) - [c3]Matias Bjørling, Philippe Bonnet, Luc Bouganim, Niv Dayan:
The Necessary Death of the Block Device Interface. CIDR 2013 - [c2]Matias Bjørling, Jens Axboe, David W. Nellans, Philippe Bonnet
Linux block IO: introducing multi-queue SSD access on multi-core systems. SYSTOR 2013: 22:1-22:10 - 2011
- [j2]Philippe Bonnet
Repeatability and workability evaluation of SIGMOD 2011. SIGMOD Rec. 40(2): 45-48 (2011) - 2010
- [j1]Matias Bjørling, Philippe Bonnet
uFLIP: Understanding the Energy Consumption of Flash Devices. IEEE Data Eng. Bull. 33(4): 48-54 (2010) - [c1]Matias Bjørling, Lionel Le Folgoc, Ahmed Mseddi, Philippe Bonnet
Performing sound flash device measurements: some lessons from uFLIP. SIGMOD Conference 2010: 1219-1222
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: