Posted Updated Distributed System23 minutes read (About 3505 words)0 visits

Paxos-based Key/Value Service

分布式的第三次作业，作业的内容是实现基于Paxos的Key/Value pair数据库

Assignment 3: Paxos-based Key/Value Service

Part A Due: Saturday Nov 2, 11:59:59pm

Part B Due: Saturday Nov 9, 11:59:59pm

Introduction

Your Assignment 2 depends on a single master view server to pick the primary.
If the view server is not available (crashes or has network problems),
then your key/value service won’t work, even if both primary and
backup are available. It also has the less critical defect that it
copes with a server (primary or backup) that’s briefly unavailable
(e.g. due to a lost packet) by either blocking or declaring it dead;
the latter is very expensive because it requires a complete key/value
database transfer.

In this assignment you’ll fix above problems by using Paxos to manage the
replication of a key/value store. You won’t have anything
corresponding to a master view server. Instead, a set of replicas will
process all client requests in the same order, using Paxos to agree on
the order. Paxos will get the agreement right even if some of the
replicas are unavailable, or have unreliable network connections, or
even if subsets of the replicas are isolated in their own network
partitions. As long as Paxos can assemble a majority of replicas, it
can process client operations. Replicas that were not in the majority
can catch up later by asking Paxos for operations that they missed.

Your system will consist of the following players: clients, kvpaxos servers,
and Paxos peers. Clients send Put(), PutHash(), and Get() RPCs to key/value
servers (called kvpaxos servers). A client can send an RPC to any of the kvpaxos
servers, and should retry by sending to a different server if there’s a
failure. Each kvpaxos server contains a replica of the key/value database;
handlers for client Get() and Put() RPCs; and a Paxos peer. Paxos takes the form
of a library that is included in each kvpaxos server. A kvpaxos server talks to
its local Paxos peer (via method calls). The different Paxos peers talk to each
other via RPCs to achieve agreement on each operation.

Your Paxos library’s interface supports an indefinite sequence of
agreement “instances”. The instances are numbered with sequence numbers. Each
instance is either “decided” or not yet decided. A decided instance
has a value. If an instance is decided, then all the Paxos peers that
are aware that it is decided will agree on the same value for that
instance. The Paxos library interface allows kvpaxos to suggest a
value for an instance, and to find out whether an instance has been
decided and (if so) what that instance’s value is.

Your kvpaxos servers will use Paxos to agree on the order in which
client Put()s and Get()s execute. Each time a kvpaxos server receives
a Put() or Get() RPC, it will use Paxos to cause some Paxos instance’s
value to be a description of that Put() or Get(). That instance’s
sequence number determines when the Put() or Get() executes relative
to other Put()s and Get()s. In order to find the value to be returned
by a Get(), kvpaxos should first apply all Put()s that are ordered
before the Get() to its key/value database.

You should think of kvpaxos as using Paxos to implement a “log” of
Put/Get operations. That is, each Paxos instance is a log element, and
the order of operations in the log is the order in which all kvpaxos
servers will apply the operations to their key/value databases. Paxos
will ensure that the kvpaxos servers agree on this order.

Only RPC may be used for interaction between clients and servers,
between different servers, and between different clients. For example,
different instances of your server are not allowed to share Go
variables or files.

Your Paxos-based key/value storage system will have some limitations
that would need to be fixed in order for it to be a serious system. It
won’t cope with crashes, since it stores neither the key/value
database nor the Paxos state on disk. It requires the set of servers to be
fixed, so one cannot replace old servers. Finally, it is slow: many
Paxos messages are exchanged for each Put() and Get(). All of these
problems can be fixed.

You should consult the Paxos lecture notes and the Paxos assigned
reading. For a wider perspective, take a look at Chubby, Paxos Made Live,
Spanner, Zookeeper, Harp, Viewstamped Replication,
and Gaios

Collaboration Policy

Please refer to Assignment 0.

Software

Do a git pull to get the latest assignment software. We supply you
with new skeleton code and new tests in src/paxos and
src/kvpaxos.

1
2
3
4
5
6
7
8
9
10
$ cd ~/4113
$ git pull
...
$ cd src/paxos
$ go test
Single proposer: --- FAIL: TestBasic (5.02 seconds)
       test_test.go:48: too few decided; seq=0 ndecided=0 wanted=3
Forgetting: --- FAIL: TestForget (5.03 seconds) 
       test_test.go:48: too few decided; seq=0 ndecided=0 wanted=6
