240 likes | 393 Vues
This document outlines innovative approaches for efficient data synchronization, focusing on characteristic polynomial interpolation (CPI) techniques. It discusses full transfer methods, including Slow Sync and optimized algorithms for various scenarios. The implementation of GenSync software is highlighted, showcasing reconciliation experiments and performance analyses. Open problems and future directions are also presented, emphasizing the need for further research in interactive CPI and partitioning strategies. This work aims to contribute solutions to complex data synchronization challenges.
E N D
Efficient Data Synchronization Jiaxi Jin
OUTLINE Motivation Full Transfer 1 2 3 4 5 6 7 Characteristic Polynomial Interpolation(CPI) Generalized CPI Algorithm Software Implementation: GenSync Reconciliation Experiment Way to Go: Open Problems
An Example of CPISync 3 send numerator
Optimized CPI Algorithm with unknown m 4.1Probabilistic CPI : CPI with an unknown upper bound 4
CPI(m=6) • failed: active partition Optimized CPI Algorithm with unknown m 4.2Partition CPI Recursively partitioning until succeed with a prescribed bound • CPI(m=6) • terminal 4 • CPI(m=6) • terminal
“crescent.jpg” • 8-bit Hash ID (in decimal): 209 • Byte length: 54234
“firstQuarter.jpg” • 8-bit Hash ID (in decimal): 88 • Byte length: 54082
“half.jpg” • 8-bit Hash ID (in decimal): 184 • Byte length: 53867
“full.jpg” • 8-bit Hash ID (in decimal): 32 • Byte length: 54054
Performance analysis and open problems will be added after extensive test 1
Way to Go: Open Problems 7.1. Interactive CPI consumes extremely large CPUtime 7
Discussion Time THANKS