Solutions for Third Quiz

Slides:



Advertisements
Similar presentations
Mendel Rosenblum and John K. Ousterhout Presented by Travis Bale 1.
Advertisements

The Zebra Striped Network Filesystem. Approach Increase throughput, reliability by striping file data across multiple servers Data from each client is.
The Zebra Striped Network File System Presentation by Joseph Thompson.
Serverless Network File Systems. Network File Systems Allow sharing among independent file systems in a transparent manner Mounting a remote directory.
11-May-15CSE 542: Operating Systems1 File system trace papers The Zebra striped network file system. Hartman, J. H. and Ousterhout, J. K. SOSP '93. (ACM.
G Robert Grimm New York University Sprite LFS or Let’s Log Everything.
The design and implementation of a log-structured file system The design and implementation of a log-structured file system M. Rosenblum and J.K. Ousterhout.
G Robert Grimm New York University Sprite LFS or Let’s Log Everything.
1 Distributed Systems: Distributed Process Management – Process Migration.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Emery Berger University of Massachusetts Amherst Operating Systems CMPSCI 377 Lecture.
THE DESIGN AND IMPLEMENTATION OF A LOG-STRUCTURED FILE SYSTEM M. Rosenblum and J. K. Ousterhout University of California, Berkeley.
The Design and Implementation of a Log-Structured File System Presented by Carl Yao.
Redundant Array of Independent Disks
Parity Logging O vercoming the Small Write Problem in Redundant Disk Arrays Daniel Stodolsky Garth Gibson Mark Holland.
Problems discussed in the review session for the final COSC 4330/6310 Summer 2012.
THE DESIGN AND IMPLEMENTATION OF A LOG-STRUCTURED FILE SYSTEM M. Rosenblum and J. K. Ousterhout University of California, Berkeley.
The Design and Implementation of Log-Structure File System M. Rosenblum and J. Ousterhout.
26-Oct-15CSE 542: Operating Systems1 File system trace papers The Design and Implementation of a Log- Structured File System. M. Rosenblum, and J.K. Ousterhout.
Chapter VIIII File Systems Review Questions and Problems Jehan-François Pâris
Serverless Network File Systems Overview by Joseph Thompson.
SPECULATIVE EXECUTION IN A DISTRIBUTED FILE SYSTEM E. B. Nightingale P. M. Chen J. Flint University of Michigan.
CS 153 Design of Operating Systems Spring 2015 Lecture 22: File system optimizations.
COSC 3330/6308 Solutions to the Third Problem Set Jehan-François Pâris November 2012.
Solution to the Third COSC 6360 Quiz for Fall 2013 Jehan-François Pâris
Yet another Pop Quiz COSC 6360 Fall The rules On any sheet of paper, please write  You full name, first name first  Today's date  Your answers.
Introduction to Information Retrieval Introduction to Information Retrieval Lecture 4: Index Construction Related to Chapter 4:
Example 1 Writing Powers Write the product as a power and describe it in words. a. 44= to the second power, or 4 squared 9 to the third power,
Solution to the Second COSC 6360 Quiz for Fall 2013 Jehan-François Pâris
Week 10 March 10, 2004 Adrienne Noble. Important Dates Project 4 due tomorrow (Friday) Final Exam on Tuesday, March 16, 2:30- 4:20pm.
A Classification for Access Control List To Speed Up Packet-Filtering Firewall CHEN FAN, LONG TAN, RAWAD FELIMBAN and ABDELSHAKOUR ABUZNEID Department.
Network-Attached Storage. Network-attached storage devices Attached to a local area network, generally an Ethernet-based network environment.
Solutions for Fourth Quiz COSC 6360 Fall First question What do we mean when we say that NFS client requests are: (2×10 pts)  self-contained? 
CS Introduction to Operating Systems
File System Consistency
Lecture XV: Real P2P Systems
The Design and Implementation of a Log-Structured File System
Transactions and Reliability
RAID Redundant Arrays of Independent Disks
FileSystems.
Solutions for Fourth Quiz
Solutions for Second Quiz
First Pop Quiz Answers COSC 6360 Fall 2017.
Local secondary storage (local disks)
Solution to the Fourth COSC 6360 Quiz for Fall 2013
RAID RAID Mukesh N Tekwani
ICOM 6005 – Database Management Systems Design
Lecture 20 LFS.
CSE 153 Design of Operating Systems Winter 2018
Printed on Monday, December 31, 2018 at 2:03 PM.
UNIT IV RAID.
Log-Structured File Systems
File-System Structure
M. Rosenblum and J.K. Ousterhout The design and implementation of a log-structured file system Proceedings of the 13th ACM Symposium on Operating.
Log-Structured File Systems
Solutions for the Third Problem Set
Solutions for Third Quiz
Ms. Lindsey’s Kindergarten Class 11/1/16
Questions on Fifth Quiz
CSE 153 Design of Operating Systems Winter 2019
Chapter VIIII File Systems Review Questions and Problems
Outline Review of Quiz #1 Distributed File Systems 4/20/2019 COP5611.
Log-Structured File Systems
RAID RAID Mukesh N Tekwani April 23, 2019
File System Implementation
Solutions to the Second Quiz
Department of Computer Science
File System Performance
Log-Structured File Systems
The Design and Implementation of a Log-Structured File System
Presentation transcript:

