Yet another Pop Quiz COSC 6360 Fall 2015. The rules On any sheet of paper, please write  You full name, first name first  Today's date  Your answers.

Slides:



Advertisements
Similar presentations
A CASE FOR REDUNDANT ARRAYS OF INEXPENSIVE DISKS (RAID) D. A. Patterson, G. A. Gibson, R. H. Katz University of California, Berkeley.
Advertisements

1 Log-Structured File Systems Hank Levy. 2 Basic Problem Most file systems now have large memory caches (buffers) to hold recently-accessed blocks Most.
Lectures on File Management
 RAID stands for Redundant Array of Independent Disks  A system of arranging multiple disks for redundancy (or performance)  Term first coined in 1987.
Mendel Rosenblum and John K. Ousterhout Presented by Travis Bale 1.
Incentives Build Robustness in BitTorrent Bram Cohen.
Deciding when to forget in the Elephant file system Douglas S. Santry Michael J. Feeley Norman C. Hutchinson Alistair C. Veitch Ross W. Carton Jacob Ofir.
Transport Layer Security (TLS) Protocol Introduction to networks and communications(CS555) Prof : Dr Kurt maly Student:Abhinav y.
1 Deciding When to Forget in the Elephant File System University of British Columbia: Douglas. S. Santry, Michael J. Feeley, Norman C. Hutchinson, Ross.
Digital Signatures and Hash Functions. Digital Signatures.
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.
Network Coding in Peer-to-Peer Networks Presented by Chu Chun Ngai
Sean Traber CS-147 Fall  7.9 RAID  RAID Level 0  RAID Level 1  RAID Level 2  RAID Level 3  RAID Level 4 
Secure Multicast Xun Kang. Content Why need secure Multicast? Secure Group Communications Using Key Graphs Batch Update of Key Trees Reliable Group Rekeying.
Computer ArchitectureFall 2008 © November 12, 2007 Nael Abu-Ghazaleh Lecture 24 Disk IO.
Nasca Internet Ch. 5Internet Ch. 8 Networking and Security Ch. 6 Networking and Security Ch. 8.
Security SIG: Introduction to Tripwire Chris Harwood John Ives.
G Robert Grimm New York University Sprite LFS or Let’s Log Everything.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Emery Berger University of Massachusetts Amherst Operating Systems CMPSCI 377 Lecture.
File System Security Jason Eick and Evan Nelson. What does a file system do? A file system is a method for storing and organizing computer files and the.
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.
Log-Structured File System (LFS) Review Session May 19, 2014.
Lecture 4 Cryptographic Tools (cont) modified from slides of Lawrie Brown.
FIREWALL TECHNOLOGIES Tahani al jehani. Firewall benefits  A firewall functions as a choke point – all traffic in and out must pass through this single.
NovaBACKUP 10 xSP Technical Training By: Nathan Fouarge
Team CMD Distributed Systems Team Report 2 1/17/07 C:\>members Corey Andalora Mike Adams Darren Stanley.
SSH Secure Login Connections over the Internet
Peer-To-Peer Multimedia Streaming Using BitTorrent Purvi Shah, Jehan-François Pâris University of Houston Houston, TX.
Transactions and Reliability. File system components Disk management Naming Reliability  What are the reliability issues in file systems? Security.
Chapter-4 Windows 2000 Professional Win2K Professional provides a very usable interface and was designed for use in the desktop PC. Microsoft server system.
Fine-Grained Access Control (FGAC) in the Cloud Robert Barton.
BitTorrent How it applies to networking. What is BitTorrent P2P file sharing protocol Allows users to distribute large amounts of data without placing.
JOURNALING VERSUS SOFT UPDATES: ASYNCHRONOUS META-DATA PROTECTION IN FILE SYSTEMS Margo I. Seltzer, Harvard Gregory R. Ganger, CMU M. Kirk McKusick Keith.
THE DESIGN AND IMPLEMENTATION OF A LOG-STRUCTURED FILE SYSTEM M. Rosenblum and J. K. Ousterhout University of California, Berkeley.
The protection of the DB against intentional or unintentional threats using computer-based or non- computer-based controls. Database Security – Part 2.
Module 3 – Cryptography Cryptography basics Ciphers Symmetric Key Algorithms Public Key Algorithms Message Digests Digital Signatures.
Log-structured File System Sriram Govindan
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
Log-Structured File Systems
CS 153 Design of Operating Systems Spring 2015 Lecture 22: File system optimizations.
COSC 513 Operating Systems Project Presentation: Internet Security Instructor: Dr. Anvari Student: Ying Zhou Spring 2003.
WSV Problem Background 3. Accelerated Protocols and Workloads 4. Deployment and Management 2. BranchCache Solution Modes 5. BranchCache Protocols.
Computer Science Lecture 19, page 1 CS677: Distributed OS Last Class: Fault tolerance Reliable communication –One-one communication –One-many communication.
Embedded System Lab. 서동화 The Design and Implementation of a Log-Structured File System - Mendel Rosenblum and John K. Ousterhout.
COSC 3330/6308 Solutions to the Third Problem Set Jehan-François Pâris November 2012.
Solutions for the First Quiz COSC 6360 Spring 2014.
Solution to the Third COSC 6360 Quiz for Fall 2013 Jehan-François Pâris
Lecture 21 LFS. VSFS FFS fsck journaling SBDISBDISBDI Group 1Group 2Group N…Journal.
Outline for Today Journaling vs. Soft Updates Administrative.
Project: Simulated Encrypted File System (SEFS) Omar Chowdhury Fall 2015CS526: Information Security1.
CIT 380: Securing Computer SystemsSlide #1 CIT 380: Securing Computer Systems Web Security.
Dan Boneh Introduction Course Overview Online Cryptography Course Dan Boneh.
Solutions for the First Quiz COSC 6360 Fall 2014.
Hashes Lesson Introduction ●The birthday paradox and length of hash ●Secure hash function ●HMAC.
JOURNALING VERSUS SOFT UPDATES: ASYNCHRONOUS META-DATA PROTECTION IN FILE SYSTEMS Margo I. Seltzer, Harvard Gregory R. Ganger, CMU M. Kirk McKusick Keith.
Solutions for the Fourth Problem Set COSC 6360 Fall 2014.
Embedded System Lab. 정영진 The Design and Implementation of a Log-Structured File System Mendel Rosenblum and John K. Ousterhout ACM Transactions.
Computer Science Lecture 19, page 1 CS677: Distributed OS Last Class: Fault tolerance Reliable communication –One-one communication –One-many communication.
RAID TECHNOLOGY RASHMI ACHARYA CSE(A) RG NO
@Yuan Xue 285: Network Security CS 285 Network Security Message Authentication Code Data integrity + Source authentication.
Sarah Diesburg Operating Systems CS 3430
First Pop Quiz Answers COSC 6360 Fall 2017.
Sarah Diesburg Operating Systems CS 3430
Solutions for the Third Problem Set
Solutions for Third Quiz
Solutions for Third Quiz
Presentation transcript:

