このコースについて
4.5
343件の評価
48件のレビュー

100%オンライン

自分のスケジュールですぐに学習を始めてください。

柔軟性のある期限

スケジュールに従って期限をリセットします。

中級レベル

約14時間で修了

推奨:Four weeks of study, 4-8 hours/week depending on past experience with sequential programming in Java...

英語

字幕:英語

習得するスキル

Concurrency (Computer Science)Actor ModelOptimistic Concurrency ControlJava Concurrency

100%オンライン

自分のスケジュールですぐに学習を始めてください。

柔軟性のある期限

スケジュールに従って期限をリセットします。

中級レベル

約14時間で修了

推奨:Four weeks of study, 4-8 hours/week depending on past experience with sequential programming in Java...

英語

字幕:英語

シラバス - 本コースの学習内容

1
1時間で修了

Welcome to the Course!

Welcome to Concurrent Programming in Java! This course is designed as a three-part series and covers a theme or body of knowledge through various video lectures, demonstrations, and coding projects....
1件のビデオ (合計1分), 5 readings, 1 quiz
1件のビデオ
5件の学習用教材
General Course Info5 分
Course Icon Legend2 分
Discussion Forum Guidelines2 分
Pre-Course Survey10 分
Mini Project 0: Setup10 分
5時間で修了

Threads and Locks

In this module, we will learn about threads and locks, which have served as primitive building blocks for concurrent programming for over five decades. All computing platforms today include some form of support for threads and locks, and make them available for use by developers in a wide range of programming languages. We will learn how threads can be created, joined, and synchronized using structured (e.g., synchronized statements/methods) and unstructured (e.g., java.util.concurrent libraries) locks in Java. We will also learn about new classes of bugs that can arise when concurrent programs need to access shared resources. These bugs are referred to as violations of liveness/progress guarantees, and include deadlock, livelock, and starvation. We will conclude this module by studying different solutions to the classical "Dining Philosophers" problem, and use these solutions to illustrate instances of deadlock, livelock and starvation....
6件のビデオ (合計41分), 6 readings, 2 quizzes
6件のビデオ
1.2 Structured Locks7 分
1.3 Unstructured Locks7 分
1.4 Liveness7 分
1.5 Dining Philosophers8 分
Demonstration: Locking and Synchronization4 分
6件の学習用教材
1.1 Lecture Summary5 分
1.2 Lecture Summary5 分
1.3 Lecture Summary5 分
1.4 Lecture Summary5 分
1.5 Lecture Summary5 分
Mini Project 1: Locking and Synchronization10 分
1の練習問題
Module 1 Quiz30 分
2
4時間で修了

Critical Sections and Isolation

In this module, we will learn different approaches to coordinating accesses to shared resources without encountering the deadlock or livelock bugs studied earlier. Critical/isolated sections are higher-level concurrent programming constructs (relative to locks) that simplify the implementation of mutual exclusion by guaranteeing the absence of deadlocks and livelocks. Object-based isolation relaxes the constraints imposed by critical sections by allowing mutual exclusion to be specified on a per-object basis, as illustrated in the Spanning Tree example. Java's atomic variables represent an important, but restricted, case of object-based isolation that is implemented efficiently on all hardware platforms. Finally, we will learn how object-based isolation can be further relaxed with read/write access modes....
6件のビデオ (合計36分), 6 readings, 2 quizzes
6件のビデオ
2.2 Object Based Isolation (Monitors)7 分
2.3 Concurrent Spanning Tree Algorithm6 分
2.4 Atomic Variables6 分
2.5 Read, Write Isolation5 分
Demonstration: Global and Object-Based Isolation3 分
6件の学習用教材
2.1 Lecture Summary10 分
2.2 Lecture Summary10 分
2.3 Lecture Summary10 分
2.4 Lecture Summary10 分
2.5 Lecture Summary10 分
Mini Project 2: Global and Object-Based Isolation10 分
1の練習問題
Module 2 Quiz33 分
20分で修了

Talking to Two Sigma: Using it in the Field

Join Professor Vivek Sarkar as he talks with Software Engineer, Dr. Shams Imam, at their downtown Houston, Texas office about threads, locks, deadlocks, high-level and low-level constructs, and the importance of concurrent programming. ...
2件のビデオ (合計10分), 1 reading
2件のビデオ
Industry Professional on Concurrency - Dr. Shams Imam, Software Engineer3 分
1件の学習用教材
About these Talks10 分
3
4時間で修了

Actors

In this module, we will learn another high-level approach to concurrent programming called the "Actor" model. A major difference between the Actor model and the Isolated Sections model is that there are no data races possible in the Actor model because it does not allow for any form of shared variables. However, as in all concurrent programming models, higher-level forms of nondeterminism are still possible in the Actor model due to an inherent asynchrony in the order in which messages may be delivered. We will study multiple examples of concurrency using the Actor model, including the classical Sieve of Eratosthenes algorithm to generate prime numbers, as well as producer-consumer patterns with both unbounded and bounded buffers....
6件のビデオ (合計29分), 6 readings, 2 quizzes
6件のビデオ
3.2 Actor Examples6 分
3.3 Sieve of Eratosthenes Algorithm5 分
3.4 Producer-Consumer Problem4 分
3.5 Bounded Buffer Problem3 分
Demonstration: Sieve of Eratosthenes Using Actor Parallelism3 分
6件の学習用教材
3.1 Lecture Summary10 分
3.2 Lecture Summary10 分
3.3 Lecture Summary10 分
3.4 Lecture Summary10 分
3.5 Lecture Summary10 分
Mini Project 3: Sieve of Eratosthenes Using Actor Parallelism10 分
1の練習問題
Module 3 Quiz30 分
4
4時間で修了

