Michael A. Bender
Michael A. Bender | |
|---|---|
| Alma mater | Harvard University, A.B. (1992) École Normale Supérieure de Lyon D.E.A. (1993) Harvard University, PhD (1998) |
| Scientific career | |
| Fields | Computer science |
| Institutions | Stony Brook University |
| Thesis | New Algorithms and Metrics for Scheduling (1998) |
| Doctoral advisor | Michael O. Rabin |
Michael A. Bender is an American computer scientist, known for his work in cache-oblivious algorithms, lowest common ancestor data structures, scheduling (computing), and pebble games. He is David R. Smith Leading Scholar professor of computer science at Stony Brook University,[1] and a co-founder of storage technology startup company Tokutek.[2]
Early life and education
[edit]Bender obtained his PhD in computer science in 1998 from the Harvard University[3] under the supervision of Michael O. Rabin.[4]
Research contributions
[edit]After completing his Ph.D., he co-founded Tokutek.[5] He was program chair of the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2006).[6] The cache-oblivious B-tree data structures studied by Bender, Demaine, and Farach-Colton beginning in 2000 became the basis for the fractal tree index used by Tokutek's products TokuDB and TokuMX.[2]
Awards and honors
[edit]In 2012 Bender won the Simon Imre Test of Time award at LATIN.[7] In 2015, his paper "Two-Level Main Memory Co-Design: Multi-Threaded Algorithmic Primitives, Analysis, and Simulation" won the Best Paper award at IPDPS.[8] In 2016, his paper "Optimizing Every Operation in a Write-optimized File System" won the Best Paper award at FAST.[9]
Selected publications
[edit]- Bender, Michael A.; Farach-Colton, Martin (2000), "The LCA problem revisited" (PDF), in Gonnet, Gaston H.; Panario, Daniel; Viola, Alfredo (eds.), LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000, Proceedings, Lecture Notes in Computer Science, vol. 1776, Springer, pp. 88–94, doi:10.1007/10719839_9, ISBN 978-3-540-67306-4.
- Bender, Michael A.; Demaine, Erik D.; Farach-Colton, Martin (2005), "Cache-oblivious B-trees", SIAM Journal on Computing, 35 (2): 341–358, CiteSeerX 10.1.1.32.4093, doi:10.1137/S0097539701389956, MR 2191447. Previously announced at FOCS 2000.
- Bender, Michael A.; Chakrabarti, Soumen; Muthukrishnan, Muthu (1998), "Flow and stretch metrics for scheduling continuous job streams", 9th Annual ACM-SIAM Symposium on Discrete Algorithms SODA '98., CiteSeerX 10.1.1.44.7577.
- Bender, Michael A.; Fernandez, Antonio; Ron, Dana; Sahai, Amit; Vadhan, Salil (1998). "The power of a pebble". Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98. pp. 269–278. CiteSeerX 10.1.1.8.1984. doi:10.1145/276698.276759. ISBN 0897919629. S2CID 47095697..
References
[edit]- ^ [1], Department of Computer Science, Stony Brook University, retrieved 2021-12-23.
- ^ a b "Tokutek Founders to Speak at Big Data Techcon San Francisco", Market Wired, October 14, 2014.
- ^ "Michael Bender - The Mathematics Genealogy Project". www.mathgenealogy.org.
- ^ Michael A. Bender at the Mathematics Genealogy Project
- ^ "FAST 17". www.usenix.org.
- ^ [2], ACM, retrieved 2021-12-23.
- ^ "LATIN". latintcs.org. Retrieved 2021-10-08.
- ^ "IPDPS 2015 Avance Program". ipdps.org. Retrieved 2021-12-13.
- ^ "Best Papers". usenix.org. Retrieved 2021-11-24.
