CSC/ECE 506 Spring 2014/12b ds - Revision history

Snshah4: /* References */

2014-04-24T01:30:54Z

References

← Older revision		Revision as of 01:30, 24 April 2014
Line 371:		Line 371:
	[18] http://ieeexplore.ieee.org.prox.lib.ncsu.edu/xpls/icp.jsp?arnumber=5090624		[18] http://ieeexplore.ieee.org.prox.lib.ncsu.edu/xpls/icp.jsp?arnumber=5090624

	[19] Mikkel B. Stenssgard and Jens Sparso, [http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=4492725&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D4492725 ReNoC: A Network-on-Chip Architecture with Reconfigurable Topology], ''Second ACM/IEEE International Symposium on Networks on Chip''		[19] Mikkel B. Stenssgard and Jens Sparso, [http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=4492725&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D4492725 ReNoC: A Network-on-Chip Architecture with Reconfigurable Topology], ''Second ACM/IEEE International Symposium on Networks on Chip'', 2008

	==Quiz==		==Quiz==

Snshah4: /* CHIPPER (Cheap-Interconnect Partially Permuting Router) */

2014-04-24T01:27:16Z

CHIPPER (Cheap-Interconnect Partially Permuting Router)

← Older revision		Revision as of 01:27, 24 April 2014
Line 267:		Line 267:

	This protocol was designed to address inefficient port allocation in the BLESS protocol. A permutation network directs deflected flits to free output ports. By limiting the requirements so that only that the highest-priority flit obtains its request, we can prevent livelock. In the case of contention, arbitration logic chooses a winning flit. It does this by choosing a single packet, and prioritize that packet globally above all other packets for long enough that its delivery is ensured. Every packet in the system eventually receives this special status, so every packet is eventually delivered (the Golden Packet scheme).[[#References\|[11]]]		This protocol was designed to address inefficient port allocation in the BLESS protocol. A permutation network directs deflected flits to free output ports. By limiting the requirements so that only that the highest-priority flit obtains its request, we can prevent livelock. In the case of contention, arbitration logic chooses a winning flit. It does this by choosing a single packet, and prioritize that packet globally above all other packets for long enough that its delivery is ensured. Every packet in the system eventually receives this special status, so every packet is eventually delivered (the Golden Packet scheme).[[#References\|[11]]]

	The following graph shows a performance comparison of buffered routing protocols with the buffered protocol:[[#References\|[11]]]		The following graph shows a performance comparison of buffered routing protocols with the buffered protocol:[[#References\|[11]]]

Snshah4: /* CHIPPER (Cheap-Interconnect Partially Permuting Router) */

2014-04-24T01:26:46Z

CHIPPER (Cheap-Interconnect Partially Permuting Router)

← Older revision		Revision as of 01:26, 24 April 2014
Line 269:		Line 269:

	The following graph shows a performance comparison of buffered routing protocols with the buffered protocol:[[#References\|[11]]]		The following graph shows a performance comparison of buffered routing protocols with the buffered protocol:[[#References\|[11]]]

	[[File:Bufferless.png\|1900px\|thumb\|center\|Performance statistics for Bufferless Routing protocols]]		[[File:Bufferless.png\|1900px\|thumb\|center\|Performance statistics for Bufferless Routing protocols]]

Snshah4: /* Cut-Through routing or Worm Hole routing */

2014-04-24T01:24:03Z

Cut-Through routing or Worm Hole routing

← Older revision		Revision as of 01:24, 24 April 2014
Line 212:		Line 212:

	[[File:Cut_Through.gif\|900px\|thumb\|center\|'''Cut-Through Routing Scheme''' ''t<sub>r</sub>'' = time of routing decision within one router during building a routing path, ''t<sub>w</sub>'' = intra-router switching latency once the router has made the routing decision and a path has been set up through the router, ''t<sub>m</sub>'' = inter-router channel latency. (a) The header flit has moved into the output buffer of the first router. (b) The header has cut through into the second router while subsequent flits are following its path. (c) Pulling a chain of flits behind, the header has cut through into a router where its output buffer is reserved for another communication. (d) The whole chain of packet flits has contracted and the whole packet gets buffered in the first router releasing all previously allocated links. (e) Flit pipeline moving towards the destination.]]		[[File:Cut_Through.gif\|900px\|thumb\|center\|'''Cut-Through Routing Scheme''' ''t<sub>r</sub>'' = time of routing decision within one router during building a routing path, ''t<sub>w</sub>'' = intra-router switching latency once the router has made the routing decision and a path has been set up through the router, ''t<sub>m</sub>'' = inter-router channel latency. (a) The header flit has moved into the output buffer of the first router. (b) The header has cut through into the second router while subsequent flits are following its path. (c) Pulling a chain of flits behind, the header has cut through into a router where its output buffer is reserved for another communication. (d) The whole chain of packet flits has contracted and the whole packet gets buffered in the first router releasing all previously allocated links. (e) Flit pipeline moving towards the destination.]]


	'''Communication Latency for Cut Through Routing:'''		'''Communication Latency for Cut Through Routing:'''
	A packet of length ''M'' transmitted to distance ''d'' takes time ''t<sub>CT</sub>'' as given below:		A packet of length ''M'' transmitted to distance ''d'' takes time ''t<sub>CT</sub>'' as given below:

	<div class="center" style="width: auto; margin-left: auto; margin-right: auto;">''t<sub>CT</sub> = d(t<sub>r</sub> + t</sub>w</sub> + t<sub>m</sub>) + max(t<sub>w</sub> , t<sub>m</sub>)M''</div>		<div class="center" style="width: auto; margin-left: auto; margin-right: auto;">''t<sub>CT</sub> = d(t<sub>r</sub> + t<sub>w</sub> + t<sub>m</sub>) + max(t<sub>w</sub> , t<sub>m</sub>)M''</div>

	====[http://en.wikipedia.org/wiki/Deterministic_routing Deterministic routing]====		====[http://en.wikipedia.org/wiki/Deterministic_routing Deterministic routing]====

Snshah4: /* Cut-Through routing or Worm Hole routing */

2014-04-24T01:23:33Z

Cut-Through routing or Worm Hole routing

← Older revision		Revision as of 01:23, 24 April 2014
Line 212:		Line 212:

	[[File:Cut_Through.gif\|900px\|thumb\|center\|'''Cut-Through Routing Scheme''' ''t<sub>r</sub>'' = time of routing decision within one router during building a routing path, ''t<sub>w</sub>'' = intra-router switching latency once the router has made the routing decision and a path has been set up through the router, ''t<sub>m</sub>'' = inter-router channel latency. (a) The header flit has moved into the output buffer of the first router. (b) The header has cut through into the second router while subsequent flits are following its path. (c) Pulling a chain of flits behind, the header has cut through into a router where its output buffer is reserved for another communication. (d) The whole chain of packet flits has contracted and the whole packet gets buffered in the first router releasing all previously allocated links. (e) Flit pipeline moving towards the destination.]]		[[File:Cut_Through.gif\|900px\|thumb\|center\|'''Cut-Through Routing Scheme''' ''t<sub>r</sub>'' = time of routing decision within one router during building a routing path, ''t<sub>w</sub>'' = intra-router switching latency once the router has made the routing decision and a path has been set up through the router, ''t<sub>m</sub>'' = inter-router channel latency. (a) The header flit has moved into the output buffer of the first router. (b) The header has cut through into the second router while subsequent flits are following its path. (c) Pulling a chain of flits behind, the header has cut through into a router where its output buffer is reserved for another communication. (d) The whole chain of packet flits has contracted and the whole packet gets buffered in the first router releasing all previously allocated links. (e) Flit pipeline moving towards the destination.]]

			'''Communication Latency for Cut Through Routing:'''
			A packet of length ''M'' transmitted to distance ''d'' takes time ''t<sub>CT</sub>'' as given below:

			<div class="center" style="width: auto; margin-left: auto; margin-right: auto;">''t<sub>CT</sub> = d(t<sub>r</sub> + t</sub>w</sub> + t<sub>m</sub>) + max(t<sub>w</sub> , t<sub>m</sub>)M''</div>

	====[http://en.wikipedia.org/wiki/Deterministic_routing Deterministic routing]====		====[http://en.wikipedia.org/wiki/Deterministic_routing Deterministic routing]====

Snshah4: /* Store and forward routing */

2014-04-24T01:20:32Z

Store and forward routing

← Older revision		Revision as of 01:20, 24 April 2014
Line 204:		Line 204:

	'''Communication Latency for Store and Forward Routing:'''		'''Communication Latency for Store and Forward Routing:'''
	A packet of length ''M'' transmitted to distance ''d'' takes time t<sub>SF</sub> as given below:		A packet of length ''M'' transmitted to distance ''d'' takes time ''t<sub>SF</sub>'' as given below:

	<div class="center" style="width: auto; margin-left: auto; margin-right: auto;">''t<sub>SF</sub> = d(t<sub>r</sub> + (t<sub>w</sub> + t<sub>m</sub>)M)''</div>		<div class="center" style="width: auto; margin-left: auto; margin-right: auto;">''t<sub>SF</sub> = d(t<sub>r</sub> + (t<sub>w</sub> + t<sub>m</sub>)M)''</div>

Snshah4: /* Store and forward routing */

2014-04-24T01:19:51Z

Store and forward routing

← Older revision		Revision as of 01:19, 24 April 2014
Line 206:		Line 206:
	A packet of length ''M'' transmitted to distance ''d'' takes time t<sub>SF</sub> as given below:		A packet of length ''M'' transmitted to distance ''d'' takes time t<sub>SF</sub> as given below:

	''t<sub>SF</sub> = d(t<sub>r</sub> + (t<sub>w</sub> + t<sub>m</sub>)M)''		<div class="center" style="width: auto; margin-left: auto; margin-right: auto;">''t<sub>SF</sub> = d(t<sub>r</sub> + (t<sub>w</sub> + t<sub>m</sub>)M)''</div>

	====[http://en.wikipedia.org/wiki/Cut-through_switching Cut-Through routing] or [http://en.wikipedia.org/wiki/Wormhole_switching Worm Hole routing]====		====[http://en.wikipedia.org/wiki/Cut-through_switching Cut-Through routing] or [http://en.wikipedia.org/wiki/Wormhole_switching Worm Hole routing]====

Snshah4: /* Store and forward routing */

2014-04-24T01:17:49Z

Store and forward routing

← Older revision		Revision as of 01:17, 24 April 2014
Line 201:		Line 201:

	[[File:Store_Forward.gif\|700px\|thumb\|center\|'''Store and Forward Routing Scheme''' ''M'' = packet size (in flits), ''t<sub>r</sub>'' = time of routing decision within one router during building a routing path, ''t<sub>w</sub>'' = intra-router switching latency once the router has made the routing decision and a path has been set up through the router, ''t<sub>m</sub>'' = inter-router channel latency. The transmission latency of a packet of ''M'' flits between two adjacent routers is ''Mt<sub>m</sub>'' seconds.(a) Routing decision is being made in the first router. (b) The packet is performing the first hop to the second router after has been copied to the output buffer of the first router. (c) The whole packet after the second hop.]]		[[File:Store_Forward.gif\|700px\|thumb\|center\|'''Store and Forward Routing Scheme''' ''M'' = packet size (in flits), ''t<sub>r</sub>'' = time of routing decision within one router during building a routing path, ''t<sub>w</sub>'' = intra-router switching latency once the router has made the routing decision and a path has been set up through the router, ''t<sub>m</sub>'' = inter-router channel latency. The transmission latency of a packet of ''M'' flits between two adjacent routers is ''Mt<sub>m</sub>'' seconds.(a) Routing decision is being made in the first router. (b) The packet is performing the first hop to the second router after has been copied to the output buffer of the first router. (c) The whole packet after the second hop.]]


	'''Communication Latency for Store and Forward Routing:'''		'''Communication Latency for Store and Forward Routing:'''
	A packet of length ''M'' transmitted to distance ''d'' takes time t<sub>SF</sub> as given below:		A packet of length ''M'' transmitted to distance ''d'' takes time t<sub>SF</sub> as given below:

	''t<sub>SF</sub>=d(t<sub>r</sub>+(t<sub>w</sub>+t<sub>m</sub>)M)''		''t<sub>SF</sub> = d(t<sub>r</sub> + (t<sub>w</sub> + t<sub>m</sub>)M)''

	====[http://en.wikipedia.org/wiki/Cut-through_switching Cut-Through routing] or [http://en.wikipedia.org/wiki/Wormhole_switching Worm Hole routing]====		====[http://en.wikipedia.org/wiki/Cut-through_switching Cut-Through routing] or [http://en.wikipedia.org/wiki/Wormhole_switching Worm Hole routing]====

Snshah4: /* Store and forward routing */

2014-04-24T01:16:05Z

Store and forward routing

← Older revision		Revision as of 01:16, 24 April 2014
Line 201:		Line 201:

	[[File:Store_Forward.gif\|700px\|thumb\|center\|'''Store and Forward Routing Scheme''' ''M'' = packet size (in flits), ''t<sub>r</sub>'' = time of routing decision within one router during building a routing path, ''t<sub>w</sub>'' = intra-router switching latency once the router has made the routing decision and a path has been set up through the router, ''t<sub>m</sub>'' = inter-router channel latency. The transmission latency of a packet of ''M'' flits between two adjacent routers is ''Mt<sub>m</sub>'' seconds.(a) Routing decision is being made in the first router. (b) The packet is performing the first hop to the second router after has been copied to the output buffer of the first router. (c) The whole packet after the second hop.]]		[[File:Store_Forward.gif\|700px\|thumb\|center\|'''Store and Forward Routing Scheme''' ''M'' = packet size (in flits), ''t<sub>r</sub>'' = time of routing decision within one router during building a routing path, ''t<sub>w</sub>'' = intra-router switching latency once the router has made the routing decision and a path has been set up through the router, ''t<sub>m</sub>'' = inter-router channel latency. The transmission latency of a packet of ''M'' flits between two adjacent routers is ''Mt<sub>m</sub>'' seconds.(a) Routing decision is being made in the first router. (b) The packet is performing the first hop to the second router after has been copied to the output buffer of the first router. (c) The whole packet after the second hop.]]

			'''Communication Latency for Store and Forward Routing:'''
			A packet of length ''M'' transmitted to distance ''d'' takes time t<sub>SF</sub> as given below:

			''t<sub>SF</sub>=d(t<sub>r</sub>+(t<sub>w</sub>+t<sub>m</sub>)M)''

	====[http://en.wikipedia.org/wiki/Cut-through_switching Cut-Through routing] or [http://en.wikipedia.org/wiki/Wormhole_switching Worm Hole routing]====		====[http://en.wikipedia.org/wiki/Cut-through_switching Cut-Through routing] or [http://en.wikipedia.org/wiki/Wormhole_switching Worm Hole routing]====

Dmswishe: added instructions.

2014-04-24T01:06:01Z

added instructions.

← Older revision		Revision as of 01:06, 24 April 2014
Line 2:		Line 2:
	__TOC__		__TOC__


			[https://docs.google.com/document/d/1B_FUoiCFMDZcRK5_0XonguArVqDnYt-b75wm_t58DyQ/edit Instructions here]

	[http://wiki.expertiza.ncsu.edu/index.php/CSC/ECE_506_Spring_2013/12b_dj Last Years wiki page ]		[http://wiki.expertiza.ncsu.edu/index.php/CSC/ECE_506_Spring_2013/12b_dj Last Years wiki page ]