Cis 505 Assignment 4 Services In Your Area

CIS 505: Software Systems (Spring 2018)

Overview

This course provides an introduction to fundamental concepts of distributed systems, and the design principles for building large-scale computational systems.

We will study some of the key building blocks – such as synchronization primitives, group communication protocols, and replication techniques – that form the foundation of modern distributed systems, such as cloud-computing platforms or the Internet. We will also look at some real-world examples of distributed systems, such as GFS, MapReduce, Spark, and Dynamo, and we will gain some hands-on experience with building and running distributed systems.

CIS 505 is one of the core courses in the MSE and EMBS programs, and its final exam qualifies as one of the four WPE-I exams in the PhD program.

Logistics

Instructor:
Linh Thi Xuan Phan
Office hours: Wednesdays 1:00-2:00pm (Levine 464)

When and where:
MW 4:30-6:00pm, TOWNE 100

Teaching assistants:

Sarvesh Surana
Office hours: Mondays 2:00-3:30pm
Location: Levine 6th floor bump space

Xiaozhou Pu
Office hours: Mondays 3:00-4:00pm
Location: Levine 5th floor bump space

Krishna Bharathala
Office hours: Tuesdays 1:30-2:30pm
Location: Levine 6th floor bump space

Juncheng Chen
Office hours: Tuesdays 4:00-5:00pm
Location: Levine 6th floor bump space

Alexander Thurston
Office hours: Wednesdays 9:30-10:30am
Location: Levine 5th floor bump space

Oshin Agarwal
Office hours: Wednesdays 3:00-4:00pm
Location: Levine 5th floor bump space

Devesh Dayal
Office hours: Thursdays 12:00-1:30pm
Location: Levine 6th floor bump space

Natasha Narang
Office hours: Thursdays 1:30-2:30pm
Location: Levine 6th floor bump space

Jacob Kahn
Office hours: Thursdays 2:00-3:00pm
Location: Levine 5th floor bump space

Nikheel Savant
Office hours: Fridays 2:00-3:00pm
Location: Levine 6th floor bump space

Saeed Abedi
Office hours: Fridays 3:00-4:00pm
Location: Levine 6th floor bump space

Thomas Greening
Office hours: Fridays 4:00-5:00pm
Location: Levine 5th floor bump space


Course policies

Course textbook:
Distributed Systems: Principles and Paradigms, 3rd edition (by M. van Steen and A. Tanenbaum; ISBN 978-1543057386). You can get a digital version of this book for free; hardcopies are available, e.g., from Amazon. Additional material will be drawn from selected research publications.

Prerequisites:
Either undergraduate networking or operating systems is required. You should also be comfortable with programming in C/C++.

Workload:
The course will involve three substantial programming assignments, a group project, a midterm, and a final examination.

Grading:
Your letter grade will be based on the programming assignments (30%), the group project (25%), the midterm exam (15%), the final exam (25%), and your participation (5%).

Resources

We will be using Piazza for all course-related discussions.

Homework assignments and project are available for download; you can submit your solution online. If necessary, you can request an extension for your homeworks.

PennCloud Award


Bhairavi Mehta, Sarvesh Surana, Animesh Shah, Mihir Pattani, and Swathi Rajanna.

Example services of the best PennCloud platform.

The Fall 2017 PennCloud Award went to Bhairavi Mehta, Mihir Pattani, Swathi Rajanna, Animesh Shah, and Sarvesh Surana for the best final project. The team presented a solid cloud platform with a highly scalable, fault-tolerant key-value datastore at the backend that supports strong consistency and efficient replication, checkpointing and recovery. The platform offers a diverse set of services that are rich in features, such as a webmail service that supports remote users, email attachments, mail folders, and address books; a storage service that supports uploading, downloading, sharing of large files in any format; one-to-one and group chat service with FIFO ordering semantics; among others.

Schedule (tentative)

DateTopicDetailsReadingRemarks
Jan 10IntroductionCourse overview
Policies
Chapter 1 
Jan 15No class (Martin Luther King, Jr. Day)HW0
Jan 17Processes and threadsBasic concepts
The UNIX model
Implementation in the kernel
Chapter 3.1 (Sections 1+2) 
Jan 22System callsSystem calls
The file API
Kernel entry/exit
 HW0 due; HW1
