Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 25 matches
- 2013
- Fabiano C. Botelho, Philip Shilane, Nitin Garg, Windsor Hsu:
Memory efficient sanitization of a deduplicated storage system. FAST 2013: 81-94 - Thanh Do, Tyler Harter, Yingchao Liu, Haryadi S. Gunawi, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau:
HARDFS: hardening HDFS with selective and lightweight versioning. FAST 2013: 105-118 - Danny Harnik, Ronen I. Kat, Oded Margalit, Dmitry Sotnikov, Avishay Traeger:
To Zip or not to Zip: effective resource usage for real-time compression. FAST 2013: 229-242 - Ricardo Koller, Leonardo Mármol, Raju Rangaswami, Swaminathan Sundararaman, Nisha Talagala, Ming Zhao:
Write policies for host-side flash caches. FAST 2013: 45-58 - Eunji Lee, Hyokyung Bahn, Sam H. Noh:
Unioning of the buffer cache and journaling layers with non-volatile memory. FAST 2013: 73-80 - Yan Li, Nakul Sanjay Dhotre, Yasuhiro Ohara, Thomas M. Kroeger, Ethan L. Miller, Darrell D. E. Long:
Horus: fine-grained encryption-based security for large-scale storage. FAST 2013: 147-160 - Mark Lillibridge, Kave Eshghi, Deepavali Bhagwat:
Improving restore speed for backup systems that use inline chunk-based deduplication. FAST 2013: 183-198 - Jacob R. Lorch, Bryan Parno, James W. Mickens, Mariana Raykova, Joshua Schiffman:
Shroud: ensuring private access to large-scale data in the data center. FAST 2013: 199-214 - Lanyue Lu, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, Shan Lu:
A study of Linux file system evolution. FAST 2013: 31-44 - Youyou Lu, Jiwu Shu, Weimin Zheng:
Extending the lifetime of flash-based storage through reducing write amplification from file systems. FAST 2013: 257-270 - Ao Ma, Chris Dragga, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau:
Ffsck: the fast file system checker. FAST 2013: 1-16 - Dirk Meister, André Brinkmann, Tim Süß:
File recipe compression in data deduplication systems. FAST 2013: 175-182 - Madalin Mihailescu, Gokul Soundararajan, Cristiana Amza:
MixApart: decoupled analytics for shared storage systems. FAST 2013: 133-146 - James S. Plank, Mario Blaum, James L. Hafner:
SD codes: erasure codes designed for how storage systems really fail. FAST 2013: 95-104 - James S. Plank, Kevin M. Greenan, Ethan L. Miller:
Screaming fast Galois field arithmetic using intel SIMD instructions. FAST 2013: 299-306 - Mohit Saxena, Yiying Zhang, Michael M. Swift, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau:
Getting real: lessons in transitioning research simulations into hardware systems. FAST 2013: 215-228 - Pradeep Shetty, Richard P. Spillane, Ravikant Malpani, Binesh Andrews, Justin Seyster, Erez Zadok:
Building workload-independent storage with VT-trees. FAST 2013: 17-30 - Ji-Yong Shin, Mahesh Balakrishnan, Tudor Marian, Hakim Weatherspoon:
Gecko: contention-oblivious disk arrays for cloud storage. FAST 2013: 285-298 - Przemyslaw Strzelczak, Elzbieta Adamczyk, Urszula Herman-Izycka, Jakub Sakowicz, Lukasz Slusarczyk, Jaroslaw Wrona, Cezary Dubnicki:
Concurrent deletion in a distributed content-addressable storage system with global deduplication. FAST 2013: 161-174 - Vasily Tarasov, Dean Hildebrand, Geoff Kuenning, Erez Zadok:
Virtual machine workloads: the case for new benchmarks for NAS. FAST 2013: 307-320 - Devesh Tiwari, Simona Boboila, Sudharshan S. Vazhkudai, Youngjae Kim, Xiaosong Ma, Peter Desnoyers, Yan Solihin:
Active flash: towards energy-efficient, in-situ data analytics on extreme-scale machines. FAST 2013: 119-132 - Yiying Zhang, Gokul Soundararajan, Mark W. Storer, Lakshmi N. Bairavasundaram, Sethuraman Subbiah, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau:
Warming up storage-level caches with bonfire. FAST 2013: 59-72 - Kai Zhao, Wenzhe Zhao, Hongbin Sun, Tong Zhang, Xiaodong Zhang, Nanning Zheng:
LDPC-in-SSD: making advanced error correction codes work effectively in solid state drives. FAST 2013: 243-256 - Mai Zheng, Joseph A. Tucek, Feng Qin, Mark Lillibridge:
Understanding the robustness of SSDS under power fault. FAST 2013: 271-284 - Keith A. Smith, Yuanyuan Zhou:
Proceedings of the 11th USENIX conference on File and Storage Technologies, FAST 2013, San Jose, CA, USA, February 12-15, 2013. USENIX 2013 [contents]
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-29 02:54 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint