Concurrency in Go

Concurrency in Go

This course is part of Programming with Google Go Specialization

Instructor: Ian Harris

Access provided by Capgemini

28,277 already enrolled

4 modules

Gain insight into a topic and learn the fundamentals.

797 reviews

Intermediate level

Some related experience required

Flexible schedule

1 week at 10 hours a week

Learn at your own pace

87%

Most learners liked this course

4 modules

Gain insight into a topic and learn the fundamentals.

797 reviews

Intermediate level

Some related experience required

Flexible schedule

1 week at 10 hours a week

Learn at your own pace

87%

Most learners liked this course

Skills you'll gain

Tools you'll learn

Details to know

Shareable certificate

Add to your LinkedIn profile

Assessments

4 assignments¹

AI Graded see disclaimer

Taught in English

See how employees at top companies are mastering in-demand skills

Learn more about Coursera for Business

logos of Petrobras, TATA, Danone, Capgemini, P&G and L'Oreal

Build your subject-matter expertise

This course is part of the Programming with Google Go Specialization

When you enroll in this course, you'll also be enrolled in this Specialization.

Learn new concepts from industry experts
Gain a foundational understanding of a subject or tool
Develop job-relevant skills with hands-on projects
Earn a shareable career certificate

There are 4 modules in this course

Learn how to implement concurrent programming in Go. Explore the roles of channels and goroutines in implementing concurrency. Topics include writing goroutines and implementing channels for communications between goroutines. Course activities will allow you to exercise Go’s capabilities for concurrent programming by developing several example programs.

This course introduces the concept of concurrency in Go. The first module sets the stage by reviewing the physical factors that can restrict microprocessor performance increases in the future.

What's included

2 videos5 readings1 assignment1 peer review

2 videos Total 40 minutes

M1.1.1-3v3 26 minutes
M1.2.1-1v3 15 minutes

5 readings Total 10 minutes

M1.1.1 - Parallel Execution 2 minutes
M1.1.2 - Von Neumann Bottleneck 2 minutes
M1.1.3 - Power Wall 2 minutes
M1.2.1 - Concurrent vs Parallel 2 minutes
M1.2.2 - Hiding Latency 2 minutes

1 assignment Total 14 minutes

Module 1 Quiz 14 minutes

1 peer review Total 120 minutes

Module 1 Activity 120 minutes

This module looks at basic concurrency concepts and race conditions in preparation for a discussion of threads coming up in the next module.

What's included

2 videos5 readings1 assignment1 peer review

2 videos Total 36 minutes

M2.1.1-3v3 21 minutes
M2.2.1-2v3 15 minutes

5 readings Total 10 minutes

M2.1.1- Processes 2 minutes
M2.1.2 - Scheduling 2 minutes
M2.1.3 - Threads and Goroutines 2 minutes
M2.2.1 - Interleavings 2 minutes
M2.2.2 - Race Conditions 2 minutes

1 assignment Total 14 minutes

Module 2 Quiz 14 minutes

1 peer review Total 120 minutes

Module 2 Activity 120 minutes

In this module, you’ll work with threaded goroutines and explore the benefits of synchronization. The week’s assignment has you using a threaded approach to create a program that sorts integers via four separate sub-arrays, then merging the arrays into a single array.

What's included

3 videos7 readings1 assignment1 peer review

3 videos Total 53 minutes

M3.1.1-2v3 12 minutes
M3.2.1-2v3 17 minutes
M3.3.1-3v3 24 minutes

7 readings Total 14 minutes

M3.1.1 - Goroutines 2 minutes
M3.1.2 - Exiting Goroutines 2 minutes
M3.2.1 - Basic Synchronization 2 minutes
M3.2.2 - Wait Groups 2 minutes
M3.3.1 - Communication 2 minutes
M3.3.2 - Blocking on Channels 2 minutes
M3.3.3 - Buffered Channels 2 minutes

1 assignment Total 14 minutes

Module 3 Quiz 14 minutes

1 peer review Total 120 minutes

Module 3 Activity 120 minutes

This last module ties together the various features – including threads, concurrency, and synchronization – covered in this course. The week’s programming assignment requires you to use concurrent algorithms in the implementation of the “dining philosopher’s problem and then address the ensuing synchronization issues.