1. January 19, 2016Department of Computer Sciences, UT Austin1 Shruti: Dynamically Adapting Aggregation Aggressiveness Praveen Yalagandula Mike Dahlin The University of Texas at Austin

2. January 19, 2016Department of Computer Sciences, UT Austin2 SDIMS [Yalagandula & Dahlin SIGCOMM’04]  Scalable Distributed Information Management System  Aggregation abstraction Detailed views of nearby information Summarized views of global information  Key building block for large distributed applications System administration, multicast, object location, naming, … A,0.9 B,0.5 C,0.8 D,0.2 B,0.5 D,0.2 ID,Load Aggregation Function: min load

3. January 19, 2016Department of Computer Sciences, UT Austin3 Choosing Aggregation Strategy  Attributes have different read-write patterns  Examples: machine-load, num-processors Write Read Update-all Write Read Update-up Write Read Write Read Update-none Step 1 Step 2

4. January 19, 2016Department of Computer Sciences, UT Austin4 Shruti: Dynamically adapting strategy  A lease based mechanism  Lease from A to B implies Any updates at A are propagated to B B does not need to contact A on reads  Set leases based on observed read and write history

5. January 19, 2016Department of Computer Sciences, UT Austin5 Shruti: Dynamically adapting strategy  A lease based mechanism  Lease from A to B implies Any updates at A are propagated to B B does not need to contact A on reads  Set leases based on observed read and write history

6. January 19, 2016Department of Computer Sciences, UT Austin6 Shruti: Dynamically adapting strategy  A lease based mechanism  Lease from A to B implies Any updates at A are propagated to B B does not need to contact A on reads  Set leases based on observed read and write history

7. January 19, 2016Department of Computer Sciences, UT Austin7 Shruti: Dynamically adapting strategy  A lease based mechanism  Lease from A to B implies Any updates at A are propagated to B B does not need to contact A on reads  Set leases based on observed read and write history

8. January 19, 2016Department of Computer Sciences, UT Austin8 Shruti: Dynamically adapting strategy  A lease based mechanism  Lease from A to B implies Any updates at A are propagated to B B does not need to contact A on reads  Set leases based on observed read and write history

9. January 19, 2016Department of Computer Sciences, UT Austin9 Shruti: Dynamically adapting strategy  A lease based mechanism  Lease from A to B implies Any updates at A are propagated to B B does not need to contact A on reads  Set leases based on observed read and write history

10. January 19, 2016Department of Computer Sciences, UT Austin10 Shruti: Dynamically adapting strategy  A lease based mechanism  Lease from A to B implies Any updates at A are propagated to B B does not need to contact A on reads  Set leases based on observed read and write history

11. January 19, 2016Department of Computer Sciences, UT Austin11 Shruti: Dynamically adapting strategy  A lease based mechanism  Lease from A to B implies Any updates at A are propagated to B B does not need to contact A on reads  Set leases based on observed read and write history

12. January 19, 2016Department of Computer Sciences, UT Austin12  More information about SDIMS at http://www.cs.utexas.edu/~ypraveen/sdims