Return-Path: william@bourbon.usc.edu Delivery-Date: Sun Dec 7 19:36:02 2008 X-Spam-Checker-Version: SpamAssassin 3.2.3 (2007-08-08) on merlot.usc.edu X-Spam-Level: X-Spam-Status: No, score=-2.4 required=5.0 tests=AWL,BAYES_00 autolearn=ham version=3.2.3 Received: from bourbon.usc.edu (bourbon.usc.edu [128.125.9.75]) by merlot.usc.edu (8.14.1/8.14.1) with ESMTP id mB83a1sw002021 for ; Sun, 7 Dec 2008 19:36:01 -0800 Received: from bourbon.usc.edu (localhost.localdomain [127.0.0.1]) by bourbon.usc.edu (8.14.2/8.14.1) with ESMTP id mB83bv5P031199 for ; Sun, 7 Dec 2008 19:37:57 -0800 Message-Id: <200812080337.mB83bv5P031199@bourbon.usc.edu> To: cs551@merlot.usc.edu Subject: Re: slide 3 of lecture 22 Date: Sun, 07 Dec 2008 19:37:57 -0800 From: Bill Cheng Someone wrote: > For Lecture 22 slide 3, why is the sum of the keys 9. 0 has 6 keys, 1 has 1 > key and 2 has 2 keys. Why wouldn't it be 8? Slide 3 of lecture 22 is the Finger Tables Example slide. I'm not sure what you were referring to since I could not find any reference to the number 8 or 9. In this example, each node stores one key/file. Node 0 stores a file whose content hash key is 6, node 1 stores a file whose content hash key is 1, and node 3 stores a file whose content hash key is 2. -- Bill Cheng // bill.cheng@usc.edu