UIUC - Cloud Computing Concepts: Part 2
- Offered byCoursera
Cloud Computing Concepts: Part 2 at Coursera Overview
Duration | 20 hours |
Start from | Start Now |
Total fee | Free |
Mode of learning | Online |
Official Website | Explore Free Course |
Credential | Certificate |
Cloud Computing Concepts: Part 2 at Coursera Highlights
- Shareable Certificate Earn a Certificate upon completion
- 100% online Start instantly and learn at your own schedule.
- Course 2 of 6 in the Cloud Computing Specialization
- Flexible deadlines Reset deadlines in accordance to your schedule.
- Approx. 20 hours to complete
- English Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, Korean, German, Russian, English, Spanish
Cloud Computing Concepts: Part 2 at Coursera Course details
- 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.
- This course builds on the material covered in the Cloud Computing Concepts, Part 1 course.
Cloud Computing Concepts: Part 2 at Coursera Curriculum
Week 1: Course Orientation and Classical Distributed Algorithms Continued
Introduction to Cloud Computing Concepts, Part 2
Orientation Towards Cloud Computing Concepts: Some Basic Computer Science Fundamentals
Week 1 Introduction
1.1. The Election Problem
1.2. Ring Leader Election
1.3. Election in Chubby and ZooKeeper
1.4. Bully Algorithm
2.1. Introduction and Basics
2.2. Distributed Mutual Exclusion
2.3. Ricart-Agrawala's Algorithm
2.4. Maekawa's Algorithm and Wrap-Up
Orientation Overview
Syllabus
About the Discussion Forums
Course Learning Community and Social Media
Week 1 Overview
Homework 1 Instructions
Programming Assignment Instructions
Orientation Quiz
Homework 1
Week 2: Concurrency and Replication Control
Week 2 Introduction
1.1. RPCs
1.2. Transactions
1.3. Serial Equivalence
1.4. Pessimistic Concurrency
1.5. Optimistic Concurrency Control
2.1. Replication
2.2. Two-Phase Commit
Week 2 Overview
Homework 2 Instructions
Homework 2
Week 3: Emerging Paradigms
Week 3 Introduction
Stream Processing in Storm
Distributed Graph Processing
Structure of Networks
4.1. Single-processor Scheduling
4.2. Hadoop Scheduling
4.3. Dominant-Resource Fair Scheduling
Storm Demo
Apache Spark by Faria Kalim
Week 3 Overview
Homework 3 Instructions
Homework 3
Week 4: Classical Systems
Week 4 Introduction
1.1. File System Abstraction
1.2. NFS and AFS
Distributed Shared Memory
Sensor and Their Networks
Interview with Brighten Godfrey
Week 4 Overview
Homework 4 Instructions
Homework 4
Week 5: Real-Life Behaviors
Week 5 Introduction
1.1. Basic Security Concepts
1.2. Basic Cryptography Concepts
1.3. Implementing Mechanism using Cryptography
2.1. What Causes Disasters?
2.2. AWS Outage
2.3. Facebook Outage
2.4. The Planet Outage
2.5. Wrap-Up
Interview with Paul Kwiat
Conclusion to Cloud Computing Concepts, Part 2
Week 5 Overview
Homework 5 Instructions
Final Exam Instructions
Homework 5
Final Exam