PK G]_rels/PK G] docProps/PK G]ppt/PK G] ppt/_rels/PK G] ppt/charts/PK G]ppt/charts/_rels/PK G]ppt/embeddings/PK G] ppt/media/PK G]ppt/slideLayouts/PK G]ppt/slideLayouts/_rels/PK G]ppt/slideMasters/PK G]ppt/slideMasters/_rels/PK G] ppt/slides/PK G]ppt/slides/_rels/PK G] ppt/theme/PK G]ppt/notesMasters/PK G]ppt/notesMasters/_rels/PK G]ppt/notesSlides/PK G]ppt/notesSlides/_rels/PK G]QXQX[Content_Types].xml PK G]]] _rels/.rels PK G]pYӠ docProps/app.xml 0 0 Microsoft Office PowerPoint On-screen Show (16:9) 0 48 48 0 0 false Fonts Used 2 Theme 1 Slide Titles 48 Arial Calibri Office Theme Slide 1Slide 2Slide 3Slide 4Slide 5Slide 6Slide 7Slide 8Slide 9Slide 10Slide 11Slide 12Slide 13Slide 14Slide 15Slide 16Slide 17Slide 18Slide 19Slide 20Slide 21Slide 22Slide 23Slide 24Slide 25Slide 26Slide 27Slide 28Slide 29Slide 30Slide 31Slide 32Slide 33Slide 34Slide 35Slide 36Slide 37Slide 38Slide 39Slide 40Slide 41Slide 42Slide 43Slide 44Slide 45Slide 46Slide 47Slide 48 PptxGenJS false false false 16.0000 PK G]nb''docProps/core.xml Komputasi Paralel dan Terdistribusi PptxGenJS Presentation Nurhasan Nugroho, S.T., M.Kom. Nurhasan Nugroho, S.T., M.Kom. 1 2026-10-07T04:05:33Z 2026-10-07T04:05:33Z PK G]ܱ&&ppt/_rels/presentation.xml.rels PK G]Oݨ ppt/theme/theme1.xmlPK G]⥙ppt/presentation.xml PK G]Xppt/presProps.xml PK G]ppt/tableStyles.xml PK G]D >00ppt/viewProps.xml PK G]H7t!ppt/slideLayouts/slideLayout1.xml PK G]ђ77,ppt/slideLayouts/_rels/slideLayout1.xml.rels PK G]* !ppt/slideLayouts/slideLayout2.xml KOM231401218 - Komputasi Paralel dan Terdistribusi | Nurhasan Nugroho, S.T., M.Kom. 1002 PK G]ђ77,ppt/slideLayouts/_rels/slideLayout2.xml.rels PK G]bX4MMppt/slides/slide1.xml UNIVERSITAS BINA BANGSAKOMPUTASI PARALEL DAN TERDISTRIBUSIMateri Perkuliahan 16 Pertemuan | KOM231401218 | 3 SKS | Semester 5Program Studi Ilmu Komputer - S1 | Kurikulum 2023Dosen Pengampu: Nurhasan Nugroho, S.T., M.Kom. 1PK G]P ppt/slides/_rels/slide1.xml.rels PK G].ppt/notesSlides/notesSlide1.xml 1PK G]:A*ppt/notesSlides/_rels/notesSlide1.xml.rels PK G]ôR>R>ppt/slides/slide2.xml Peta 16 Pertemuan1. Pengantar Komputasi Paralel dan Terdistribusi2. Multithreading dan Sinkronisasi3. Advanced Synchronization4. Pemrograman OpenMP5. Optimasi OpenMP6. Pemrograman MPI7. MPI Collective Communication8. Ujian Tengah Semester (UTS)9. Replikasi dan Konsistensi10. Model Konsistensi11. Toleransi Kegagalan12. Checkpointing dan Recovery13. Kerangka Kerja Data Terdistribusi14. Proyek Akhir (Integrasi)15. Presentasi Proyek16. Ujian Akhir Semester (UAS) 2PK G] ppt/slides/_rels/slide2.xml.rels PK G]ppt/notesSlides/notesSlide2.xml 2PK G]xշ*ppt/notesSlides/_rels/notesSlide2.xml.rels PK G] '77ppt/slides/slide3.xml PERTEMUAN 1Pengantar Komputasi Paralel dan TerdistribusiSUB-CPMK-01 | Tujuan: Menjelaskan taksonomi Flynn, arsitektur paralel, dan model sistem terdistribusi serta implikasi etisnya.Dosen: Nurhasan Nugroho, S.T., M.Kom. 3PK G]  ppt/slides/_rels/slide3.xml.rels PK G]?ww44ppt/notesSlides/notesSlide3.xml Pertemuan 1: Pengantar Komputasi Paralel dan Terdistribusi. Menjelaskan taksonomi Flynn, arsitektur paralel, dan model sistem terdistribusi serta implikasi etisnya.3PK G]9 Y*ppt/notesSlides/_rels/notesSlide3.xml.rels PK G]}9ٹ!!ppt/slides/slide4.xml P1 | Materi PokokKomputasi serial vs paralel vs terdistribusiTaksonomi Flynn: SISD, SIMD, MISD, MIMDMemori bersama vs memori terdistribusiHukum Amdahl: Speedup = 1 / ((1-P) + P/N)Etika: keamanan data, konsumsi energi, tanggung jawabAktivitas & PenilaianStudi kasus arsitektur sistem | Observasi (5%)Durasi: 150 menitSub-CPMK: SUB-CPMK-01 4PK G]ի< ppt/slides/_rels/slide4.xml.rels PK G]ppt/notesSlides/notesSlide4.xml Jelaskan tiap poin dengan contoh. Menjelaskan taksonomi Flynn, arsitektur paralel, dan model sistem terdistribusi serta implikasi etisnya.4PK G]J *ppt/notesSlides/_rels/notesSlide4.xml.rels PK G],I.00ppt/slides/slide5.xml P1 | Praktikum: Terminal Linux (lscpu, nproc)kode.c / terminalimport sysdef amdahl(p, n): return 1 / ((1 - p) + p / n)for n in (2, 4, 8, 16): print(f"N={n:2d} speedup={amdahl(0.9, n):.2f}")$ lscpu | grep -E "Model name|^CPU\(s\)|Thread"$ nproc$ python3 amdahl.pyOUTPUTModel name : Intel(R) Core(TM) i5CPU(s) : 8N= 2 speedup=1.82N= 4 speedup=3.08N= 8 speedup=4.71N=16 speedup=6.40 5PK G]΄ ppt/slides/_rels/slide5.xml.rels PK G][bppt/notesSlides/notesSlide5.xml Demonstrasikan langkah praktikum pada Terminal Linux (lscpu, nproc), lalu mahasiswa mengulang secara mandiri.5PK G]Qe*ppt/notesSlides/_rels/notesSlide5.xml.rels PK G]6ppt/slides/slide6.xml PERTEMUAN 2Multithreading dan SinkronisasiSUB-CPMK-02 | Tujuan: Mengimplementasikan thread dan mencegah race condition dengan mutex/semaphore.Dosen: Nurhasan Nugroho, S.T., M.Kom. 6PK G]g ppt/slides/_rels/slide6.xml.rels PK G]f  ppt/notesSlides/notesSlide6.xml Pertemuan 2: Multithreading dan Sinkronisasi. Mengimplementasikan thread dan mencegah race condition dengan mutex/semaphore.6PK G]=|*ppt/notesSlides/_rels/notesSlide6.xml.rels PK G]`v!v!ppt/slides/slide7.xml P2 | Materi PokokProses vs thread; siklus hidup threadPthreads / threading PythonCritical section dan race conditionMutex, lock, dan semaphorePraktik: thread-safe counterAktivitas & PenilaianCoding implementasi thread | Unjuk Kerja (5%)Durasi: 150 menitSub-CPMK: SUB-CPMK-02 7PK G]d ppt/slides/_rels/slide7.xml.rels PK G];]ppt/notesSlides/notesSlide7.xml Jelaskan tiap poin dengan contoh. Mengimplementasikan thread dan mencegah race condition dengan mutex/semaphore.7PK G]|g*ppt/notesSlides/_rels/notesSlide7.xml.rels PK G]/H-H-ppt/slides/slide8.xml P2 | Praktikum: VS Code + gcc (Pthreads)kode.c / terminal#include <pthread.h>int c = 0; pthread_mutex_t m;void* work(void* a) { for (int i=0;i<100000;i++) { pthread_mutex_lock(&m); c++; pthread_mutex_unlock(&m); } return NULL; }$ gcc counter.c -o counter -lpthread$ ./counterOUTPUTTanpa mutex : c = 183422 (salah)Dengan mutex: c = 400000 (benar) 8PK G]4  ppt/slides/_rels/slide8.xml.rels PK G]2 ppt/notesSlides/notesSlide8.xml Demonstrasikan langkah praktikum pada VS Code + gcc (Pthreads), lalu mahasiswa mengulang secara mandiri.8PK G]pO*ppt/notesSlides/_rels/notesSlide8.xml.rels PK G]Rppt/slides/slide9.xml PERTEMUAN 3Advanced SynchronizationSUB-CPMK-02 | Tujuan: Mendeteksi dan memperbaiki race condition, deadlock, dan starvation.Dosen: Nurhasan Nugroho, S.T., M.Kom. 9PK G]l ppt/slides/_rels/slide9.xml.rels PK G]4=ppt/notesSlides/notesSlide9.xml Pertemuan 3: Advanced Synchronization. Mendeteksi dan memperbaiki race condition, deadlock, dan starvation.9PK G]1*ppt/notesSlides/_rels/notesSlide9.xml.rels PK G]oxk!k!ppt/slides/slide10.xml P3 | Materi PokokDeadlock: 4 kondisi CoffmanCondition variable dan monitorProducer-Consumer, Readers-WritersDining PhilosophersTools: ThreadSanitizer, HelgrindAktivitas & PenilaianDebugging race condition | Unjuk Kerja (5%)Durasi: 150 menitSub-CPMK: SUB-CPMK-02 10PK G]T!ppt/slides/_rels/slide10.xml.rels PK G]A ppt/notesSlides/notesSlide10.xml Jelaskan tiap poin dengan contoh. Mendeteksi dan memperbaiki race condition, deadlock, dan starvation.10PK G]T+ppt/notesSlides/_rels/notesSlide10.xml.rels PK G]s00ppt/slides/slide11.xml P3 | Praktikum: gcc -fsanitize=thread / Valgrindkode.c / terminalsem_t empty, full; pthread_mutex_t mx;void* producer(void* a){ sem_wait(&empty); pthread_mutex_lock(&mx); buf[in++ % N] = item; pthread_mutex_unlock(&mx); sem_post(&full);}$ gcc -g -fsanitize=thread pc.c -o pc -lpthread$ ./pcOUTPUTWARNING: ThreadSanitizer: data race (pid=4121) Write of size 4 at pc.c:12Setelah perbaikan: 0 warnings 11PK G]'d!ppt/slides/_rels/slide11.xml.rels PK G]>L ppt/notesSlides/notesSlide11.xml Demonstrasikan langkah praktikum pada gcc -fsanitize=thread / Valgrind, lalu mahasiswa mengulang secara mandiri.11PK G]O+ppt/notesSlides/_rels/notesSlide11.xml.rels PK G]〱/ppt/slides/slide12.xml PERTEMUAN 4Pemrograman OpenMPSUB-CPMK-03 | Tujuan: Memparalelkan algoritma sekuensial dengan direktif OpenMP.Dosen: Nurhasan Nugroho, S.T., M.Kom. 12PK G]ͥ!ppt/slides/_rels/slide12.xml.rels PK G],*j ppt/notesSlides/notesSlide12.xml Pertemuan 4: Pemrograman OpenMP. Memparalelkan algoritma sekuensial dengan direktif OpenMP.12PK G]Fb+ppt/notesSlides/_rels/notesSlide12.xml.rels PK G]˦Y!!ppt/slides/slide13.xml P4 | Materi PokokModel fork-join dan shared memory#pragma omp parallel / parallel forKlausa: private, shared, reductionschedule(static|dynamic|guided)Menghindari race conditionAktivitas & PenilaianParalelisasi algoritma sekuensial | Unjuk Kerja (10%)Durasi: 150 menitSub-CPMK: SUB-CPMK-03 13PK G]( !ppt/slides/_rels/slide13.xml.rels PK G]b  ppt/notesSlides/notesSlide13.xml Jelaskan tiap poin dengan contoh. Memparalelkan algoritma sekuensial dengan direktif OpenMP.13PK G]yv+ppt/notesSlides/_rels/notesSlide13.xml.rels PK G]eRP..ppt/slides/slide14.xml P4 | Praktikum: VS Code + gcc -fopenmpkode.c / terminal#include <omp.h>double s = 0.0; long n = 100000000;#pragma omp parallel for reduction(+:s)for (long i = 0; i < n; i++) { double x = (i + 0.5) / n; s += 4.0 / (1.0 + x * x);}printf("pi = %.8f\n", s / n);$ gcc -fopenmp pi.c -o pi$ OMP_NUM_THREADS=4 ./piOUTPUTpi = 3.14159265Serial : 0.92 s4 thread : 0.25 s 14PK G]_=!ppt/slides/_rels/slide14.xml.rels PK G]$ ppt/notesSlides/notesSlide14.xml Demonstrasikan langkah praktikum pada VS Code + gcc -fopenmp, lalu mahasiswa mengulang secara mandiri.14PK G]?ݤ+ppt/notesSlides/_rels/notesSlide14.xml.rels PK G]Fppt/slides/slide15.xml PERTEMUAN 5Optimasi OpenMPSUB-CPMK-03 | Tujuan: Menganalisis speedup dan efisiensi serta mengoptimasi kode OpenMP.Dosen: Nurhasan Nugroho, S.T., M.Kom. 15PK G]x!ppt/slides/_rels/slide15.xml.rels PK G]]=% ppt/notesSlides/notesSlide15.xml Pertemuan 5: Optimasi OpenMP. Menganalisis speedup dan efisiensi serta mengoptimasi kode OpenMP.15PK G]$Q+ppt/notesSlides/_rels/notesSlide15.xml.rels PK G]h*"|!|!ppt/slides/slide16.xml P5 | Materi PokokSpeedup S = Ts/Tp; Efisiensi E = S/pLoad balancing dan false sharingOverhead sinkronisasi (critical vs atomic)Pengukuran omp_get_wtime()Skalabilitas kuat vs lemahAktivitas & PenilaianLaporan analisis performa | Laporan (5%)Durasi: 150 menitSub-CPMK: SUB-CPMK-03 16PK G]PS!ppt/slides/_rels/slide16.xml.rels PK G]:5v ppt/notesSlides/notesSlide16.xml Jelaskan tiap poin dengan contoh. Menganalisis speedup dan efisiensi serta mengoptimasi kode OpenMP.16PK G] y+ppt/notesSlides/_rels/notesSlide16.xml.rels PK G]v+++ppt/slides/slide17.xml P5 | Praktikum: Jupyter/Excel untuk grafik speedupkode.c / terminaldouble t0 = omp_get_wtime();#pragma omp parallel for schedule(dynamic,1000)for (long i=0;i<n;i++) a[i]=f(i);double t1 = omp_get_wtime();printf("T=%.3f s\n", t1-t0);$ for t in 1 2 4 8; do OMP_NUM_THREADS=$t ./pi; doneOUTPUTThread Waktu Speedup Efisiensi 1 0.92 1.00 100% 2 0.49 1.88 94% 4 0.25 3.68 92% 8 0.15 6.13 77% 17PK G]w6e!ppt/slides/_rels/slide17.xml.rels PK G] 0 ppt/notesSlides/notesSlide17.xml Demonstrasikan langkah praktikum pada Jupyter/Excel untuk grafik speedup, lalu mahasiswa mengulang secara mandiri.17PK G]BI+ppt/notesSlides/_rels/notesSlide17.xml.rels PK G]K?x!ppt/slides/slide18.xml PERTEMUAN 6Pemrograman MPISUB-CPMK-04 | Tujuan: Membangun komunikasi point-to-point dengan MPI.Dosen: Nurhasan Nugroho, S.T., M.Kom. 18PK G]=!ppt/slides/_rels/slide18.xml.rels PK G]ɐ ppt/notesSlides/notesSlide18.xml Pertemuan 6: Pemrograman MPI. Membangun komunikasi point-to-point dengan MPI.18PK G]N+ppt/notesSlides/_rels/notesSlide18.xml.rels PK G]Z!!ppt/slides/slide19.xml P6 | Materi PokokModel message passing, rank, dan communicatorMPI_Init, MPI_Comm_rank, MPI_Comm_sizeMPI_Send / MPI_Recv (blocking)MPI_Isend / MPI_Irecv (non-blocking)Menghindari deadlockAktivitas & PenilaianKomunikasi point-to-point | Unjuk Kerja (10%)Durasi: 150 menitSub-CPMK: SUB-CPMK-04 19PK G]X!ppt/slides/_rels/slide19.xml.rels PK G]Y ppt/notesSlides/notesSlide19.xml Jelaskan tiap poin dengan contoh. Membangun komunikasi point-to-point dengan MPI.19PK G]i+ppt/notesSlides/_rels/notesSlide19.xml.rels PK G]8ɖ--ppt/slides/slide20.xml P6 | Praktikum: Terminal + OpenMPI (mpicc, mpirun)kode.c / terminalMPI_Init(&argc,&argv);MPI_Comm_rank(MPI_COMM_WORLD,&r);if (r == 0) { int v = 42; MPI_Send(&v,1,MPI_INT,1,0,MPI_COMM_WORLD);} else if (r == 1) { int v; MPI_Recv(&v,1,MPI_INT,0,0,MPI_COMM_WORLD, MPI_STATUS_IGNORE); printf("Rank 1 menerima %d\n", v); }$ mpicc hello.c -o hello$ mpirun -np 4 ./helloOUTPUTRank 1 menerima 42Rank 0 selesai kirim 20PK G]Ssa!ppt/slides/_rels/slide20.xml.rels PK G]ȩ ppt/notesSlides/notesSlide20.xml Demonstrasikan langkah praktikum pada Terminal + OpenMPI (mpicc, mpirun), lalu mahasiswa mengulang secara mandiri.20PK G]SB+ppt/notesSlides/_rels/notesSlide20.xml.rels PK G]!ppt/slides/slide21.xml PERTEMUAN 7MPI Collective CommunicationSUB-CPMK-04 | Tujuan: Mengimplementasikan operasi kolektif MPI secara efisien.Dosen: Nurhasan Nugroho, S.T., M.Kom. 21PK G]tV!ppt/slides/_rels/slide21.xml.rels PK G]s  ppt/notesSlides/notesSlide21.xml Pertemuan 7: MPI Collective Communication. Mengimplementasikan operasi kolektif MPI secara efisien.21PK G]HΩ+ppt/notesSlides/_rels/notesSlide21.xml.rels PK G]zcl!l!ppt/slides/slide22.xml P7 | Materi PokokMPI_Bcast, MPI_Scatter, MPI_GatherMPI_Reduce dan MPI_AllreduceMPI_BarrierPemilihan algoritma kolektifStudi kasus: perkalian matriks / jumlah paralelAktivitas & PenilaianAlgoritma kolektif | Unjuk Kerja (10%)Durasi: 150 menitSub-CPMK: SUB-CPMK-04 22PK G]\{H!ppt/slides/_rels/slide22.xml.rels PK G]~7 ppt/notesSlides/notesSlide22.xml Jelaskan tiap poin dengan contoh. Mengimplementasikan operasi kolektif MPI secara efisien.22PK G]aeZ+ppt/notesSlides/_rels/notesSlide22.xml.rels PK G]fm>**ppt/slides/slide23.xml P7 | Praktikum: Terminal + OpenMPIkode.c / terminalint local = rank + 1, total;MPI_Reduce(&local,&total,1,MPI_INT, MPI_SUM,0,MPI_COMM_WORLD);if (rank == 0) printf("Total = %d\n", total);MPI_Bcast(&total,1,MPI_INT,0,MPI_COMM_WORLD);$ mpicc reduce.c -o reduce$ mpirun -np 4 ./reduceOUTPUTTotal = 10(1 + 2 + 3 + 4) 23PK G]{m9!ppt/slides/_rels/slide23.xml.rels PK G]B ppt/notesSlides/notesSlide23.xml Demonstrasikan langkah praktikum pada Terminal + OpenMPI, lalu mahasiswa mengulang secara mandiri.23PK G] ~t+ppt/notesSlides/_rels/notesSlide23.xml.rels PK G]dppt/slides/slide24.xml PERTEMUAN 8Ujian Tengah Semester (UTS)Pertemuan 1-7 | Tujuan: Mengukur pemahaman arsitektur paralel, multithreading, sinkronisasi, OpenMP, dan MPI.Dosen: Nurhasan Nugroho, S.T., M.Kom. 24PK G] )u!ppt/slides/_rels/slide24.xml.rels PK G]J ppt/notesSlides/notesSlide24.xml Pertemuan 8: Ujian Tengah Semester (UTS). Mengukur pemahaman arsitektur paralel, multithreading, sinkronisasi, OpenMP, dan MPI.24PK G]8+ppt/notesSlides/_rels/notesSlide24.xml.rels PK G]Y$!!ppt/slides/slide25.xml P8 | Materi PokokTaksonomi Flynn, Amdahl, dan arsitektur memoriThread, mutex, semaphore, deadlockOpenMP: direktif, klausa, speedupMPI: point-to-point dan kolektifAnalisis dan sintesis antar-topikAktivitas & PenilaianUjian Tertulis 150 menit | Tes (15%)Durasi: 150 menitSub-CPMK: Pertemuan 1-7 25PK G]+LP!ppt/slides/_rels/slide25.xml.rels PK G]/ ppt/notesSlides/notesSlide25.xml Jelaskan tiap poin dengan contoh. Mengukur pemahaman arsitektur paralel, multithreading, sinkronisasi, OpenMP, dan MPI.25PK G]#+ppt/notesSlides/_rels/notesSlide25.xml.rels PK G]ppt/slides/slide26.xml PERTEMUAN 9Replikasi dan KonsistensiSUB-CPMK-05 | Tujuan: Menganalisis mekanisme replikasi dan konsistensi data.Dosen: Nurhasan Nugroho, S.T., M.Kom. 26PK G]N!ppt/slides/_rels/slide26.xml.rels PK G], ppt/notesSlides/notesSlide26.xml Pertemuan 9: Replikasi dan Konsistensi. Menganalisis mekanisme replikasi dan konsistensi data.26PK G]${+ppt/notesSlides/_rels/notesSlide26.xml.rels PK G]jv!v!ppt/slides/slide27.xml P9 | Materi PokokAlasan replikasi: ketersediaan dan performaReplikasi aktif vs pasif (primary-backup)Teorema CAP dan PACELCKuorum: R + W > NStudi kasus konsistensi dataAktivitas & PenilaianStudi kasus konsistensi | Partisipasi (5%)Durasi: 150 menitSub-CPMK: SUB-CPMK-05 27PK G]$kP!ppt/slides/_rels/slide27.xml.rels PK G]k ppt/notesSlides/notesSlide27.xml Jelaskan tiap poin dengan contoh. Menganalisis mekanisme replikasi dan konsistensi data.27PK G]e+ppt/notesSlides/_rels/notesSlide27.xml.rels PK G]s++ppt/slides/slide28.xml P9 | Praktikum: Docker Compose + Redis (primary-replica)kode.c / terminalservices: primary: { image: redis:7 } replica: image: redis:7 command: redis-server --replicaof primary 6379$ docker compose up -d$ docker exec replica redis-cli INFO replicationOUTPUTrole:slavemaster_host:primarymaster_link_status:upmaster_sync_in_progress:0 28PK G]~!ppt/slides/_rels/slide28.xml.rels PK G];   ppt/notesSlides/notesSlide28.xml Demonstrasikan langkah praktikum pada Docker Compose + Redis (primary-replica), lalu mahasiswa mengulang secara mandiri.28PK G]i+ppt/notesSlides/_rels/notesSlide28.xml.rels PK G]p3ppt/slides/slide29.xml PERTEMUAN 10Model KonsistensiSUB-CPMK-05 | Tujuan: Memilih model konsistensi berdasarkan trade-off performa dan ketersediaan.Dosen: Nurhasan Nugroho, S.T., M.Kom. 29PK G][2!ppt/slides/_rels/slide29.xml.rels PK G]P ppt/notesSlides/notesSlide29.xml Pertemuan 10: Model Konsistensi. Memilih model konsistensi berdasarkan trade-off performa dan ketersediaan.29PK G](Lk+ppt/notesSlides/_rels/notesSlide29.xml.rels PK G];>Ō!!ppt/slides/slide30.xml P10 | Materi PokokStrong, sequential, causal consistencyEventual consistencyClient-centric: read-your-writes, monotonic readsTrade-off latensi vs ketersediaanContoh: Cassandra, DynamoDB, ZooKeeperAktivitas & PenilaianAnalisis model konsistensi | Tugas (5%)Durasi: 150 menitSub-CPMK: SUB-CPMK-05 30PK G]]'!ppt/slides/_rels/slide30.xml.rels PK G])EN ppt/notesSlides/notesSlide30.xml Jelaskan tiap poin dengan contoh. Memilih model konsistensi berdasarkan trade-off performa dan ketersediaan.30PK G]+ppt/notesSlides/_rels/notesSlide30.xml.rels PK G]a2((ppt/slides/slide31.xml P10 | Praktikum: Simulasi Python / Cassandra cqlshkode.c / terminalN, W, R = 3, 2, 2strong = (R + W) > Nprint("Quorum", (W, R), "strong:", strong)N, W, R = 3, 1, 1print("Quorum", (W, R), "strong:", (R+W) > N)$ python3 quorum.pyOUTPUTQuorum (2, 2) strong: TrueQuorum (1, 1) strong: False-> eventual consistency 31PK G]zBE!ppt/slides/_rels/slide31.xml.rels PK G]. ppt/notesSlides/notesSlide31.xml Demonstrasikan langkah praktikum pada Simulasi Python / Cassandra cqlsh, lalu mahasiswa mengulang secara mandiri.31PK G]{+ppt/notesSlides/_rels/notesSlide31.xml.rels PK G]^Jppt/slides/slide32.xml PERTEMUAN 11Toleransi KegagalanSUB-CPMK-06 | Tujuan: Merancang sistem yang tahan terhadap kegagalan node.Dosen: Nurhasan Nugroho, S.T., M.Kom. 32PK G]R!ppt/slides/_rels/slide32.xml.rels PK G]M ppt/notesSlides/notesSlide32.xml Pertemuan 11: Toleransi Kegagalan. Merancang sistem yang tahan terhadap kegagalan node.32PK G]|+ppt/notesSlides/_rels/notesSlide32.xml.rels PK G]6w!w!ppt/slides/slide33.xml P11 | Materi PokokJenis kegagalan: crash, omission, ByzantineDeteksi kegagalan: heartbeat dan timeoutRedundansi dan failoverKonsensus: Paxos dan RaftSimulasi kegagalan nodeAktivitas & PenilaianSimulasi kegagalan sistem | Observasi (5%)Durasi: 150 menitSub-CPMK: SUB-CPMK-06 33PK G]u!ppt/slides/_rels/slide33.xml.rels PK G]lN ppt/notesSlides/notesSlide33.xml Jelaskan tiap poin dengan contoh. Merancang sistem yang tahan terhadap kegagalan node.33PK G]=cu+ppt/notesSlides/_rels/notesSlide33.xml.rels PK G]LВ++ppt/slides/slide34.xml P11 | Praktikum: Docker + simulasi heartbeatkode.c / terminalwhile True: for n in nodes: if time.time() - last[n] > TIMEOUT: print(f"[ALERT] {n} gagal") failover(n) time.sleep(1)$ docker stop node2$ python3 monitor.pyOUTPUT[OK] node1 hidup[ALERT] node2 gagal[INFO] failover -> node3 34PK G]!ppt/slides/_rels/slide34.xml.rels PK G]Dv ppt/notesSlides/notesSlide34.xml Demonstrasikan langkah praktikum pada Docker + simulasi heartbeat, lalu mahasiswa mengulang secara mandiri.34PK G]Ŷ+ppt/notesSlides/_rels/notesSlide34.xml.rels PK G]wppt/slides/slide35.xml PERTEMUAN 12Checkpointing dan RecoverySUB-CPMK-06 | Tujuan: Mengimplementasikan checkpointing dan recovery otomatis.Dosen: Nurhasan Nugroho, S.T., M.Kom. 35PK G]%,!ppt/slides/_rels/slide35.xml.rels PK G]  ppt/notesSlides/notesSlide35.xml Pertemuan 12: Checkpointing dan Recovery. Mengimplementasikan checkpointing dan recovery otomatis.35PK G]:+ppt/notesSlides/_rels/notesSlide35.xml.rels PK G]wJ}!}!ppt/slides/slide36.xml P12 | Materi PokokCheckpoint terkoordinasi vs independenMessage logging dan rollback recoveryFrekuensi checkpoint vs overheadWrite-ahead log (WAL)Praktik: simpan dan pulihkan stateAktivitas & PenilaianImplementasi recovery | Unjuk Kerja (5%)Durasi: 150 menitSub-CPMK: SUB-CPMK-06 36PK G] ut!ppt/slides/_rels/slide36.xml.rels PK G]NaG ppt/notesSlides/notesSlide36.xml Jelaskan tiap poin dengan contoh. Mengimplementasikan checkpointing dan recovery otomatis.36PK G]9z+ppt/notesSlides/_rels/notesSlide36.xml.rels PK G] //ppt/slides/slide37.xml P12 | Praktikum: Python + pickle / VS Codekode.c / terminalif os.path.exists("ckpt.pkl"): state = pickle.load(open("ckpt.pkl","rb"))else: state = {"i": 0, "sum": 0}for i in range(state["i"], 10**6): state["sum"] += i; state["i"] = i + 1 if i % 10**5 == 0: pickle.dump(state, open("ckpt.pkl","wb"))$ python3 ckpt.py$ kill -9 <PID> && python3 ckpt.pyOUTPUTMulai dari awal (i=0)^C proses dimatikanRecovery dari checkpoint i=300001Selesai, sum=499999500000 37PK G]*!ppt/slides/_rels/slide37.xml.rels PK G]#d ppt/notesSlides/notesSlide37.xml Demonstrasikan langkah praktikum pada Python + pickle / VS Code, lalu mahasiswa mengulang secara mandiri.37PK G]x"+ppt/notesSlides/_rels/notesSlide37.xml.rels PK G]{tԵppt/slides/slide38.xml PERTEMUAN 13Kerangka Kerja Data TerdistribusiSUB-CPMK-06 | Tujuan: Mereview framework pemrosesan data terdistribusi modern.Dosen: Nurhasan Nugroho, S.T., M.Kom. 38PK G]!ppt/slides/_rels/slide38.xml.rels PK G]Yg9 ppt/notesSlides/notesSlide38.xml Pertemuan 13: Kerangka Kerja Data Terdistribusi. Mereview framework pemrosesan data terdistribusi modern.38PK G]txu+ppt/notesSlides/_rels/notesSlide38.xml.rels PK G];\v!v!ppt/slides/slide39.xml P13 | Materi PokokMapReduce dan Hadoop (HDFS)Apache Spark: RDD dan DataFrameToleransi kegagalan: lineage dan replikasi blokStream processing: Kafka, FlinkDask / Ray untuk PythonAktivitas & PenilaianReview framework modern | Tugas (0%)Durasi: 150 menitSub-CPMK: SUB-CPMK-06 39PK G]~З!ppt/slides/_rels/slide39.xml.rels PK G]} ppt/notesSlides/notesSlide39.xml Jelaskan tiap poin dengan contoh. Mereview framework pemrosesan data terdistribusi modern.39PK G]5cj+ppt/notesSlides/_rels/notesSlide39.xml.rels PK G]JNry*y*ppt/slides/slide40.xml P13 | Praktikum: PySpark (Jupyter / spark-submit)kode.c / terminalfrom pyspark.sql import SparkSessionsc = SparkSession.builder.getOrCreate().sparkContextr = (sc.textFile("data.txt") .flatMap(lambda l: l.split()) .map(lambda w: (w, 1)) .reduceByKey(lambda a, b: a + b))print(r.take(5))$ spark-submit wordcount.py data.txtOUTPUT[('paralel', 12), ('sistem', 9), ('data', 7), ('node', 5), ('mpi', 4)] 40PK G]ۨ !ppt/slides/_rels/slide40.xml.rels PK G]"G ppt/notesSlides/notesSlide40.xml Demonstrasikan langkah praktikum pada PySpark (Jupyter / spark-submit), lalu mahasiswa mengulang secara mandiri.40PK G]]+ppt/notesSlides/_rels/notesSlide40.xml.rels PK G]^#lppt/slides/slide41.xml PERTEMUAN 14Proyek Akhir (Integrasi)SUB-CPMK-04 | Tujuan: Mengembangkan aplikasi terdistribusi yang mengintegrasikan OpenMP/MPI dan toleransi kegagalan.Dosen: Nurhasan Nugroho, S.T., M.Kom. 41PK G]Ҿ!ppt/slides/_rels/slide41.xml.rels PK G] ppt/notesSlides/notesSlide41.xml Pertemuan 14: Proyek Akhir (Integrasi). Mengembangkan aplikasi terdistribusi yang mengintegrasikan OpenMP/MPI dan toleransi kegagalan.41PK G]Fr+ppt/notesSlides/_rels/notesSlide41.xml.rels PK G]3]!!ppt/slides/slide42.xml P14 | Materi PokokMenentukan masalah dan arsitekturPembagian tugas tim dan GitImplementasi paralel + terdistribusiPengujian performa dan kegagalanDokumentasi dan etika/integritas akademikAktivitas & PenilaianPengembangan sistem | Presentasi (5%)Durasi: 150 menitSub-CPMK: SUB-CPMK-04 42PK G]!ppt/slides/_rels/slide42.xml.rels PK G]}i ppt/notesSlides/notesSlide42.xml Jelaskan tiap poin dengan contoh. Mengembangkan aplikasi terdistribusi yang mengintegrasikan OpenMP/MPI dan toleransi kegagalan.42PK G]/k+ppt/notesSlides/_rels/notesSlide42.xml.rels PK G] F)P*P*ppt/slides/slide43.xml P14 | Praktikum: Git + VS Code + mpirun (hybrid MPI+OpenMP)kode.c / terminal#pragma omp parallel forfor (int i = lo; i < hi; i++) work(i);MPI_Allreduce(&part,&all,1,MPI_DOUBLE, MPI_SUM,MPI_COMM_WORLD);if (rank == 0) save_checkpoint(all);$ git clone <repo> && make$ mpirun -np 4 --hostfile hosts ./appOUTPUT4 proses x 4 thread = 16 coreHasil benar, speedup 11.4xCheckpoint tersimpan 43PK G]rR!ppt/slides/_rels/slide43.xml.rels PK G]Ä́   ppt/notesSlides/notesSlide43.xml Demonstrasikan langkah praktikum pada Git + VS Code + mpirun (hybrid MPI+OpenMP), lalu mahasiswa mengulang secara mandiri.43PK G]npjq+ppt/notesSlides/_rels/notesSlide43.xml.rels PK G];ppt/slides/slide44.xml PERTEMUAN 15Presentasi ProyekSUB-CPMK-04 | Tujuan: Mendemonstrasikan aplikasi dan menganalisis kualitas sistem.Dosen: Nurhasan Nugroho, S.T., M.Kom. 44PK G]Ec!ppt/slides/_rels/slide44.xml.rels PK G]ִ; ppt/notesSlides/notesSlide44.xml Pertemuan 15: Presentasi Proyek. Mendemonstrasikan aplikasi dan menganalisis kualitas sistem.44PK G]6+ppt/notesSlides/_rels/notesSlide44.xml.rels PK G]h&ۈ!!ppt/slides/slide45.xml P15 | Materi PokokStruktur presentasi: masalah, desain, hasilDemo langsung dan skenario kegagalanAnalisis speedup dan skalabilitasTanya jawab dan refleksiKriteria: inovasi, efisiensi, ketepatanAktivitas & PenilaianDemonstrasi aplikasi | Presentasi (5%)Durasi: 150 menitSub-CPMK: SUB-CPMK-04 45PK G] !ppt/slides/_rels/slide45.xml.rels PK G]'  ppt/notesSlides/notesSlide45.xml Jelaskan tiap poin dengan contoh. Mendemonstrasikan aplikasi dan menganalisis kualitas sistem.45PK G]-3+ppt/notesSlides/_rels/notesSlide45.xml.rels PK G]G[  ppt/slides/slide46.xml PERTEMUAN 16Ujian Akhir Semester (UAS)Pertemuan 9-15 | Tujuan: Mengukur kemampuan analisis arsitektur dan mekanisme sistem terdistribusi.Dosen: Nurhasan Nugroho, S.T., M.Kom. 46PK G]!ppt/slides/_rels/slide46.xml.rels PK G]YB ppt/notesSlides/notesSlide46.xml Pertemuan 16: Ujian Akhir Semester (UAS). Mengukur kemampuan analisis arsitektur dan mekanisme sistem terdistribusi.46PK G]j~+ppt/notesSlides/_rels/notesSlide46.xml.rels PK G] /u!u!ppt/slides/slide47.xml P16 | Materi PokokReplikasi, konsistensi, dan CAPToleransi kegagalan, checkpointing, recoveryFramework data terdistribusiAnalisis komponen sistemSolusi dan validasi efisiensiAktivitas & PenilaianUjian Tertulis 150 menit | Tes (5%)Durasi: 150 menitSub-CPMK: Pertemuan 9-15 47PK G];!ppt/slides/_rels/slide47.xml.rels PK G]ms ppt/notesSlides/notesSlide47.xml Jelaskan tiap poin dengan contoh. Mengukur kemampuan analisis arsitektur dan mekanisme sistem terdistribusi.47PK G]+++ppt/notesSlides/_rels/notesSlide47.xml.rels PK G]5eppt/slides/slide48.xml Terima KasihNurhasan Nugroho, S.T., M.Kom.Universitas Bina Bangsa 48PK G]K!ppt/slides/_rels/slide48.xml.rels PK G]$ ppt/notesSlides/notesSlide48.xml 48PK G]'|+ppt/notesSlides/_rels/notesSlide48.xml.rels PK G]F`2"2"!ppt/slideMasters/slideMaster1.xml null PK G]7#XX,ppt/slideMasters/_rels/slideMaster1.xml.rels PK G]6TT!ppt/notesMasters/notesMaster1.xml 7/23/19Click to edit Master text stylesSecond levelThird levelFourth levelFifth level‹#›PK G]s **,ppt/notesMasters/_rels/notesMaster1.xml.rels PK G]_rels/PK G] $docProps/PK G]Kppt/PK G] mppt/_rels/PK G] ppt/charts/PK G]ppt/charts/_rels/PK G]ppt/embeddings/PK G] ppt/media/PK G]Bppt/slideLayouts/PK G]qppt/slideLayouts/_rels/PK G]ppt/slideMasters/PK G]ppt/slideMasters/_rels/PK G]  ppt/slides/PK G]3ppt/slides/_rels/PK G] bppt/theme/PK G]ppt/notesMasters/PK G]ppt/notesMasters/_rels/PK G]ppt/notesSlides/PK G]ppt/notesSlides/_rels/PK G]QXQXP[Content_Types].xmlPK G]]] [_rels/.relsPK G]pYӠ X^docProps/app.xmlPK G]nb''&idocProps/core.xmlPK G]ܱ&&|lppt/_rels/presentation.xml.relsPK G]Oݨ ߉ppt/theme/theme1.xmlPK G]⥙ުppt/presentation.xmlPK G]Xppt/presProps.xmlPK G]ppt/tableStyles.xmlPK G]D >00޿ppt/viewProps.xmlPK G]H7t!=ppt/slideLayouts/slideLayout1.xmlPK G]ђ77,+ppt/slideLayouts/_rels/slideLayout1.xml.relsPK G]* !ppt/slideLayouts/slideLayout2.xmlPK G]ђ77,ppt/slideLayouts/_rels/slideLayout2.xml.relsPK G]bX4MM+ppt/slides/slide1.xmlPK G]P ppt/slides/_rels/slide1.xml.relsPK G].ppt/notesSlides/notesSlide1.xmlPK G]:A*ppt/notesSlides/_rels/notesSlide1.xml.relsPK G]ôR>R>ppt/slides/slide2.xmlPK G] 4ppt/slides/_rels/slide2.xml.relsPK G](6ppt/notesSlides/notesSlide2.xmlPK G]xշ*<ppt/notesSlides/_rels/notesSlide2.xml.relsPK G] '77?ppt/slides/slide3.xmlPK G]  rRppt/slides/_rels/slide3.xml.relsPK G]?ww44~Tppt/notesSlides/notesSlide3.xmlPK G]9 Y*[ppt/notesSlides/_rels/notesSlide3.xml.relsPK G]}9ٹ!!^ppt/slides/slide4.xmlPK G]ի< ppt/slides/_rels/slide4.xml.relsPK G]ppt/notesSlides/notesSlide4.xmlPK G]J *Mppt/notesSlides/_rels/notesSlide4.xml.relsPK G],I.00`ppt/slides/slide5.xmlPK G]΄ ppt/slides/_rels/slide5.xml.relsPK G][bppt/notesSlides/notesSlide5.xmlPK G]Qe*ppt/notesSlides/_rels/notesSlide5.xml.relsPK G]6ppt/slides/slide6.xmlPK G]g +ppt/slides/_rels/slide6.xml.relsPK G]f  7ppt/notesSlides/notesSlide6.xmlPK G]=|*ppt/notesSlides/_rels/notesSlide6.xml.relsPK G]`v!v!ppt/slides/slide7.xmlPK G]d <ppt/slides/_rels/slide7.xml.relsPK G];]H ppt/notesSlides/notesSlide7.xmlPK G]|g*ppt/notesSlides/_rels/notesSlide7.xml.relsPK G]/H-H-ppt/slides/slide8.xmlPK G]4  Appt/slides/_rels/slide8.xml.relsPK G]2 Cppt/notesSlides/notesSlide8.xmlPK G]pO*TJppt/notesSlides/_rels/notesSlide8.xml.relsPK G]RgLppt/slides/slide9.xmlPK G]l _ppt/slides/_rels/slide9.xml.relsPK G]4=appt/notesSlides/notesSlide9.xmlPK G]1*hppt/notesSlides/_rels/notesSlide9.xml.relsPK G]oxk!k!jppt/slides/slide10.xmlPK G]T!ppt/slides/_rels/slide10.xml.relsPK G]A ppt/notesSlides/notesSlide10.xmlPK G]T+ѕppt/notesSlides/_rels/notesSlide10.xml.relsPK G]s00ppt/slides/slide11.xmlPK G]'d!ppt/slides/_rels/slide11.xml.relsPK G]>L ppt/notesSlides/notesSlide11.xmlPK G]O+ ppt/notesSlides/_rels/notesSlide11.xml.relsPK G]〱/ppt/slides/slide12.xmlPK G]ͥ!Bppt/slides/_rels/slide12.xml.relsPK G],*j Pppt/notesSlides/notesSlide12.xmlPK G]Fb+zppt/notesSlides/_rels/notesSlide12.xml.relsPK G]˦Y!!ppt/slides/slide13.xmlPK G]( !Ippt/slides/_rels/slide13.xml.relsPK G]b  Wppt/notesSlides/notesSlide13.xmlPK G]yv+ppt/notesSlides/_rels/notesSlide13.xml.relsPK G]eRP..ppt/slides/slide14.xmlPK G]_=!Nppt/slides/_rels/slide14.xml.relsPK G]$ Pppt/notesSlides/notesSlide14.xmlPK G]?ݤ+Wppt/notesSlides/_rels/notesSlide14.xml.relsPK G]F Zppt/slides/slide15.xmlPK G]x!3mppt/slides/_rels/slide15.xml.relsPK G]]=% Aoppt/notesSlides/notesSlide15.xmlPK G]$Q+pvppt/notesSlides/_rels/notesSlide15.xml.relsPK G]h*"|!|!xppt/slides/slide16.xmlPK G]PS!5ppt/slides/_rels/slide16.xml.relsPK G]:5v Cppt/notesSlides/notesSlide16.xmlPK G] y+vppt/notesSlides/_rels/notesSlide16.xml.relsPK G]v+++ppt/slides/slide17.xmlPK G]w6e!ppt/slides/_rels/slide17.xml.relsPK G] 0 ppt/notesSlides/notesSlide17.xmlPK G]BI+ppt/notesSlides/_rels/notesSlide17.xml.relsPK G]K?x!ppt/slides/slide18.xmlPK G]=!3ppt/slides/_rels/slide18.xml.relsPK G]ɐ Appt/notesSlides/notesSlide18.xmlPK G]N+]ppt/notesSlides/_rels/notesSlide18.xml.relsPK G]Z!!rppt/slides/slide19.xmlPK G]X!.ppt/slides/_rels/slide19.xml.relsPK G]Y <ppt/notesSlides/notesSlide19.xmlPK G]i+\&ppt/notesSlides/_rels/notesSlide19.xml.relsPK G]8ɖ--q(ppt/slides/slide20.xmlPK G]Ssa!;Vppt/slides/_rels/slide20.xml.relsPK G]ȩ IXppt/notesSlides/notesSlide20.xmlPK G]SB+_ppt/notesSlides/_rels/notesSlide20.xml.relsPK G]!appt/slides/slide21.xmlPK G]tV!tppt/slides/_rels/slide21.xml.relsPK G]s  vppt/notesSlides/notesSlide21.xmlPK G]HΩ+ ~ppt/notesSlides/_rels/notesSlide21.xml.relsPK G]zcl!l! ppt/slides/slide22.xmlPK G]\{H!ppt/slides/_rels/slide22.xml.relsPK G]~7 Σppt/notesSlides/notesSlide22.xmlPK G]aeZ+ppt/notesSlides/_rels/notesSlide22.xml.relsPK G]fm>** ppt/slides/slide23.xmlPK G]{m9!Eppt/slides/_rels/slide23.xml.relsPK G]B Sppt/notesSlides/notesSlide23.xmlPK G] ~t+ppt/notesSlides/_rels/notesSlide23.xml.relsPK G]dppt/slides/slide24.xmlPK G] )u!ppt/slides/_rels/slide24.xml.relsPK G]J ppt/notesSlides/notesSlide24.xmlPK G]8+?ppt/notesSlides/_rels/notesSlide24.xml.relsPK G]Y$!!Tppt/slides/slide25.xmlPK G]+LP!#ppt/slides/_rels/slide25.xml.relsPK G]/ %ppt/notesSlides/notesSlide25.xmlPK G]#+f,ppt/notesSlides/_rels/notesSlide25.xml.relsPK G]{.ppt/slides/slide26.xmlPK G]N!Appt/slides/_rels/slide26.xml.relsPK G], Cppt/notesSlides/notesSlide26.xmlPK G]${+Jppt/notesSlides/_rels/notesSlide26.xml.relsPK G]jv!v!Lppt/slides/slide27.xmlPK G]$kP!nppt/slides/_rels/slide27.xml.relsPK G]k pppt/notesSlides/notesSlide27.xmlPK G]e+wppt/notesSlides/_rels/notesSlide27.xml.relsPK G]s++yppt/slides/slide28.xmlPK G]~!ppt/slides/_rels/slide28.xml.relsPK G];   ppt/notesSlides/notesSlide28.xmlPK G]i+ppt/notesSlides/_rels/notesSlide28.xml.relsPK G]p3ppt/slides/slide29.xmlPK G][2!Mppt/slides/_rels/slide29.xml.relsPK G]P [ppt/notesSlides/notesSlide29.xmlPK G](Lk+ppt/notesSlides/_rels/notesSlide29.xml.relsPK G];>Ō!!ppt/slides/slide30.xmlPK G]]'!jppt/slides/_rels/slide30.xml.relsPK G])EN xppt/notesSlides/notesSlide30.xmlPK G]+ppt/notesSlides/_rels/notesSlide30.xml.relsPK G]a2((ppt/slides/slide31.xmlPK G]zBE!{%ppt/slides/_rels/slide31.xml.relsPK G]. 'ppt/notesSlides/notesSlide31.xmlPK G]{+.ppt/notesSlides/_rels/notesSlide31.xml.relsPK G]^J0ppt/slides/slide32.xmlPK G]R!Cppt/slides/_rels/slide32.xml.relsPK G]M Fppt/notesSlides/notesSlide32.xmlPK G]|+2Mppt/notesSlides/_rels/notesSlide32.xml.relsPK G]6w!w!GOppt/slides/slide33.xmlPK G]u!pppt/slides/_rels/slide33.xml.relsPK G]lN sppt/notesSlides/notesSlide33.xmlPK G]=cu+%zppt/notesSlides/_rels/notesSlide33.xml.relsPK G]LВ++:|ppt/slides/slide34.xmlPK G]!ppt/slides/_rels/slide34.xml.relsPK G]Dv ppt/notesSlides/notesSlide34.xmlPK G]Ŷ+Hppt/notesSlides/_rels/notesSlide34.xml.relsPK G]w]ppt/slides/slide35.xmlPK G]%,!ppt/slides/_rels/slide35.xml.relsPK G]  ppt/notesSlides/notesSlide35.xmlPK G]:+ppt/notesSlides/_rels/notesSlide35.xml.relsPK G]wJ}!}!ppt/slides/slide36.xmlPK G] ut!ppt/slides/_rels/slide36.xml.relsPK G]NaG ppt/notesSlides/notesSlide36.xmlPK G]9z+ppt/notesSlides/_rels/notesSlide36.xml.relsPK G] //ppt/slides/slide37.xmlPK G]*!.ppt/slides/_rels/slide37.xml.relsPK G]#d 0ppt/notesSlides/notesSlide37.xmlPK G]x"+8ppt/notesSlides/_rels/notesSlide37.xml.relsPK G]{tԵ:ppt/slides/slide38.xmlPK G]!HMppt/slides/_rels/slide38.xml.relsPK G]Yg9 VOppt/notesSlides/notesSlide38.xmlPK G]txu+Vppt/notesSlides/_rels/notesSlide38.xml.relsPK G];\v!v!Xppt/slides/slide39.xmlPK G]~З!Mzppt/slides/_rels/slide39.xml.relsPK G]} [|ppt/notesSlides/notesSlide39.xmlPK G]5cj+ppt/notesSlides/_rels/notesSlide39.xml.relsPK G]JNry*y*ppt/slides/slide40.xmlPK G]ۨ !Fppt/slides/_rels/slide40.xml.relsPK G]"G Tppt/notesSlides/notesSlide40.xmlPK G]]+ppt/notesSlides/_rels/notesSlide40.xml.relsPK G]^#lppt/slides/slide41.xmlPK G]Ҿ!ppt/slides/_rels/slide41.xml.relsPK G] ppt/notesSlides/notesSlide41.xmlPK G]Fr+Zppt/notesSlides/_rels/notesSlide41.xml.relsPK G]3]!!oppt/slides/slide42.xmlPK G]!$ppt/slides/_rels/slide42.xml.relsPK G]}i 2ppt/notesSlides/notesSlide42.xmlPK G]/k+ppt/notesSlides/_rels/notesSlide42.xml.relsPK G] F)P*P*ppt/slides/slide43.xmlPK G]rR!2ppt/slides/_rels/slide43.xml.relsPK G]Ä́   (4ppt/notesSlides/notesSlide43.xmlPK G]npjq+q;ppt/notesSlides/_rels/notesSlide43.xml.relsPK G];=ppt/slides/slide44.xmlPK G]Ec!Pppt/slides/_rels/slide44.xml.relsPK G]ִ; Rppt/notesSlides/notesSlide44.xmlPK G]6+Yppt/notesSlides/_rels/notesSlide44.xml.relsPK G]h&ۈ!![ppt/slides/slide45.xmlPK G] !}ppt/slides/_rels/slide45.xml.relsPK G]'  ppt/notesSlides/notesSlide45.xmlPK G]-3+ppt/notesSlides/_rels/notesSlide45.xml.relsPK G]G[  ppt/slides/slide46.xmlPK G]!Gppt/slides/_rels/slide46.xml.relsPK G]YB Uppt/notesSlides/notesSlide46.xmlPK G]j~+ppt/notesSlides/_rels/notesSlide46.xml.relsPK G] /u!u!ppt/slides/slide47.xmlPK G];!Vppt/slides/_rels/slide47.xml.relsPK G]ms dppt/notesSlides/notesSlide47.xmlPK G]+++ppt/notesSlides/_rels/notesSlide47.xml.relsPK G]5eppt/slides/slide48.xmlPK G]K!ppt/slides/_rels/slide48.xml.relsPK G]$ ppt/notesSlides/notesSlide48.xmlPK G]'|+ppt/notesSlides/_rels/notesSlide48.xml.relsPK G]F`2"2"!ppt/slideMasters/slideMaster1.xmlPK G]7#XX,Q ppt/slideMasters/_rels/slideMaster1.xml.relsPK G]6TT! ppt/notesMasters/notesMaster1.xmlPK G]s **,0 ppt/notesMasters/_rels/notesMaster1.xml.relsPKgD1