Jan 24Concurrency controlSynchronization primitives
Race conditions, critical sections
Deadlock and starvation
  
Jan 29SynchronizationSemaphores
Classical synchronization problems
Monitors and condition variables
  
Jan 31CommunicationSockets
Socket programming
Handling multiple connections
Chapters 4.1+4.3 + 3.1 (Section 3) 
Feb 5+7Remote Procedure CallsProgramming model
Stub code; marshalling; binding
Handling failures
Chapters 4.2+8.3HW1 due; HW2
Feb 12 NamingKinds of names; name spaces
The Domain Name System
LDAP
Chapter 5 
Feb 14Clock synchronizationLogical clocks
Distributed mutual exclusion
NTP
Chapters 6.1–6.3 
Feb 16Last day to dropHW2MS1 due
Feb 19Distributed coordinationDistributed mutual exclusion
Leader election
Bully algorithm; token ring
Chapter 6.4 
Feb 21Group communicationReliable multicast
IP multicast
FIFO, causal and total ordering
Chapter 8.4 
Feb 26Class is canceled – Linh is at NSF Meeting 
Feb 28Midterm The midterm exam will cover topics from the first lecture
Mar 3–11Spring breakHW2MS2+3 due (on 3/7)
Mar 12Group communication (cont.)Algorithms for FIFO, causal and total orderingChapter 8.4HW3
Mar 14ReplicationPrimary/backup protocols
Quorum protocols
Sequential and causal consistency
Client-centric models
Chapter 7Project
Mar 19Bigtable and ProjectBigtable case study
Project overview
[Bigtable] 
Mar 21Fault tolerance2PC and 3PC
Logging and recovery
Chandy-Lamport algorithm
Chapters 8.5+8.6 
Mar 26State-machine replicationFailure models
The Consensus problem
Paxos
Chapters 8.1+8.2; [Paxos]HW3 due (on 3/27)
Mar 28Non-crash Fault ToleranceThe Byzantine Generals problem
Impossibility results
Solutions
[BFT] 
Mar 30Last day to withdraw
Apr 2File systemsFile operations; name space
Data structures on disk
Space management
  
Apr 4Distributed file systemsNFS
Coda
Disconnected operation
Chapter 2.4.2; [Coda] 
Apr 9Google File SystemGoogle cluster architecture
Reading and writing in GFS
Consistency and fault tolerance
[Cluster] [GFS] 
Apr 11Class is canceled – Linh is at CPSWeek
Apr 16MapReduceMapReduce programming model
System architecture
[MapReduce] 
Apr 18SparkDifferences to MapReduce
RDDs
Case study: PageRank
[Spark] 
Apr 23DHTs and DynamoDistributed hash tables
The CAP dilemma
Amazon Dynamo
[Dynamo] 
Apr 25Special topics and Exam reviewTBA  
Apr 26–27Reading days
May 2Final Exam (6-8pm) The final exam will cover all topics, from Jan 10 through Apr 25
Apr 30–May 8Project demos and reports

REQUIREMENTS FOR THE CORPORATE COMPUTING FUNCTION Assignment 2: Requirements for the Corporate Computing Function Abstract The requirements for the corporate computing function are needs that the computing facility must fulfill. The new corporate CIO has devised a nine-point mission statement for the company. The nine points are: 1. Provide computing capability to all organizational units that legitimately require it. 2. Contain the capital and operations cost in provision of computing services within the organization. 3. Satisfy special computing needs of user departments. 4. Maintain organizational integrity in operations that are dependent on computing (i.e., avoid mismatches in operation among departments). 5. Meet information requirements of management. 6. Provide computing services in a reliable, professional, and technically competent manner. 7. Allow organizational units sufficient autonomy in the conduct of their tasks to optimize creativity and performance at the unit level. 8. Preserve autonomy among organizational units and, if possible, increase their importance and influence within the larger organization. 9. Make the work of employees enjoyable as well as productive. This paper will answer key questions regarding these requirements and the CIO’s three-phase rollout plan.

0 thoughts on “Cis 505 Assignment 4 Services In Your Area”

    -->

Leave a Comment

Your email address will not be published. Required fields are marked *