Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Bradley C. Kuszmaul
2010 – today
- 2012
[j7]Michael A. Bender, Martin Farach-Colton, Rob Johnson, Russell Kraner, Bradley C. Kuszmaul, Dzejla Medjedovic, Pablo Montes, Pradeep Shetty, Richard P. Spillane, Erez Zadok: Don't Thrash: How to Cache Your Hash on Flash. PVLDB 5(11): 1627-1637 (2012)
[i2]Michael A. Bender, Martin Farach-Colton, Rob Johnson, Russell Kraner, Bradley C. Kuszmaul, Dzejla Medjedovic, Pablo Montes, Pradeep Shetty, Richard P. Spillane, Erez Zadok: Don't Thrash: How to Cache Your Hash on Flash. CoRR abs/1208.0290 (2012)- 2011
[j6]Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang: Optimal Cache-Oblivious Mesh Layouts. Theory Comput. Syst. 48(2): 269-296 (2011)
[c20]Yuan Tang, Rezaul Alam Chowdhury, Bradley C. Kuszmaul, Chi-Keung Luk, Charles E. Leiserson: The pochoir stencil compiler. SPAA 2011: 117-128- 2010
[c19]Michael A. Bender, Haodong Hu, Bradley C. Kuszmaul: Performance guarantees for B-trees with different-sized atomic keys. PODS 2010: 305-316
2000 – 2009
- 2009
[c18]Bradley C. Kuszmaul: Brief announcement: TeraByte TokuSampleSort sorts 1TB in 197s. SPAA 2009: 127-129- 2007
[c17]Chris Hill, Bradley C. Kuszmaul, Charles E. Leiserson, John Marshall: Planet-in-a-Bottle: A Numerical Fluid-Laboratory System. International Conference on Computational Science (1) 2007: 1163-1170
[c16]Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson: Cache-oblivious streaming B-trees. SPAA 2007: 81-92
[c15]Bradley C. Kuszmaul: Cilk provides the "best overall productivity" for high performance computing: (and won the HPC challenge award to prove it). SPAA 2007: 299-300
[i1]Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang: Optimal Cache-Oblivious Mesh Layouts. CoRR abs/0705.1033 (2007)- 2006
[j5]C. Scott Ananian, Krste Asanovic, Bradley C. Kuszmaul, Charles E. Leiserson, Sean Lie: Unbounded Transactional Memory. IEEE Micro 26(1): 59-69 (2006)
[c14]Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul: Cache-oblivious string B-trees. PODS 2006: 233-242- 2005
[c13]Doug Carmean, Babak Falsafi, Bradley C. Kuszmaul, Jignesh M. Patel, Kenneth A. Ross: Architecture-Conscious Databases: sub-optimization or the next big leap? DaMoN 2005
[c12]C. Scott Ananian, Krste Asanovic, Bradley C. Kuszmaul, Charles E. Leiserson, Sean Lie: Unbounded Transactional Memory. HPCA 2005: 316-327
[c11]Bradley C. Kuszmaul: A segmented parallel-prefix VLSI circuit with small delays for small segments. SPAA 2005: 213
[c10]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul: Concurrent cache-oblivious b-trees. SPAA 2005: 228-237
[c9]Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson: Adversarial contention resolution for simple channels. SPAA 2005: 325-332- 2004
[c8]Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson: Adversarial Analyses of Window Backoff Strategies. IPDPS Next Generation Software Program - NSFNGS - PI Workshop 2004- 2002
[j4]Bradley C. Kuszmaul, Dana S. Henry, Gabriel H. Loh: A Comparison of Asymptotically Scalable Superscalar Processors. Theory Comput. Syst. 35(2): 129-150 (2002)- 2000
[c7]Dana S. Henry, Bradley C. Kuszmaul, Gabriel H. Loh, Rahul Sami: Circuits for wide-window superscalar processors. ISCA 2000: 236-247
1990 – 1999
- 1999
[c6]Dana S. Henry, Bradley C. Kuszmaul, Vinod Viswanath: The Ultrascalar Processor-An Asymptotically Scalable Superscalar Microarchitecture. ARVLSI 1999: 256-275
[c5]Bradley C. Kuszmaul, Dana S. Henry, Gabriel H. Loh: A Comparison of Scalable Superscalar Processors. SPAA 1999: 126-137- 1996
[j3]Charles E. Leiserson, Zahi S. Abuhamdeh, David C. Douglas, Carl R. Feynman, Mahesh N. Ganmukhi, Jeffrey V. Hill, W. Daniel Hillis, Bradley C. Kuszmaul, Margaret A. St. Pierre, David S. Wells, Monica C. Wong-Chan, Shaw-Wen Yang, Robert Zak: The Network Architecture of the Connection Machine CM-5. J. Parallel Distrib. Comput. 33(2): 145-158 (1996)
[j2]Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, Yuli Zhou: Cilk: An Efficient Multithreaded Runtime System. J. Parallel Distrib. Comput. 37(1): 55-69 (1996)- 1995
[c4]
[c3]Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, Yuli Zhou: Cilk: An Efficient Multithreaded Runtime System. PPOPP 1995: 207-216- 1994
[c2]Eric A. Brewer, Bradley C. Kuszmaul: How to Get Good Performance from the CM-5 Data Network. IPPS 1994: 858-867- 1992
[c1]Charles E. Leiserson, Zahi S. Abuhamdeh, David C. Douglas, Carl R. Feynman, Mahesh N. Ganmukhi, Jeffrey V. Hill, W. Daniel Hillis, Bradley C. Kuszmaul, Margaret A. St. Pierre, David S. Wells, Monica C. Wong, Shaw-Wen Yang, Robert Zak: The Network Architecture of the Connection Machine CM-5 (Extended Abstract). SPAA 1992: 272-285- 1990
[j1]Bradley C. Kuszmaul, Jeff Fried: NAP(No ALU Processor): The Great Communicator. J. Parallel Distrib. Comput. 8(2): 169-179 (1990)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-10-11 22:31 CEST by the dblp team