...

Ignore the huge number of “has wrong number of ins” and “type Paxos
has no exported methods” errors.

Part A: Paxos

First you’ll implement a Paxos library.
paxos.go contains descriptions of the methods you must
implement. When you’re done, you should pass all the tests in the
paxos directory (after ignoring Go’s many complaints):

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
$ cd ~/4113/src/paxos
$ go test
Test: Single proposer ...
 ... Passed
Test: Many proposers, same value ...
 ... Passed
Test: Many proposers, different values ...
 ... Passed
Test: Out-of-order instances ...
 ... Passed
Test: Deaf proposer ...
 ... Passed
Test: Forgetting ...
 ... Passed
Test: Lots of forgetting ...
 ... Passed
Test: Paxos frees forgotten instance memory ...
 ... Passed
Test: Many instances ...
 ... Passed
Test: Minority proposal ignored ...
 ... Passed
Test: Many instances, unreliable RPC ...
 ... Passed
Test: No decision if partitioned ...
 ... Passed
Test: Decision in majority partition ...
 ... Passed
Test: All agree after full heal ...
 ... Passed
Test: One peer switches partitions ...
 ... Passed
Test: One peer switches partitions, unreliable ...
 ... Passed
Test: Many requests, changing partitions ...
 ... Passed
PASS
ok      paxos   59.523s

Your implementation must support this interface:

1
2
3
4
5
6
px = paxos.Make(peers []string, me int)
px.Start(seq int, v interface{}) // start agreement on new instance
px.Status(seq int) (decided bool, v interface{}) // get info about an instance
px.Done(seq int) // ok to forget all instances <= seq
px.Max() int // highest instance seq known, or -1
px.Min() int // instances before this have been forgotten

An application calls Make(peers,me) to create a Paxos peer. The peers
argument contains the ports of all the peers (including this one), and
the me argument is the index of this peer in the peers array.
Start(seq,v) asks Paxos to start agreement on instance seq, with
proposed value v; Start() should return immediately, without waiting
for agreement to complete. The application calls Status(seq) to find
out whether the Paxos peer thinks the instance has reached agreement,
and if so what the agreed value is.
Status() should consult the local Paxos peer’s state and return
immediately; it should not communicate with other peers.
The application may call Status()
for old instances (but see the discussion of Done() below).

Your implementation should be able to make progress on agreement for
multiple instances at the same time. That is, if application peers
call Start() with different sequence numbers at about the same time,
your implementation should run the Paxos protocol concurrently for all
of them. You should not wait for agreement to complete for
instance i before starting the protocol for instance i+1. Each instance
should have its own separate execution of the Paxos protocol.

A long-running Paxos-based server must forget about
instances that are no longer needed, and free the memory
storing information about those instances.
An instance is needed if the
application still wants to be able to call Status() for that instance,
or if another Paxos peer may not yet have reached agreement on that
instance. Your Paxos should implement freeing of instances in the
following way. When a particular peer application will no longer need
to call Status() for any instance <= x, it should call Done(x). That
Paxos peer can’t yet discard the instances, since some other Paxos
peer might not yet have agreed to the instance. So each Paxos peer
should tell each other peer the highest Done argument supplied by its
local application. Each Paxos peer will then have a Done value
from each other peer. It should find the minimum, and discard all
instances with sequence numbers <= that minimum. The Min() method
returns this minimum sequence number plus one.

It’s OK for your Paxos to piggyback the Done value in the agreement
protocol packets; that is, it’s OK for peer P1 to only learn P2’s
latest Done value the next time that P2 sends an agreement message to
P1. If Start() is called with a sequence number less than Min(),
the Start() call should be ignored. If Status() is called with a
sequence number less than Min(), Status() should return false
(indicating no agreement).

Here is Paxos pseudocode (for a single instance):

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30

