which shard is a key in? please use this function, and please do not change it.

Make input file

reduceName constructs the name of the intermediate file which map task <mapTask> produces for reduce task <reduceTask>.

schedule() starts and waits for all tasks in the given phase (mapPhase or reducePhase). the mapFiles argument holds the names of the files that are t

several setters, should be called with a lock

spawn ncli clients and wait until they are all done

caller should hold cfg.mu

caller should hold cfg.mu

similar to GenericTest, but with clients doing random operations (and using a linearizability checker)

fetch the current value for a key. returns "" if the key does not exist. keeps trying forever in the face of all other errors. you can send an RPC w

fetch the current value for a key. returns "" if the key does not exist. keeps trying forever in the face of all other errors. You will have to modif

the tester calls Kill() when a ShardMaster instance won't be needed again. you are not required to do anything in Kill(), but it might be convenient

the tester calls Kill() when a KVServer instance won't be needed again. you are not required to do anything in Kill(), but it might be convenient to

shared by Put and Append. you can send an RPC with code like this: ok := ck.servers[i].Call("KVServer.PutAppend", &args, &reply) the types of args

shared by Put and Append. You will have to modify this function.

Save both Raft state and K/V snapshot as a single atomic action, to help avoid them getting out of sync.

Sequential runs map and reduce tasks sequentially, waiting for each task to complete before running the next.

Shutdown a server by isolating it

Maximum snapshot size across all servers

If restart servers, first call ShutdownServer

check that everyone agrees on the term.

should be called with lock

newMaster initializes a new Map/Reduce Master

repartition the servers periodically

run executes a mapreduce job on the given number of mappers and reducers. First, it divides up the input file among the given number of mappers, and

should be called with lock

invoke by Leader to sync snapshot with one follower

timeout = 0 means no timeout if this operation times out, then a false positive is possible

timeout = 0 means no timeout if this operation times out, then a false positive is possible

CleanupFiles removes all intermediate files produced by running mapreduce.

caller should hold cfg.mu

caller should hold cfg.mu

Distributed schedules map and reduce tasks on workers that register with the master over RPC.

the tester calls Kill() when a ShardKV instance won't be needed again. you are not required to do anything in Kill(), but it might be convenient to (

the service or tester wants to create a Raft server. the ports of all the Raft servers (including this one) are in peers[]. this server's port is pee

the tester calls MakeClerk. masters[] is needed to call shardmaster.MakeClerk(). make_end(servername) turns a server name from a Config.Groups[gid]

predict effect of Append(k, val) if old value is prev.

needed by shardkv tester

Shutdown a server by isolating it

servers[] contains the ports of the set of servers that will cooperate via Raft to form the fault-tolerant key/value service. me is the index of the

servers[] contains the ports of the set of servers that will cooperate via Paxos to form the fault-tolerant shardmaster service. me is the index of t

servers[] contains the ports of the servers in this group. me is the index of the current server in servers[]. the k/v server should store snapshot

check that for a specific client all known appends are present in a value, and in order

check that all known appends are present in a value, and are in order for each concurrent client.

warn if the value contains non-default values, as it would if one sent an RPC but the reply struct was already modified. if the RPC reply contains de

check that there's no leader