CSC364 Lecture 16

Introduction to Networked, Distributed, and Parallel Computing
Final Project
(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 16. Final Project 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 19 (midnight) 2
3. Final Project 3
4. Networked Distributed Parallel (Multi-Thread) Application
5. 5 Travelling Salesman Problem Im a gine a s a lesm a n who needs to visit m a ny cities. He w a nts to visit e a ch city only once. After visiting a ll cities, he needs to return to his st a rting point. Connections h a ve a "cost." This cost could be the price of a ticket, the dist a nce between cities, or the time it t a kes to tr a vel F a mous puzzle in computer science The e a siest w a y to solve it is to try every single possible route. But this quickly becomes impossible! If you h a ve N cities, there a re (N-1) f a ctori a l possible routes. Finding the best w a y (che a pest, shortest, or f a stest w a y) to visit m a ny points "NP-h a rd" problem
6. 6 Travelling Salesman Problem 5 7 5 4 9 8
7. 7 www.math.uwaterloo.ca/tsp/world/index.html
8. 8 www.math.uwaterloo.ca/tsp/world/index.html
9. 1_904_711
10. 10 Euclidian Distance in a 2D space Str a ight-line me a surement between two points C a lcul a ted a s the squ a re root of the sum of squ a red di ff erences between corresponding coordin a tes, b a sed on the Pyth a gore a n theorem.
11. 11 Drafting an Idea
12. 12 Drafting an Idea
13. 13 Drafting an Idea
14. 14 Homework: Review the Java Style Guide https://github.com/javiergs/CSC364/ tree/main/10-tsp-draft
15. 15 Drafting an Idea
16. 16 And wait …
17. 17 Drafting an Idea
18. 18 Nearest Neighbor (NN) algorithm 1. Choose a st a rting city 2. M a rk it a s visited 3. Find the closest unvisited city 4. Move there 5. Repe a t until a ll cities a re visited 6. Return to the st a rting city
19. Final Project 19
20. Parallel (Multi-Thread) Application
21. 21 Threads
22. Networked Distributed Parallel (Multi-Thread) Application
23. 23 MQTT
24. Project Presentation
25. Project Presentation 25 Product Process You
26. First Act – Demo Demo of your project. Show your project running. 26
27. Second Act – Review and Retrospective Review Wh a t is Good in the product? Wh a t is next for the product (next fe a tures to be a dded)? (your promise for the next sprint present a tion) Retrospective (Process & People) Wh a t went well? Wh a t did not go well? 27
28. Project Submission
29. To-Do List • Source Code • Or a l Present a tion (5 minutes video) My fe a tures, my design a nd its integr a tion, my code, a nd the qu a lity metrics of my code. • Self- Peer Ev a lu a tion 29
30. 30 Questions
31. Lab.
32. 32 Let’s Work
33. 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. 33