Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Bradley C. Kuszmaul"'
Publikováno v:
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7e7dc4cae337042e9f162b0db8068eb
https://doi.org/10.1145/3558481.3591085
https://doi.org/10.1145/3558481.3591085
Publikováno v:
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82c90033b0ffc705da511249eef17916
https://doi.org/10.1145/3558481.3591321
https://doi.org/10.1145/3558481.3591321
Publikováno v:
ACM Transactions on Storage. 16:1-29
Oracle File Storage Service (FSS) is an elastic filesystem provided as a managed NFS service. A pipelined Paxos implementation underpins a scalable block store that provides linearizable multipage limited-size transactions. Above the block store, a s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d17d40fda7b9b83cc719f920331cf526
https://doi.org/10.1145/3377877
https://doi.org/10.1145/3377877
Publikováno v:
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f83a5ee3f1c33708f4006d12182b0d9c
https://doi.org/10.1109/focs52979.2021.00115
https://doi.org/10.1109/focs52979.2021.00115
Autor:
Charles E. Leiserson, Daniel Sanchez, Tao B. Schardl, Neil C. Thompson, Butler W. Lampson, Bradley C. Kuszmaul, Joel Emer
Publikováno v:
Science (New York, N.Y.). 368(6495)
From bottom to top The doubling of the number of transistors on a chip every 2 years, a seemly inevitable trend that has been called Moore's law, has contributed immensely to improvements in computer performance. However, silicon-based transistors ca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::14f33aea7108df15d86e6d9e091b8d36
https://pubmed.ncbi.nlm.nih.gov/32499413
https://pubmed.ncbi.nlm.nih.gov/32499413
Autor:
Charles E. Leiserson, Stephen Tschudi, Bradley C. Kuszmaul, Pramod Ganapathi, Jesmin Jahan Tithi, Armando Solar-Lezama, Charles Bachmeier, Yuan Tang, Rezaul Chowdhury
Publikováno v:
MIT web domain
We present A utogen —an algorithm that for a wide class of dynamic programming (DP) problems automatically discovers highly efficient cache-oblivious parallel recursive divide-and-conquer algorithms from inefficient iterative descriptions of DP rec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6aa4a383a6fb417ca8ef46fec3bcf170
https://doi.org/10.1145/3125632
https://doi.org/10.1145/3125632
Autor:
Prashant Pandey, Zardosht Kasheff, Yang Zhan, Pooja Deo, Bradley C. Kuszmaul, Amogh Akshintala, Jun Yuan, Kanchan Chandnani, Michael A. Bender, William Jannen, Martin Farach-Colton, Leif Walsh, Rob Johnson, Donald E. Porter
Publikováno v:
ACM Transactions on Storage. 13:1-26
File systems that employ write-optimized dictionaries (WODs) can perform random-writes, metadata updates, and recursive directory traversals orders of magnitude faster than conventional file systems. However, previous WOD-based file systems have not
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fcc5a8ce2c550dad4edbc694a53220f4
https://doi.org/10.1145/3032969
https://doi.org/10.1145/3032969
Autor:
Damon Doucet, Tao B. Schardl, Bradley C. Kuszmaul, Tyler Denniston, Charles E. Leiserson, I-Ting Angelina Lee
Publikováno v:
SIGMETRICS (Abstracts)
The CSI framework provides comprehensive static instrumentation that a compiler can insert into a program-under-test so that dynamic-analysis tools - memory checkers, race detectors, cache simulators, performance profilers, code-coverage analyzers, e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ce75db8a9eb436d1752e0312a30d253
https://doi.org/10.1145/3292040.3219657
https://doi.org/10.1145/3292040.3219657
Publikováno v:
ACM Transactions on Database Systems. 41:1-33
Most B-tree articles assume that all N keys have the same size K , that f = B / K keys fit in a disk block, and therefore that the search cost is O (log f + 1 N ) block transfers. When keys have variable size, B-tree operations have no nontrivial per
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::282082e5bcc598e14cfc3af9e4176810
https://doi.org/10.1145/2907945
https://doi.org/10.1145/2907945
Autor:
Phaneendra Reddy, Donald E. Porter, John Esmet, Bradley C. Kuszmaul, Michael A. Bender, Ankur Mittal, Leif Walsh, Rob Johnson, Martin Farach-Colton, William Jannen, Jun Yuan, Prashant Pandey, Amogh Akshintala, Yang Zhan, Yizheng Jiao
Publikováno v:
ACM Transactions on Storage. 11:1-29
The B ε -tree File System , or B e trFS (pronounced “better eff ess”), is the first in-kernel file system to use a write-optimized data structure (WODS). WODS are promising building blocks for storage systems because they support both microwrite
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea688729f825c259122441c7b0b8c02b
https://doi.org/10.1145/2798729
https://doi.org/10.1145/2798729