https://wiki.devclub.in/index.php?action=history&feed=atom&title=MTL415 2026-05-27T05:21:32Z Revision history for this page on the wiki MediaWiki 1.45.1 https://wiki.devclub.in/index.php?title=MTL415&diff=3512&oldid=prev 2026-04-14T16:42:34Z

<p>Bot: wrap bare course codes in wikilinks</p> <table style="background-color: #fff; color: #202122;" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 16:42, 14 April 2026</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l4">Line 4:</td> <td colspan="2" class="diff-lineno">Line 4:</td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| credits = 3</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| credits = 3</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| credit_structure = 3-0-0</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>| credit_structure = 3-0-0</div></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>| pre_requisites = MTL342</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>| pre_requisites = <ins style="font-weight: bold; text-decoration: none;">[[</ins>MTL342<ins style="font-weight: bold; text-decoration: none;">]]</ins></div></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>| overlaps = MTL765</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>| overlaps = <ins style="font-weight: bold; text-decoration: none;">[[</ins>MTL765<ins style="font-weight: bold; text-decoration: none;">]]</ins></div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>}}</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>}}</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== MTL415 : parallel Algorithms ==</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== MTL415 : parallel Algorithms ==</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>Parallel architecture: Shared/local memory systems, pipelining, hypercubes, mesh, linear array etc. Degree of parallelism, Speed-up and efficiency of a parallel algorithm. Principles of parallel algorithm design. Basic communication operations. Parallel algorithms: searching and sorting, matrix-vector and matrix-matrix multiplication for dense, band and triangular matrices. Parallel algorithms for direct methods for dense, band and triangular matrices. Cholesky method. Solving recurrence relations. Parallel iterative methods for finite difference equations of elliptic boundary value problems: point- Jacobi, line Jacobi, block Jacobi methods, 2 colour and multicolour Gauss-Seidel, SOR, SSOR methods. Domain decomposition method in one and two dimensions. Parallel preconditioned conjugate gradient methods. Quadrant interlocking factorization.</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>Parallel architecture: Shared/local memory systems, pipelining, hypercubes, mesh, linear array etc. Degree of parallelism, Speed-up and efficiency of a parallel algorithm. Principles of parallel algorithm design. Basic communication operations. Parallel algorithms: searching and sorting, matrix-vector and matrix-matrix multiplication for dense, band and triangular matrices. Parallel algorithms for direct methods for dense, band and triangular matrices. Cholesky method. Solving recurrence relations. Parallel iterative methods for finite difference equations of elliptic boundary value problems: point- Jacobi, line Jacobi, block Jacobi methods, 2 colour and multicolour Gauss-Seidel, SOR, SSOR methods. Domain decomposition method in one and two dimensions. Parallel preconditioned conjugate gradient methods. Quadrant interlocking factorization.</div></td></tr> </table>

DevanshKandpal https://wiki.devclub.in/index.php?title=MTL415&diff=1602&oldid=prev 2026-03-04T10:14:11Z

<p>Creating course page via bot</p> <p><b>New page</b></p><div>{{Infobox Course<br /> | code = MTL415<br /> | name = parallel Algorithms<br /> | credits = 3<br /> | credit_structure = 3-0-0<br /> | pre_requisites = MTL342<br /> | overlaps = MTL765<br /> }}<br /> <br /> == MTL415 : parallel Algorithms ==<br /> Parallel architecture: Shared/local memory systems, pipelining, hypercubes, mesh, linear array etc. Degree of parallelism, Speed-up and efficiency of a parallel algorithm. Principles of parallel algorithm design. Basic communication operations. Parallel algorithms: searching and sorting, matrix-vector and matrix-matrix multiplication for dense, band and triangular matrices. Parallel algorithms for direct methods for dense, band and triangular matrices. Cholesky method. Solving recurrence relations. Parallel iterative methods for finite difference equations of elliptic boundary value problems: point- Jacobi, line Jacobi, block Jacobi methods, 2 colour and multicolour Gauss-Seidel, SOR, SSOR methods. Domain decomposition method in one and two dimensions. Parallel preconditioned conjugate gradient methods. Quadrant interlocking factorization.</div>

Prashantt492