SDFS is intended to be scalable as the number of servers increases. Data stored in SDFS is tolerant up to three machine failures at a time. After failure(s), you must ensure that data is re-replicated quickly so that another (set of) failures that happens soon after is tolerated (you can assume enough time elapses for the system to quiesce before the next failure(s) occur(s)). Store the minimum number of replicas of each file needed to meet this feature. Don’t over-replicate.
SDFS is a flat file system, i.e., it has no concept of directories, although filenames are allowed to contain slashes.
Thus, the allowed file ops include: 1) put localfilename sdfsfilename
(from local dir), 2) get sdfsfilename localfilename (fetches to local dir),
delete sdfsfilename. Put is used to both insert the original file and update it (updates are comprehensive, i.e., they send the entire file, not just a block of it).
For demo purposes you will need to add two more operations: 4) ls sdfsfilename: list all machine (VM) addresses where this file is currently being stored; 5) store: At any machine, list all files currently being stored at this machine. Here sdfsfilename is an arbitrary string while localfilename is the Unix-style local file system name.
Mandatory: SDFS provides fast time-bounded write-write conflicts. This implies some design decisions that are mandatory and others that you are free to choose. Mandatory requirements include:
To make writes and reads fast, you should use a quorum to handle writes
(put’s except the first put, because that’s an insert) and reads. Quorum can be a majority.
Further (write-write conflicts), if two updates (puts) to one file are initiated within 1 minute of each other, the user doing the second file update should be prompted to confirm whether she really wants to push that file update. (If there is a sequence of such writes to the same file, with < 1 minute gap between consecutive updates, all except the first update must request confirmation from the user). Confirmation can be given at the command prompt, and must timeout (rejecting the update) if not confirmed within 30 seconds of the confirmation message
If a node fails and rejoins, ensure that it wipes all file blocks/replicas it is storing before it rejoins. Think about all failure scenarios carefully and ensure your system does not hang. For instance, what if a node sends a write and then fails before the confirmation or after receiving the confirmation notice but before responding? Work out these failure scenarios and ensure you handle them all.
Other parts of the design are open, and you are free to choose. Keep your design the simplest possible to accomplish the goals, but also make it fast. Here is a first cut way to structure your design. One of the servers should be the master server. The master is responsible for deciding which files get stored where. All queries and operations can go through the master. If the master fails, a new master should be re-elected quickly. While there is no master, the system should not lose data or crash – however, file operations may not be possible while the master is down. Is this design enough to tolerate two simultaneous machine failures? No! Modify it so that it satisfies all the requirements!
Think about design possibilities: should you replicate an entire file, or shard (split) it and replicate each shard separately? How do you do election? How does replication work – is it active replication or passive replication? How are reads processed? Can you make reads/queries efficient by using caching? How exactly does your protocol leverage MP2’s membership list? What does a quorum mean and how do you select it? Don’t go overboard, but please keep it simple.
As usual, don’t overdesign or overkill for the spec. YoureFired! Inc. is watching – if you have a complicated design that is an overkill, they will shoot you (with a camera and then put you on Instagram).
Create logs at each machine. You can make your logs as verbose as you want them, but at the least you must log each time a file operation is processed locally. We will request to see the log entries at demo time, perhaps via the MP1’s querier.
Use your MP2 code to maintain membership lists across machines.
You should also use your MP1 solution for debugging MP3 (and mention how useful this was in the report).
We also recommend (but don’t require) writing unit tests for the basic file operations. At the least, ensure that these actually work for a long series of file operations.
Machines: We will be using the CS VM Cluster machines. You will be using 7-10 VMs for the demo. The VMs do not have persistent storage, so you are required to use git to manage your code. To access git from the VMs, use the same instructions as MP1.
Demo: Demos are usually scheduled on the Monday right after the MP is due. The demos will be on the CS VM Cluster machines. You must use 7-10 VMs for your demo (details will be posted on Piazza closer to the demo date). Please make sure your code runs on the CS VM Cluster machines, especially if you’ve used your own machines/laptops to do most of your coding. Please make sure that any third party code you use is installable on CS VM Cluster. Further demo details and a signup sheet will be made available closer to the date.
Language: Choose your favorite language! We recommend C/C++/Java/Go. We will release “Best MPs” from the class in these languages only (so you can use them in subsequent MPs).
Report: Write a report of less than 2 pages (12 pt font, typed only - no handwritten reports please!). Briefly describe your design (algorithm used and replication strategy), very briefly how useful MP1 was for debugging MP3, and the following measurements (not calculations!): (i) re-replication time and bandwidth (Bps not messages per sec) upon a failure (you can measure for a 40 MB file); (ii) times to insert, read, and update, file of size 25 MB, 500 MB (6 total data points), under no failure; and (iii) time to store the entire English Wikipedia corpus into SDFS with 4 machines and 8 machines (not counting the master): use the Wikipedia English (raw text) link at: http://www.cs.upc.edu/~nlp/wikicorpus/ . For each data point, run at least 5 trials and give the average and standard deviation bars. Discuss your plots, don’t just put them on paper, i.e., discuss trends, and whether they are what you expect or not (why or why not). (Measurement numbers don’t lie, but we need to make sense of them!). Stay within page limits.
Submission: There will be a demo of each group’s project code. Submit your report (softcopy) as well as working code. Please include a README explaining how to compile and run your code. Submission instructions are similar to MP2.
When should I start? Start NOW. This MP involves a significant amount of planning, design, and implementation/debugging/experimentation work. Do not leave all the work for the days before the deadline – there will be no extensions.
DescriptionIn this final assignment, the students will demonstrate their ability to apply two majorconstructs of the C programming language – Fu
Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t
Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th
1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of
1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of