Cloud Computing Concepts, Part 1
Description
When you enroll for courses through Coursera you get to choose for a paid plan or for a free plan .
- Free plan: No certicification and/or audit only. You will have access to all course materials except graded items.
- Paid plan: Commit to earning a Certificate—it's a trusted, shareable way to showcase your new skills.
About this course: Cloud computing systems today, whether open-source or used inside companies, are built using a common set of core techniques, algorithms, and design philosophies – all centered around distributed systems. Learn about such fundamental distributed computing "concepts" for cloud computing. Some of these concepts include: clouds, MapReduce, key-value/NoSQL stores, classical distributed algorithms, widely-used distributed algorithms, scalability, trending areas, and much, much more! Know how these systems work from the inside out. Get your hands dirty using these concepts with provided homework exercises. In the programming assignments, implement some of these concepts in …
![](https://static-4.springest.com/uploads/product_image/image/7020/nano-cloud_computing_concepts_part_02_v03_600X340.jpg)
Frequently asked questions
There are no frequently asked questions yet. If you have any more questions or need help, contact our customer service.
When you enroll for courses through Coursera you get to choose for a paid plan or for a free plan .
- Free plan: No certicification and/or audit only. You will have access to all course materials except graded items.
- Paid plan: Commit to earning a Certificate—it's a trusted, shareable way to showcase your new skills.
About this course: Cloud computing systems today, whether open-source or used inside companies, are built using a common set of core techniques, algorithms, and design philosophies – all centered around distributed systems. Learn about such fundamental distributed computing "concepts" for cloud computing. Some of these concepts include: clouds, MapReduce, key-value/NoSQL stores, classical distributed algorithms, widely-used distributed algorithms, scalability, trending areas, and much, much more! Know how these systems work from the inside out. Get your hands dirty using these concepts with provided homework exercises. In the programming assignments, implement some of these concepts in template code (programs) provided in the C++ programming language. Prior experience with C++ is required. The course also features interviews with leading researchers and managers, from both industry and academia.
Who is this class for: Who this class is for: This course is intended for students with similar backgrounds as junior or senior undergraduates in computer science. This course will teach you basic algorithmic and design concepts for distributed systems, as used in today’s cloud systems. Much of the course, including quizzes, is conceptual and not programming oriented. The programming assignment assumes some knowledge of C++ (if you have only Java experience, you should be able to pick up C++ quickly may suffice), and allow you to write distributed algorithms in an emulated distributed system on your own machine. To ensure you have the necessary prerequisites, you need to take the prerequisite quiz and achieve a high passing score (at least 90%, preferably 100%). Based on prior student experiences, the Linux/Unix environment may work better for the programming assignments than Windows. Who this class is NOT for: This course is NOT intended for those: (1) wishing to get a high level overview of cloud computing (you can use Wikipedia for that); (2) wishing to do detailed programming in a real cloud (the Cloud Capstone and Cloud Applications MOOCs provide you that); (3) who are averse to theoretical and algorithmic concepts; (4) with little or no prior programming experience in C++ or Java; (5) who expect to see industry-quality code in programming assignments (these are play programming assignments focused on allowing you to implement concepts you learn from lectures, and are not intended for immediate deployment); (6) those not familiar with setting up IDEs/compilers, etc., especially for C++; or (7) those who want to rush through lectures and/or videos and attempt quizzes in haste (quizzes are hard, so make sure you view lectures completely and comprehensively before attempting quizzes).
Created by: University of Illinois at Urbana-Champaign-
Taught by: Indranil Gupta, Associate Professor
Department of Computer Science
Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.
Help from your peersConnect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.
CertificatesEarn official recognition for your work, and share your success with friends, colleagues, and employers.
University of Illinois at Urbana-Champaign The University of Illinois at Urbana-Champaign is a world leader in research, teaching and public engagement, distinguished by the breadth of its programs, broad academic excellence, and internationally renowned faculty and alumni. Illinois serves the world by creating knowledge, preparing students for lives of impact, and finding solutions to critical societal needs.Syllabus
WEEK 1
Week 1: Orientation, Introduction to Clouds, MapReduce
This course is oriented towards learners with similar backgrounds as juniors and seniors in a CS undergraduate curriculum. Since learners come from various backgrounds, it is critical you view this lecture AND pass the prerequisite test. This will ensure you have many of the assumed prerequisite pieces of knowledge required to enjoy this course.
16 videos, 8 readings, 2 practice quizzes expand
- Reading: Orientation Overview
- Video: Introduction to Cloud Computing Concepts, Part 1
- Reading: Syllabus
- Reading: About the Discussion Forums
- Practice Quiz: Orientation Quiz
- Video: Orientation Towards Cloud Computing Concepts: Some Basic Computer Science Fundamentals
- Reading: Instructions for Taking the Prerequisite Quiz
- Practice Quiz: Prerequisite Quiz
- Discussion Prompt: Getting to Know Your Classmates
- Reading: Course Learning Community and Social Media
- Reading: Week 1 Overview
- Video: Week 1 Introduction
- Video: 1.1. Why Clouds?
- Video: 1.2. What is a Cloud?
- Video: 1.3. Introduction to Clouds: History
- Video: 1.4. Introduction to Clouds: What's New in Today's Clouds
- Video: 1.5. Introduction to Clouds: New Aspects of Clouds
- Video: 1.6. Introduction to Clouds: Economics of Clouds
- Video: 2.1. A cloud IS a distributed system
- Video: 2.2. What is a distributed system?
- Video: 3.1. MapReduce Paradigm
- Video: 3.2. MapReduce Examples
- Video: 3.3. MapReduce Scheduling
- Video: 3.4. MapReduce Fault-Tolerance
- Video: Interview with Sumeet Singh
- Reading: Homework 1 Instructions
- Discussion Prompt: Homework 1 Discussion
- Reading: Programming Assignment Instructions
Graded: Homework 1
WEEK 2
Week 2: Gossip, Membership, and Grids
Lesson 1: This module teaches how the multicast problem is solved by using epidemic/gossip protocols. It also teaches analysis of such protocols. Lesson 2: This module covers the design of failure detectors, a key component in any distributed system. Membership protocols, which use failure detectors as components, are also covered. Lesson 3: This module covers Grid computing, an important precursor to cloud computing.
14 videos, 2 readings expand
- Reading: Week 2 Overview
- Video: Week 2 Introduction
- Video: 1.1. Multicast Problem
- Video: 1.2. The Gossip Protocol
- Video: 1.3. Gossip Analysis
- Video: 1.4. Gossip Implementations
- Video: 2.1. What is Group Membership List?
- Video: 2.2. Failure Detectors
- Video: 2.3. Gossip-Style Membership
- Video: 2.4. Which is the best failure detector?
- Video: 2.5. Another Probabilistic Failure Detector
- Video: 2.6. Dissemination and suspicion
- Video: 3.1. Grid Applications
- Video: 3.2. Grid Infrastucture
- Video: Interview with William Gropp
- Reading: Homework 2 Instructions
- Discussion Prompt: Homework 2 Discussion
Graded: Homework 2
WEEK 3
Week 3: P2P Systems
P2P systems: This module teaches the detailed design of two classes of peer to peer systems: (a) popular ones including Napster, Gnutella, FastTrack, and BitTorrent; and (b) efficient ones including distributed hash tables (Chord, Pastry, and Kelips). Besides focusing on design, the module also analyzes these systems in detail.
10 videos, 2 readings expand
- Reading: Week 3 Overview
- Video: Week 3 Introduction
- Video: 1. P2P Systems Introduction
- Video: 2. Napster
- Video: 3. Gnutella
- Video: 4. FastTrack and BitTorrent
- Video: 5. Chord
- Video: 6. Failures in Chord
- Video: 7. Pastry
- Video: 8. Kelips
- Video: Blue Waters Supercomputer
- Reading: Homework 3 Instructions
- Discussion Prompt: Homework 3 Discussion
Graded: Homework 3
WEEK 4
Week 4: Key-Value Stores, Time, and Ordering
Lesson 1: This module motivates and teaches the design of key-value/NoSQL storage/database systems. We cover the design of two major industry systems: Apache Cassandra and HBase. We also cover the famous CAP theorem. Lesson 2: Distributed systems are asynchronous, which makes clocks at different machines hard to synchronize. This module first covers various clock synchronization algorithms, and then covers ways of tagging events with causal timestamps that avoid synchronizing clocks. These classical algorithms were invented decades ago, yet are used widely in today’s cloud systems.
12 videos, 3 readings expand
- Reading: Week 4 Overview
- Video: Week 4 Introduction
- Video: 1.1. Why Key-Value/NOSQL?
- Video: 1.2. Cassandra
- Video: 1.3. The Mystery of X-The Cap Theorem
- Video: 1.4. The Consistency Spectrum
- Video: 1.5. HBase
- Video: 2.1. Introduction and Basics
- Video: 2.2. Cristian's Algorithm
- Video: 2.3. NTP
- Video: 2.4. Lamport Timestamps
- Video: 2.5. Vector Clocks
- Video: Interview with Marcos Aguilera
- Reading: Optional: Lamport Timestamps (Ukulele Version)
- Reading: Homework 4 Instructions
- Discussion Prompt: Homework 4 Discussion
Graded: Homework 4
WEEK 5
Week 5: Classical Distributed Algorithms
Lesson 1: This module covers how to calculate a distributed snapshot, leveraging causality again to circumvent the synchronization problem. Lesson 2: This lecture teaches how to order multicasts in any distributed system. Algorithms for assigning timestamp tags to multicasts using various flavors of ordering – FIFO, Causal, and Total – are covered. The module also covers virtual synchrony, a paradigm that combines reliable multicasts with membership views. Lesson 3: Consensus is one of the most important problems in a distributed system, enabling multiple machines to agree. This module uses Paxos, one of the most popular consensus solutions used in the industry today. Paxos is not perfect because consensus cannot be solved completely – an optional lecture presents the famous FLP proof of impossibility of consensus.
16 videos, 3 readings expand
- Reading: Week 5 Overview
- Video: Week 5 Introduction
- Video: 1.1. What is Global Snapshot?
- Video: 1.2. Global Snapshot Algorithm
- Video: 1.3. Consistent Cuts
- Video: 1.4. Safety and Liveness
- Video: 2.1. Multicast Ordering
- Video: 2.2. Implementing Multicast Ordering 1
- Video: 2.3. Implementing Multicast Ordering 2
- Video: 2.4. Reliable Multicast
- Video: 2.5. Virtual Synchrony
- Video: 3.1. The Consensus Problem
- Video: 3.2. Consensus In Synchronous Systems
- Video: 3.3. Paxos, Simply
- Video: 3.4. The FLP Proof [OPTIONAL]
- Video: Interview with Tushar Chandra
- Reading: Homework 5 Instructions
- Discussion Prompt: Homework 5 Discussion
- Video: Conclusion to Cloud Computing Concepts, Part 1
- Reading: Final Exam Instructions
- Discussion Prompt: Final Exam Discussion
- Discussion Prompt: Final Reflection
Graded: Homework 5
Graded: Gossip Protocol
Graded: Final Exam
Share your review
Do you have experience with this course? Submit your review and help other people make the right choice. As a thank you for your effort we will donate £1.- to Stichting Edukans.There are no frequently asked questions yet. If you have any more questions or need help, contact our customer service.