Grzegorz Malewicz

谷歌软件工程师

Greg Malewicz received the BA degrees in computer science and in applied mathematics in 1996 and 1998, respectively, and the MS degree in computer science in 1998, all from the University of Warsaw. He received the PhD degree in computer science from the University of Connecticut in 2003 with his last year at Massachusetts Institute of Technology. He is an engineer at Google designing simple and expressive models of computation and realizing them as scalable systems so as to make data processing in the cloud simple. He co-founded the Pregel project for graph processing and earlier worked on MapReduce, which lead to the first successful 1PB sort (both projects are team efforts). He has had internships at the AT&T Shannon Laboratory (summer 2001) and Microsoft Corp. (summer 2000 and fall 2001). He was a visiting scientist at the University of Massachusetts, Amherst (summer 2004) and Argonne National Laboratory (summer 2005), and an assistant professor at the University of Alabama, where he taught computer science (2003 until 2005). His research focuses on high-performance parallel and distributed computing, experimental and theoretical algorithmics, combinatorial optimization, and scheduling. His research appears in top journals and conferences and includes a singly authored SIAM Journal on Computing paper that solves a decade-old problem in distributed computing.