120 likes | 240 Views
Shruti: Dynamically Adapting Aggregation Aggressiveness. Praveen Yalagandula Mike Dahlin The University of Texas at Austin. SDIMS [Yalagandula & Dahlin SIGCOMM’04]. Scalable Distributed Information Management System Aggregation abstraction Detailed views of nearby information
E N D
Shruti: Dynamically Adapting Aggregation Aggressiveness Praveen Yalagandula Mike Dahlin The University of Texas at Austin Department of Computer Sciences, UT Austin
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, … D,0.2 Aggregation Function: min load B,0.5 D,0.2 ID,Load C,0.8 D,0.2 B,0.5 A,0.9 Department of Computer Sciences, UT Austin
Read Read Write Write Update-all Update-up Choosing Aggregation Strategy • Attributes have different read-write patterns • Examples: machine-load, num-processors Step 2 Update-none Step 1 Write Write Read Read Department of Computer Sciences, UT Austin
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 Department of Computer Sciences, UT Austin
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 Department of Computer Sciences, UT Austin
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 Department of Computer Sciences, UT Austin
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 Department of Computer Sciences, UT Austin
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 Department of Computer Sciences, UT Austin
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 Department of Computer Sciences, UT Austin
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 Department of Computer Sciences, UT Austin
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 Department of Computer Sciences, UT Austin
More information about SDIMS at http://www.cs.utexas.edu/~ypraveen/sdims Department of Computer Sciences, UT Austin