CSC364 Lecture 15

Introduction to Networked, Distributed, and Parallel Computing
Connecting the Dots
(202603)

Transcript

1. Dr. Javier Gonzalez-Sanchez javiergs@calpoly.edu www.javiergs.info o ffi ce: 14 -227 CSC 364 Introduction to Networked, Distributed, and Parallel Computing Lecture 15. Connecting the Dots 1
2. Agenda • Fin a l Ex a m: M a rch 12 (3:10 - 4:30PM) or M a rch 19 (4:10 - 5:30 PM) • Fin a l Review M a rch 10 or M a rch 12 • Fin a l Project M a rch 12 or M a rch 19 2
3. 3 Test Yourselves Q
4. 4 Test Yourselves Q
5. 5 Test Yourselves Q
6. 6 Test Yourselves Q
7. Pipeline Pattern 7
8. 8 De f inition • Work f lows through st a ges (thre a ds), typic a lly connected by blocking queues. • E a ch st a ge runs concurrently.
9. 9 Class Condition • A Condition object represents a st a te predic a te th a t thre a ds c a n w a it for while holding a lock. • E a ch Condition is tied to one speci f ic lock When a thre a d c a lls a w a it(): • It rele a ses the lock • It goes to sleep When sign a led: • It re- a cquires the lock • Execution resumes a fter a w a it()
10. 10 Life Cycle
11. 11 Main (1/2)
12. 12 Main (2/2)
13. 13 Generator
14. 14 Processor
15. 15 Reporter
16. 16 Depot
17. 17 Case 1
19. 19 Case 1
21. 21 Case 1
22. 22 Life Cycle
23. 23 Depot
24. 24 Code https://github.com/javiergs/CSC364/ tree/main/09-pipeline
25. BlockingQueue Java 25
26. 26 De f inition A BlockingQueue is a thre a d-s a fe queue th a t a utom a tic a lly h a ndles: • Mutu a l exclusion • W a iting when empty • W a iting when full
27. 27 De f inition It removes the need to m a nu a lly write: lock.lock(); while(condition) { await(); } ... signal(); lock.unlock();
28. 28 Methods put(E e) • Inserts a n element • If the queue is full → the thre a d blocks until sp a ce is a v a il a ble t a ke() • Removes a nd returns the he a d • If the queue is empty → the thre a d blocks until a n element is a v a il a ble
29. 29 Solution No busy w a iting. No m a nu a l condition v a ri a bles. No m a nu a l sign a l. It directly solves the Producer–Consumer problem. It helps with Pipeline connection
30. 30 Solution
31. 31 Questions
32. Lab.
33. 33 Lab Quiz :: Concepts
34. CSC 364 Introduction to Introduction to Networked, Distributed, and Parallel Computing Javier Gonzalez-Sanchez, Ph.D. javiergs@calpoly.edu Winter 2026 Copyright. These slides can only be used as study material for the class CSC 364 at Cal Poly. They cannot be distributed or used for another purpose. 34