Yet another Pop Quiz COSC 6360 Fall 2015

The rules On any sheet of paper, please write  You full name, first name first  Today's date  Your answers to the five true or false questions on a single line as: TTTFT  You can erase or overwrite previous answers but your final answer should contain no corrections

T/F questions on log-structured file systems (LFS) FFS and other non log-structured file systems maintain no i-node map. LFS maintains its i-node map at a fixed location. When a computer is shut down properly, all the information required to access its LFS can be found at the last file checkpoint. A LFS will recover faster from a system crash than a conventional file system. When a LFS has to make space, it should clean up first disk segments that were recently used.

Answers FFS and other non log-structured file systems maintain no i-node map. LFS maintains its i-node map at a fixed location. When a computer is shut down properly, all the information required to access its LFS can be found at the last file checkpoint. A LFS will recover faster from a system crash than a conventional file system. When a LFS has to make space, it should clean up first disk segments that were recently used.

T/F questions on RAID If the mean time to failure of an individual disk is 100,000 hours then the mean time to failure of an 100-disk array is 1,000 hours The space overhead of a RAID level 5 array with ten disks is 20 percent. The minimum cost of a single block update in a RAID level 5 array is one read and two writes RAID level 6 arrays protect their data against all triple disk failures within the array RAID level 5 uses an omission correction code.

The answers If the mean time to failure of an individual disk is 100,000 hours then the mean time to failure of a one hundred disk array is 1,000 hours. The space overhead of a RAID level 5 array with ten disks is 20 percent. The minimum cost of a single block update in a RAID level 5 array is one read and two writes. RAID level 6 arrays protect their data against all triple disk failures within the array. RAID level 5 uses an omission correction code. TFTFT

T/F questions on Video Streaming BitTorrent ensures that all peers receive the contents of the files they download in sequence The best chunk selection policy for video streaming is selecting the rarest chunk(s) within the current sliding window. Larger sliding windows imply a longer wait for the service users When a new user starts streaming a file, it has nothing to offer to other peers P2P solutions cannot handle flash crowds

The answers BitTorrent ensures that all peers receive the contents of the files they download in sequence The best chunk selection policy for video streaming is selecting the rarest chunk(s) within the current sliding window. Larger sliding windows imply a longer wait for the service users When a new user starts streaming a file, it has nothing to offer to other peers P2P solutions cannot handle flash crowds FTTTF

T/F questions about SSH SSH uses secret key/public key for encrypting all communications between users and servers. SSH servers have two secret key/public key pairs. One of these keys changes every week. SSH offers no way to authenticate a server the first time you connect to it. SHA stands for Secure Hash Algorithm

The answers SSH uses secret key/public key for encrypting all communications between users and servers. SSH servers have two secret key/public key pairs. One of these keys changes every week. SSH offers no way to authenticate a server the first time you connect to it. SHA stands for Secure Hash Algorithm. FTFTT