proposer(v):
 while not decided:
   choose n, unique and higher than any n seen so far
   send prepare(n) to all servers including self
   if prepare_ok(n_a, v_a) from majority:
     v' = v_a with highest n_a; choose own v otherwise
     send accept(n, v') to all
     if accept_ok(n) from majority:
       send decided(v') to all

acceptor's state:
 n_p (highest prepare seen)
 n_a, v_a (highest accept seen)

acceptor's prepare(n) handler:
 if n > n_p
   n_p = n
   reply prepare_ok(n_a, v_a)
 else
   reply prepare_reject

acceptor's accept(n, v) handler:
 if n >= n_p
   n_p = n
   n_a = n
   v_a = v
   reply accept_ok(n)
 else
   reply accept_reject

Here’s a reasonable plan of attack:

  1. Add elements to the Paxos struct in paxos.go to hold the state you’ll need,
    according to the lecture pseudocode. You’ll need to define a struct to hold
    information about each agreement instance.

  2. Define RPC argument/reply type(s) for Paxos protocol messages, based on the
    lecture pseudocode. The RPCs must include the sequence number for the agreement
    instance to which they refer. Remember the field names in the RPC structures must
    start with capital letters.

  3. Write a proposer function that drives the Paxos protocol for an instance, and
    RPC handlers that implement acceptors. Start a proposer function in its own thread
    for each instance, as needed (e.g. in Start()).

  4. At this point you should be able to pass the first few tests.

  5. Now implement forgetting.

Hint: more than one Paxos instance may be executing at a given time,
and they may be Start()’ed and/or decided out of order (e.g. seq 10 may
be decided before seq 5).

Hint: in order to pass tests assuming unreliable network, your paxos
should call the local acceptor through a function call rather than RPC.

Hint: remember that multiple application peers may call Start() on the
same instance, perhaps with different proposed values. An application
may even call Start() for an instance that has already been decided.

Hint: think about how your paxos will forget (discard) information about
old instances before you start writing code. Each Paxos peer will need to
store instance information in some data structure that allows
individual instance records to be deleted (so that the Go garbage
collector can free / re-use the memory).

Hint: you do not need to write code to handle the situation where
a Paxos peer needs to re-start after a crash. If one of your
Paxos peers crashes, it will never be re-started.

Hint: have each Paxos peer start a thread per un-decided instance
whose job is to eventually drive the instance to agreement, by
acting as a proposer.

Hint: a single Paxos peer may be acting simultaneously as acceptor and
proposer for the same instance. Keep these two activities as separate
as possible.

Hint: a proposer needs a way to choose a higher proposal number than
any seen so far. This is a reasonable exception to the rule that
proposer and acceptor should be separate. It may also be useful for the
propose RPC handler to return the highest known proposal number if it
rejects an RPC, to help the caller pick a higher one next time.
The px.me value will be different in each Paxos peer,
so you can use px.me to help ensure that proposal numbers
are unique.

Hint: figure out the minimum number of messages Paxos should use when
reaching agreement in non-failure cases and make your implementation
use that minimum.

Hint: the tester calls Kill() when it wants your Paxos to shut down;
Kill() sets px.dead. You should check px.dead in any loops you have
that might run for a while, and break out of the loop if px.dead is
true. It’s particularly important to do this in any long-running
threads you create.

Part B: Paxos-based Key/Value Server

Now you’ll build kvpaxos, a fault-tolerant key/value storage system.
You’ll modify kvpaxos/client.go,
kvpaxos/common.go, and kvpaxos/server.go.

Your kvpaxos replicas should stay identical; the only exception
is that some replicas may lag others if they are not
reachable. If a replica isn’t reachable for a while, but then starts
being reachable, it should eventually catch up (learn about operations
that it missed).

Your kvpaxos client code should try different replicas it knows about
until one responds. A kvpaxos
replica that is part of a majority of replicas that can all reach each
other should be able to serve client requests.

Your storage system must provide sequential consistency to applications that
use its client interface. That is, completed application calls to the
Clerk.Get(), Clerk.Put(), and Clerk.PutHash() methods in
kvpaxos/client.go must appear to have affected all replicas in the same
order and have at-most-once semantics. A Clerk.Get() should see the value
written by the most recent Clerk.Put() (in that order) to the same key. One
consequence of this is that you must ensure that each application call to
Clerk.Put() must appear in that order just once (i.e., write the key/value
database just once), even though internally your client.go may have to
send Put() and PutHash() RPCs multiple times until it finds a kvpaxos server
replica that replies.

Here’s a reasonable plan:

  1. Fill in the Op struct in server.go with the “value” information that kvpaxos will
    use Paxos to agree on, for each client request. Op field names must start with capital
    letters. You should use Op structs as the agreed-on values – for example, you should
    pass Op structs to Paxos Start(). Go’s RPC can marshall/unmarshall Op structs; the
    call to gob.Register() in StartServer() teaches it how.

  2. Implement the Put() handler in server.go. It should enter a Put Op in the Paxos log
    (i.e., use Paxos to allocate a Paxos instance, whose value includes the key and value
    (so that other kvpaxoses know about the Put())).

  3. Implement a Get() handler. It should enter a Get Op in the Paxos log, and then
    “interpret” the the log before that point to make sure its key/value database reflects
    all recent Put()s.

  4. Add code to cope with duplicate client Put()s – i.e. situations in which Put() in
    client.go sends the same request to multiple kvpaxos replicas. The Put()/PutHash()
    should execute just once.

Hint: your server should try to assign the next available Paxos
instance (sequence number) to each incoming client RPC. However, some
other kvpaxos replica may also be trying to use that instance for a
different client’s operation. So the kvpaxos server has to be prepared
to try different instances.

Hint: your kvpaxos servers should not directly communicate; they
should only interact with each other through the Paxos log.

Hint: as in Assignment 2, you will need to uniquely identify client
operations to ensure that they execute just once.
Also as in Assignment 2, you can assume that each clerk has only one
outstanding Put or Get.

Hint: a kvpaxos server should not complete a Get() RPC if it is not
part of a majority (so that it does not serve stale data). This means
that each Get() (as well as each Put()) must involve Paxos
agreement.

Hint: don’t forget to call the Paxos Done() method when a kvpaxos
has processed an instance and will no longer need it or any
previous instance.

Hint: your code will need to wait for Paxos instances to complete
agreement. The only way to do this is to periodically call Status(),
sleeping between calls. How long to sleep? A good plan is to check
quickly at first, and then more slowly:

1
2
3
4
5
6
7
8
9
10
11
12
to := 10 * time.Millisecond
for {
  decided, _ := kv.px.Status(seq)
  if decided {
    ...
    return 
  }
  time.Sleep(to)
  if to < 10 * time.Second {
    to *= 2
  }
}

Hint: if one of your kvpaxos servers falls behind (i.e. did not
participate in the agreement for some instance), it will later need to
find out what (if anything) was agreed to. A reasonable way to to this
is to call Start(), which will either discover the previously
agreed-to value, or cause agreement to happen. Think about what value
would be reasonable to pass to Start() in this situation.

Hint: When the test fails, check for gob error (e.g. “rpc: writing
response: gob: type not registered for interface …”) in the log because go
doesn’t consider the error fatal, although it is fatal for the assignment.

Handin procedure

You hand in your assignment as before.

For Part A:

1
2
3
4
$ git commit -am "[you fill me in]"
$ git tag -a -m "i finished assignment 3a" a3ahandin
$ git push origin master
$ git push origin a3ahandin

For Part B:

1
2
3
4
$ git commit -am "[you fill me in]"
$ git tag -a -m "i finished assignment 3b" a3bhandin
$ git push origin master
$ git push origin a3bhandin

You should verify that you are able to see your final commit and tags
on the Github page of your repository for this assignment.

You will receive full credit if your software passes the
test_test.go tests when we run your software on our machines.
We will use the timestamp of your last handin tag for the purpose
of calculating late days and we will only grade that version of the code.
(We’ll also know if you backdate the tag, don’t do that.)

Questions

Please post questions on Piazza.

Part A 部分主要是基于Paxos协议的三个阶段进行编写：prepare, accecpt and decide。由于我们的系统是可以同时处理多个请求的，所以对于不同的请求我们用instance进行代表，每一个instance可以有decided或者undecided的状态，我们的paxos协议会使每一个instance最后变成decided状态，每一个instance都储存着操作的结果。
PartB使用我们之前写好的Paxos Library实现Key/Value存储，与作业2相似，我们仍旧需要实现at most once semantic，所以仍现需要每次发出get或者put的时候都一起发出一个sequence unique ID。由于我们的instances中存着操作的结果，所以我们每进行put或者get，都从instance number 0开始进行检查：从0开始检查每一个instanceSeqNum，如果decided(已经有别的操作占用这个instance)，那么将这个操作的结果写入自己的数据库中；如果没有decided，那么将这次的操作占用这个instance并等待所有pvserver同步完成(同步完成也就是decided)。
所以本质上paxos协议(partA)是可以使所有的partition储存相同的信息，partB因为我们要建立有PUT和GET操作的数据库，所以相当于我们存储的相同的信息是这些操作的LOG集合

Follow

Catalogue

×