Coding for Distributed Storage

SHARE:

Event Speaker: 

Alex Dimakis (Univ. of S. California)

Event Location: 

32-141

Event Date/Time: 

Tuesday, November 27, 2012 - 4:15pm

Reception at 3:45pm in the RSA G5 Lounge
A joint talk with Theory of Computation
 
Abstract
Modern large-scale storage systems are deploying coding to introduce high reliability with limited storage overhead. It was recently discovered that network coding techniques can improve the maintenance of such distributed coded systems compared to standard Reed-Solomon codes. We will cover the developing theory and practice of this new family of network codes called regenerating codes. We will focus on recent developments and connections to interference alignment and locally decodable codes. Finally, we will discuss recent implementations over the Hadoop distributed file system and practical aspects that arise.
 
Biography
Alex Dimakis is an Assistant Professor at the Viterbi School of Engineering, University of Southern California since 2009. He currently holds the Colleen and Roberto Padovani Early Career Chair in Electrical Engineering. He received his Ph.D. in 2008 and M.S. degree in 2005 in electrical engineering and computer sciences from UC Berkeley and the Diploma degree from the National Technical University of Athens in 2003. During 2009 he was a CMI postdoctoral scholar at Caltech. He received an NSF Career award in 2011, a Google faculty research award in 2012 and the Eli Jury dissertation award in 2008. He is the co-recipient of several best paper awards including the joint Information Theory and Communications Society Best Paper Award in 2012.  His research interests include information theory, coding theory, signal processing, and networking, with a current focus on distributed storage, network coding, distributed inference and message passing algorithms.