This course teaches learners (industry professionals and students) the fundamental concepts of concurrent programming in the context of Java 8. Concurrent programming enables developers to efficiently and correctly mediate the use of shared resources in parallel programs. By the end of this course, you will learn how to use basic concurrency constructs in Java such as threads, locks, critical sections, atomic variables, isolation, actors, optimistic concurrency and concurrent collections, as well as their theoretical foundations (e.g., progress guarantees, deadlock, livelock, starvation, linearizability).
Ce cours fait partie de la Spécialisation Parallel, Concurrent, and Distributed Programming in Java
Offert par
Spécialisation Parallel, Concurrent, and Distributed Programming in JavaUniversité de RiceÀ propos de ce cours
31,122 consultations récentes
Résultats de carrière des étudiants
11%
ont commencé une nouvelle carrière après avoir terminé ce cours
14%
ont bénéficié d'un avantage concret dans leur carrières grâce à ce cours
Certificat partageable
Obtenez un Certificat lorsque vous terminez
100 % en ligne
Commencez dès maintenant et apprenez aux horaires qui vous conviennent.
Cours 2 sur 3 dans le
Dates limites flexibles
Réinitialisez les dates limites selon votre disponibilité.
Niveau intermédiaire
Approx. 19 heures pour terminer
Anglais
Sous-titres : Français, Portugais (brésilien), Russe, Anglais, Espagnol
Compétences que vous acquerrez
Concurrency (Computer Science)Actor ModelOptimistic Concurrency ControlJava Concurrency
Résultats de carrière des étudiants
11%
ont commencé une nouvelle carrière après avoir terminé ce cours
14%
ont bénéficié d'un avantage concret dans leur carrières grâce à ce cours
Certificat partageable
Obtenez un Certificat lorsque vous terminez
100 % en ligne
Commencez dès maintenant et apprenez aux horaires qui vous conviennent.
Cours 2 sur 3 dans le
Dates limites flexibles
Réinitialisez les dates limites selon votre disponibilité.
Niveau intermédiaire
Approx. 19 heures pour terminer
Anglais
Sous-titres : Français, Portugais (brésilien), Russe, Anglais, Espagnol
Offert par
Université de Rice
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.
Programme du cours : ce que vous apprendrez dans ce cours
1 heure pour terminer
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 heure pour terminer
1 vidéo (Total 1 min), 5 lectures, 1 quiz
1 vidéo
Course Welcome1 min
5 lectures
General Course Info5 min
Course Icon Legend2 min
Discussion Forum Guidelines2 min
Pre-Course Survey10 min
Mini Project 0: Setup10 min
5 heures pour terminer
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.
5 heures pour terminer
6 vidéos (Total 41 min), 6 lectures, 2 quiz
6 vidéos
1.1 Threads5 min
1.2 Structured Locks7 min
1.3 Unstructured Locks7 min
1.4 Liveness7 min
1.5 Dining Philosophers8 min
Demonstration: Locking and Synchronization4 min
6 lectures
1.1 Lecture Summary5 min
1.2 Lecture Summary5 min
1.3 Lecture Summary5 min
1.4 Lecture Summary5 min
1.5 Lecture Summary5 min
Mini Project 1: Locking and Synchronization10 min
1 exercice pour s'entraîner
Module 1 Quiz30 min
4 heures pour terminer
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.
4 heures pour terminer
6 vidéos (Total 36 min), 6 lectures, 2 quiz
6 vidéos
2.2 Object Based Isolation (Monitors)7 min
2.3 Concurrent Spanning Tree Algorithm6 min
2.4 Atomic Variables6 min
2.5 Read, Write Isolation5 min
Demonstration: Global and Object-Based Isolation3 min
6 lectures
2.1 Lecture Summary10 min
2.2 Lecture Summary10 min
2.3 Lecture Summary10 min
2.4 Lecture Summary10 min
2.5 Lecture Summary10 min
Mini Project 2: Global and Object-Based Isolation10 min
1 exercice pour s'entraîner
Module 2 Quiz33 min
20 minutes pour terminer
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.
20 minutes pour terminer
2 vidéos (Total 10 min), 1 lecture
2 vidéos
Industry Professional on Concurrency - Dr. Shams Imam, Software Engineer3 min
1 lecture
About these Talks10 min
4 heures pour terminer
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.
4 heures pour terminer
6 vidéos (Total 29 min), 6 lectures, 2 quiz
6 vidéos
3.1 Actors5 min
3.2 Actor Examples6 min
3.3 Sieve of Eratosthenes Algorithm5 min
3.4 Producer-Consumer Problem4 min
3.5 Bounded Buffer Problem3 min
Demonstration: Sieve of Eratosthenes Using Actor Parallelism3 min
6 lectures
3.1 Lecture Summary10 min
3.2 Lecture Summary10 min
3.3 Lecture Summary10 min
3.4 Lecture Summary10 min
3.5 Lecture Summary10 min
Mini Project 3: Sieve of Eratosthenes Using Actor Parallelism10 min
1 exercice pour s'entraîner
Module 3 Quiz30 min
4 heures pour terminer
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.
4 heures pour terminer
6 vidéos (Total 38 min), 7 lectures, 2 quiz
6 vidéos
4.2 Concurrent Queue5 min
4.3 Linearizability6 min
4.4 Concurrent Hash Map5 min
4.5 Concurrent Minimum Spanning Tree Algorithm7 min
Demonstration: Parallelization of Boruvka's Minimum Spanning Tree Algorithm7 min
7 lectures
4.1 Lecture Summary10 min
4.2 Lecture Summary10 min
4.3 Lecture Summary10 min
4.4 Lecture Summary10 min
4.5 Lecture Summary10 min
Mini Project 4: Parallelization of Boruvka's Minimum Spanning Tree Algorithm10 min
Exit Survey10 min
1 exercice pour s'entraîner
Module 4 Quiz30 min
15 minutes pour terminer
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.
15 minutes pour terminer
2 vidéos (Total 13 min), 1 lecture
2 vidéos
Industry Professional on Distribution - Dr. Eric Allen, Senior Vice President, Two Sigma6 min
1 lecture
Our Other Course Offerings2 min
Avis
Meilleurs avis pour CONCURRENT PROGRAMMING IN JAVA
par PS1 sept. 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.
par FC8 févr. 2020
Excellent way to refresh what I learned some years ago in Operator System. Also I won a small hands-on experience using locks, isolation and high level concurrency in Java.
par SM11 nov. 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
par AM30 mai 2020
Very well structured and presented course! Very useful material with good relevant examples! Thank you, Prof. Sarkar for this Concurrent Programming in Java course!
À propos du Spécialisation 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.
Foire Aux Questions
Quand aurai-je accès aux vidéos de cours et aux devoirs ?
À quoi ai-je droit si je m'abonne à cette Spécialisation ?
Is financial aid available?
Puis-je obtenir des crédits universitaires si je réussis le Cours ?
D'autres questions ? Visitez le Centre d'Aide pour les Etudiants.
