﻿[Script Info] Title: [Events] Format: Layer, Start, End, Style, Name, MarginL, MarginR, MarginV, Effect, Text Dialogue: 0,0:00:00.00,0:00:04.00,Default,,0000,0000,0000,,Now let's look into the communication overhead required by parallel computing. Dialogue: 0,0:00:04.00,0:00:08.00,Default,,0000,0000,0000,,Assume that we have n-squared course or processors, Dialogue: 0,0:00:08.00,0:00:13.00,Default,,0000,0000,0000,,each of which handles its own square of our complete domain. Dialogue: 0,0:00:13.00,0:00:18.00,Default,,0000,0000,0000,,The complete domain should consist of l * l cells. Dialogue: 0,0:00:18.00,0:00:21.00,Default,,0000,0000,0000,,What would be a reasonable model for the time taken by the computation? Dialogue: 0,0:00:21.00,0:00:25.00,Default,,0000,0000,0000,,A constant C by the number of course or processors and squared Dialogue: 0,0:00:25.00,0:00:28.00,Default,,0000,0000,0000,,times the side length of the total domain plus another constant Dialogue: 0,0:00:28.00,0:00:30.00,Default,,0000,0000,0000,,times n times l? Dialogue: 0,0:00:30.00,0:00:36.00,Default,,0000,0000,0000,,Or constant times l-squared divided by n-squared plus another constant times (n - 1)? Dialogue: 0,0:00:36.00,0:00:41.00,Default,,0000,0000,0000,,Or the constant times n times l-squared minus a constant times n times l? Dialogue: 0,0:00:41.00,0:00:48.00,Default,,0000,0000,0000,,A constant times l-squared over n-squared plus a constant times (n - 1) times l-squared? Dialogue: 0,0:00:48.00,9:59:59.99,Default,,0000,0000,0000,,Pick one.