From 05642c312b9ef585baf29bbbe11b8f6c8266474b Mon Sep 17 00:00:00 2001
From: josh <josh@45c1a28c-8058-47b2-ae61-ca45b979098e>
Date: Thu, 20 Nov 2008 00:56:19 +0000
Subject: [PATCH] updated hw.tex for hw4

git-svn-id: svn://anubis/gvsu@236 45c1a28c-8058-47b2-ae61-ca45b979098e
---
 cs677/hw4/hw.tex | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/cs677/hw4/hw.tex b/cs677/hw4/hw.tex
index d1bdf72..ac79a1c 100644
--- a/cs677/hw4/hw.tex
+++ b/cs677/hw4/hw.tex
@@ -21,6 +21,16 @@
 \noindent
 \begin{enumerate}
 \item[1.]{
+    In store-and-forward communication, the communication cost is given by
+    $$T_{\mathrm{comm}} = t_s + (t_h + mt_w)\ell = t_s + \ell t_h + \ell mt_w$$
+    In cut-through routing, the communication cost is given by
+    $$T_{\mathrm{comm}} = t_s + \ell t_h + mt_w$$
+    Since the ``header'' is the only part of the communication that is
+    encountering overhead for the $\ell$ links in the communication network,
+    cut-through routing can save communication time on the order of
+    $(\ell - 1) mt_w$.
+    Obviously, this makes cut-through routing only advantageous on
+    architectures with $\ell > 1$, meaning non-fully-connected networks.
 }
 
 \vskip 1em