BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:1.0
BEGIN:VEVENT
DTSTART:20141118T231500Z
DTEND:20141119T010000Z
LOCATION:New Orleans Theater Lobby
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: Techniques such as replication are often used to enable=0Aresilience and high availability. However, replication introduces=0Aoverhead both in terms of network traffic necessary to distribute=0Areplicas, as well as extra storage space requirements. To this end,=0Aredundancy elimination techniques such as compression or deduplication=0Aare often used to reduce the overhead of communication and storage.=0AThis paper aims to explore how these two phases can be optimized by=0Acombining them into a single phase. Our key idea relies on the=0Aobservation that since data is related, there is a probability that=0Adistributed redundancy is already naturally present, thus it may pay=0Aoff to try to identify this natural redundancy in order to avoid=0Areducing redundancy unnecessarily in the first phase only to add it=0Aback later in the second phase. We present how this idea can be=0Aleveraged in practice and demonstrate its viability for two real-life=0AHPC applications.
SUMMARY:Leveraging Naturally Distributed Data Redundancy to Optimize Collective Replication
PRIORITY:3
END:VEVENT
END:VCALENDAR