|Vortragender||Prof. Dr. Anwitaman Datta|
|Titel||Coding techniques for distributed storage|
|Zeit||Montag, 3. Juni 2013, 17.00 Uhr|
Hochschulstr. 10, 64283 Darmstadt
Erasure coding provides a mechanism to store data redundantly for fault-tolerance in a cost-effective manner. Recently, there has been a renewed interest in designing new erasure coding techniques with different desirable properties, including good repairability and degraded read performance, or efficient redundancy generation processes.|
Very often, these novel techniques exploit the computational resources available 'in the network', i.e., leverage on storage units which are not passive entities supporting only read/write of data, but also can carry out some computations. This talk will portray a big picture of some of the important processes within distributed storage systems, where erasure codes designed by explicitly taking into account the nuances of distributed storage systems can provide significant performance boosts.
|Anwitaman Datta did his PhD at EPFL Lausanne before moving to NTU Singapore in 2006, where he is currently an Associate Professor in the School of Computer Engineering. He is interested in large scale networked distributed information systems and social collaboration networks, self-organization and algorithmic issues of these systems and networks and their scalability, resilience, security and performance. He leads the SANDS (Self-* and Algorithmic aspects of Networked Distributed Systems) group at NTU.|