Concurrent Data Structures

In this module, we will study Concurrent Data Structures, which form an essential software layer in all multithreaded programming systems. First, we will learn about Optimistic Concurrency, an important multithreaded pattern in which two threads can "optimistically" make progress on their assigned work without worrying about mutual conflicts, and only checking for conflicts before "committing" the results of their work. We will then study the widely-used Concurrent Queue data structure. Even though the APIs for using concurrent queues are very simple, their implementations using the Optimistic Concurrency model can be complex and error-prone. To that end, we will also learn the formal notion of Linearizability to better understand correctness requirements for concurrent data structures. We will then study Concurrent Hash Maps, another widely-used concurrent data structure. Finally, we discuss a concurrent algorithm for finding a Minimum Spanning Tree of an undirected graph, an algorithm that relies on the use of Concurrent Data Structures under the covers....
6件のビデオ (合計38分), 7 readings, 2 quizzes
6件のビデオ
4.2 Concurrent Queue5 分
4.3 Linearizability6 分
4.4 Concurrent Hash Map5 分
4.5 Concurrent Minimum Spanning Tree Algorithm7 分
Demonstration: Parallelization of Boruvka's Minimum Spanning Tree Algorithm7 分
7件の学習用教材
4.1 Lecture Summary10 分
4.2 Lecture Summary10 分
4.3 Lecture Summary10 分
4.4 Lecture Summary10 分
4.5 Lecture Summary10 分
Mini Project 4: Parallelization of Boruvka's Minimum Spanning Tree Algorithm10 分
Exit Survey10 分
1の練習問題
Module 4 Quiz30 分
15分で修了

Continue Your Journey with the Specialization "Parallel, Concurrent, and Distributed Programming in Java"

The next two videos will showcase the importance of learning about Parallel Programming and Distributed Programming in Java. Professor Vivek Sarkar will speak with industry professionals at Two Sigma about how the topics of our other two courses are utilized in the field....
2件のビデオ (合計13分), 1 reading
2件のビデオ
Industry Professional on Distribution - Dr. Eric Allen, Senior Vice President, Two Sigma6 分
1件の学習用教材
Our Other Course Offerings2 分
4.5
48件のレビューChevron Right

12%

コース終了後に新しいキャリアをスタートした

10%

コースが具体的なキャリアアップにつながった

人気のレビュー

by PSSep 2nd 2017

Great course. With minimal effort you can learn about important concepts and see immediate results regarding the actual speedup you can achieve using concurrent programming.

by SMNov 12th 2017

This was a good course and covered all the topics relevant to the course. I liked the Optimistic Concurrency in week 4 - that was an area I was not exposed to before

講師

Avatar

Vivek Sarkar

Professor
Department of Computer Science

ライス大学(Rice University)について

Rice University is consistently ranked among the top 20 universities in the U.S. and the top 100 in the world. Rice has highly respected schools of Architecture, Business, Continuing Studies, Engineering, Humanities, Music, Natural Sciences and Social Sciences and is home to the Baker Institute for Public Policy....

Parallel, Concurrent, and Distributed Programming in Javaの専門講座について

Parallel, concurrent, and distributed programming underlies software in multiple domains, ranging from biomedical research to financial services. This specialization is intended for anyone with a basic knowledge of sequential programming in Java, who is motivated to learn how to write parallel, concurrent and distributed programs. Through a collection of three courses (which may be taken in any order or separately), you will learn foundational topics in Parallelism, Concurrency, and Distribution. These courses will prepare you for multithreaded and distributed programming for a wide range of computer platforms, from mobile devices to cloud computing servers. To see an overview video for this Specialization, click here! For an interview with two early-career software engineers on the relevance of parallel computing to their jobs, click here. Acknowledgments The instructor, Prof. Vivek Sarkar, would like to thank Dr. Max Grossman for his contributions to the mini-projects and other course material, Dr. Zoran Budimlic for his contributions to the quizzes, Dr. Max Grossman and Dr. Shams Imam for their contributions to the pedagogic PCDP library used in some of the mini-projects, and all members of the Rice Online team who contributed to the development of the course content (including Martin Calvi, Annette Howe, Seth Tyger, and Chong Zhou)....
Parallel, Concurrent, and Distributed Programming in Java

よくある質問

  • 修了証に登録すると、すべてのビデオ、テスト、およびプログラミング課題(該当する場合)にアクセスできます。ピアレビュー課題は、セッションが開始してからのみ、提出およびレビューできます。購入せずにコースを検討することを選択する場合、特定の課題にアクセスすることはできません。

  • コースに登録する際、専門講座のすべてのコースにアクセスできます。コースの完了時には修了証を取得できます。電子修了証が成果のページに追加され、そこから修了証を印刷したり、LinkedInのプロフィールに追加したりできます。コースの内容の閲覧のみを希望する場合は、無料でコースを聴講できます。

さらに質問がある場合は、受講者向けヘルプセンターにアクセスしてください。