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 a Staff Software 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 theoretical 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.
Greg is an avid traveler. His bicycle and friends toured the Himalayas, the Andes and the Alps, including Khardung La, which he cycled as the first Pole. Check out Greg's photos from bicycle and other trips. Greg likes making friends! You can reach me at gmalewicz at gmail.
IPDPS'10, SMTPS'10, NCA'10, SBAC-PAD'09, CloudComp'09, SMTPS'09, NCA'09, PCGrid'08, SBAC-PAD'08, HiPC'08, PCGrid'07 IPDPS'06 NCA'06,
Models of Computation and Realization Challenges in the Cloud, Invited Talk, Special EECS seminar, Harvard School of Engineering and Applied Sciences, Cambridge, MA, December 14, 2009
Challenges in Data Processing in the Cloud, Invited Talk, Trend Micro, Taipei, Taiwan, November 16, 2009
Challenges in Data Processing in the Cloud, Keynote Speech, Hadoop World 2009, Beijing, China, November 15, 2009
The Reduce Straggler Problem in MapReduce, Invited Talk, National Cheng Kung University, Tainan, Taiwan, October 29, 2009
Practical Models of Computation in Fault-Prone Clouds, Invited Talk, National Taiwan University, Taipei, Taiwan, October 26, 2009
Models of Computation in the Cloud, Keynote Speech, First International Conference on Cloud Computing, Munich, Germany, October 19, 2009
Pregel: A System for Large-Scale Graph Processing, Invited Talk in the Session on Industrial Applications of Algorithms, 28th ACM Symposium on Principles of Distributed Computing, Calgary, Canada, August 11, 2009
MapReduce, Invited Talk, Baidu Corporation, Beijing, China, July 17, 2009
MapReduce at Google, Invited Talk, Tsinghua University, Beijing, China, December 4, 2008
MapReduce, Invited Talk, NEC Labs, Princeton, USA, March 7, 2008
MapReduce at Google, Invited Talk, Computational Research in Boston Seminar, Massachusetts Institute of Technology, Cambridge, USA, October 3, 2008
MapReduce, College of Computer and Information Science Colloquium, Northeastern University, Boston, USA, October 24, 2007
Cloud Computing and Mobile Platforms, Lecturer, National Taiwan University, Taipei, Taiwan, October 26 - November 16, 2009
Cloud Computing Fundamentals and Technologies, Lectures, Tsinghua University, Beijing, China, October 17 and 18, 2009
Computing on Large Clusters, Lectures, Open Lectures for PhD Students in Computer Science, Warsaw University, Warsaw, Poland, May 7 and 8, 2009
Pregel: A System for Large-Scale Graph Processing, Grzegorz Malewicz, Matthew H. Austern, Aart J.C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, Grzegorz Czajkowski, 28th ACM Symposium on Principles of Distributed Computing, 2009, pp. 6-6.
Extending IC-Scheduling via the Sweep Algorithm, Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg, 16th Euromicro International Conference on Parallel, Distributed and Network-Based Processing, 2008, pp. 366-373.
Applying IC-Scheduling Theory to Familiar Classes of Computations, Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg, Workshop on Large-Scale and Volatile Desktop Grids in conjunction with IPDPS'07, 2007, pp. 1-8.
A Tool for Prioritizing DAGMan Jobs and Its Evaluation, Grzegorz Malewicz, Ian Foster, Arnold Rosenberg, Michael Wilde, Proceedings of the IEEE International Symposium on High-Performance Distributed Computing (HPDC06), 2006, pp. 156-167.
On Scheduling Expansive and Reductive Dags for Internet-Based Computing, Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg, 26th IEEE International Conference on Distributed Computing Systems, 2006, pp. 29.
A Tool for Prioritizing DAGMan Jobs and its Evaluation, Grzegorz Malewicz, Ian T. Foster, Arnold L. Rosenberg, Michael Wilde, J. Grid Comput., vol. 5 (2007), pp. 197-212.
Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality, Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg, IEEE Trans. Parallel Distrib. Syst., vol. 18 (2007), pp. 1607-1617.
Toward Maximizing the Quality of Results of Dependent Tasks Computed Unreliably, Li Gao, Grzegorz Malewicz, Theory Comput. Syst., vol. 41 (2007), pp. 731-752.
A Pebble Game for Internet-Based Computing, Grzegorz Malewicz, Arnold L. Rosenberg, Theoretical Computer Science, vol. 3895 (2006), pp. 291-312.
A Tool for Prioritizing DAGMan Jobs and Its Evaluation, Grzegorz Malewicz, Ian T. Foster, Arnold L. Rosenberg, Michael Wilde, 15th IEEE International Symposium on High Performance Distributed Computing, 2006, pp. 156-168.
Distributed Scheduling for Disconnected Cooperation, Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman, Distributed Computing, vol. 18 (2006), pp. 409-420.
Implementation and Experiments with an Algorithm for Parallel Scheduling of Complex Dags under Uncertainty, Grzegorz Malewicz, 8th Workshop on Algorithm Engineering and Experiments, 2006, pp. 66-74.
Latin Squares with Bounded Size of Row Prefix Intersections, Grzegorz Malewicz, Discrete Applied Mathematics, vol. 154 (2006), pp. 1028-1031.
Toward a Theory for Scheduling Dags in Internet-Based Computing, Grzegorz Malewicz, Arnold L. Rosenberg, Matthew Yurkewych, IEEE Trans. Computers, vol. 55 (2006), pp. 757-768.
A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors, Grzegorz Malewicz, SIAM J. Comput., vol. 34 (2005), pp. 993-1024.
Batch-Scheduling Dags for Internet-Based Computing, Grzegorz Malewicz, Arnold L. Rosenberg, 11th International Euro-Par Conference, 2005, pp. 262-271.
Distributed Algorithms, Burkhard Englert, Dariusz Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman, Algorithms of Computer Science, 2005.
On Scheduling Complex Dags for Internet-Based Computing, Grzegorz Malewicz, Arnold L. Rosenberg, Matthew Yurkewych, 19th International Parallel and Distributed Processing Symposium, 2005.
Parallel Scheduling of Complex Dags under Uncertainty, Grzegorz Malewicz, 17th Annual ACM Symposium on Parallel Algorithms, 2005, pp. 66-75.
Toward a Theory of Avalanche-creating and Error-controlling Encoding Schemes, Grzegorz Malewicz, IEEE International Symposium on Information Theory, 2005, pp. 2394-2398.
A Tight Analysis and Near-Optimal Instances of the Algorithm of Anderson and Woll, Grzegorz Malewicz, Theor. Comput. Sci., vol. 329 (2004), pp. 285-301.
Establishing Wireless Conference Calls under Delay Constraints, Amotz Bar-Noy, Grzegorz Malewicz, J. Algorithms, vol. 51 (2004), pp. 145-169.
Internet Computing of Tasks with Dependencies Using Unreliable Workers, Li Gao, Grzegorz Malewicz, 8th International Conference on Principles of Distributed Systems, 2004, pp. 443-458.
The Quorum Deployment Problem, Seth Gilbert, Grzegorz Malewicz, 8th International Conference on Principles of Distributed Systems, 2004, pp. 316-330.
A Method for Creating Near-Optimal Instances of a Certified Write-All Algorithm, Grzegorz Malewicz, 11th Annual European Symposium on Algorithms, 2003, pp. 422-433.
A Work-Optimal Deterministic Algorithm for the Asynchronous Certified Write-All Problem, Grzegorz Malewicz, 22nd ACM Symposium on Principles of Distributed Computing, 2003, pp. 255-264.
Establishing Wireless Conference Calls Under Delay Constraints, Amotz Bar-Noy, Grzegorz Malewicz, 21st ACM Symposium on Principles of Distributed Computing, 2002, pp. 41-50.
Local Scheduling for Distributed Cooperation, Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman, IEEE International Symposium on Network Computing and Applications, 2001, pp. 244-255.
Optimal Scheduling for Disconnected Cooperation, Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman, 20th ACM Symposium on Principles of Distributed Computing, 2001, pp. 305-307.
Optimal Scheduling for Distributed Cooperation Without Communication, Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman, 8th International Colloquium on Structural Information and Communication Complexity, 2001, pp. 259-274.
Towards Practical Deterministic Write-All Algorithms, Bogdan S. Chlebus, Stefan Dobrev, Dariusz R. Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman, Imrich Vrto, 20th ACM Symposium on Parallel Algorithms and Architectures, 2001, pp. 271-280.
Distributed Cooperation During the Absence of Communication, Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman, 14th International Conference Distributed Computing, 2000, pp. 119-133.
An Auction-Based Flexible Pricing Scheme for Renegotiated QoS Connections and Its Evaluation, Grzegorz Malewicz, Alexander A. Shvartsman, 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 1999, pp. 244-251.