Solutions for Third Quiz COSC 6360 Fall 2015

First question How does SSH authenticate a new server? Is this process as secure as it should?

First question How does SSH authenticate a new server? When the client contacts a server, the server replies with its public host key and its public server key. Client then decides to accept or reject these keys Is this process as secure as it should?

First question How does SSH authenticate a new server? When client contacts a server, the server replies with its public host key and its public server key. Client decides to accept or reject these keys Is this process as secure as it should? No because clients rarely have the way to check the keys' authenticity

Second question Which steps will be taken by the Sprite LFS to retrieve a specific i-node when the system reboots after having been properly closed?

Second question Which steps will be taken by the Sprite LFS to retrieve a specific i-node when the system reboots after having been properly closed? Access checkpoint area to get addresses of blocks of i-node map Access i-node map to get address of the i-node

Third question What is the cost of a write in the Sprite LFS system, when its segment cleaner has to clean four segments to produce two clean segments?

Third question What is the cost of a write in the Sprite LFS system, when its segment cleaner has to clean five segments to produce two clean segments? Compute first segment utilization U = (4 – 3)/4 = 0.75 Apply formula 2/(1-U) = 2/0.25 = 8

Fourth question According to Shah and Pâris, how should we modify BitTorrent tit-for-tat policy to let peers participate sooner in the video distribution?

Fourth question According to Shah and Pâris, how should we modify BitTorrent tit-for-tat policy to let peers participate sooner in the video distribution? They proposed "a new randomized tit-for-tat peer selection policy that gives free tries to a larger number of peers and lets them participate sooner in the media distribution."

Fifth question What are the main advantage and the main disadvantage of using journaling with asynchronous log updates compared to using journaling with synchronous log updates?

Fifth question What are the main advantage and the main disadvantage of using journaling with asynchronous log updates compared to using journaling with synchronous log updates? Main advantage: They are faster

Fifth question What are the main advantage and the main disadvantage of using journaling with asynchronous log updates compared to using journaling with synchronous log updates?) Main advantage: They are faster Main disadvantage: They do not guarantee the durability of updates

Sixth question What is the main motivation for tailpacking in journaling file systems?

Sixth question What is the main motivation for tailpacking in journaling file systems? To save disk space by reducing internal fragmentation

Seventh question Consider a RAID level 6 disk array with ten disks? How much of the total disk space is occupied by parity information? Assume that we have to update a single data block in the array and already know the old value of the block being updated. How many disk reads and disk writes will be required to perform the update?

Seventh question Consider a RAID level 6 disk array with ten disks? How much of the total disk space is occupied by parity information? Each parity stripe will have ten disks Eight of them will hold data Two of them parity information Twenty percent

Seventh question Consider a RAID level 6 disk array with ten disks. Assume that we have to update a single data block in the array and already know the old value of the block being updated. How many disk reads and disk writes will be required to perform the update?

The RAID level 6 array Equivalents of eight data disks Parity

We update

Seventh question We will need to write to disk the new values of The modified block B' The modified parity blocks P' and Q' for a total of three writes We already have in memory the old value B of the block but need to read in The old values P and Q of the two parity blocks that is, two reads