This preview shows page 1. Sign up to view the full content.
Unformatted text preview: � � �� ��
Solution: �
side of tree of meshes or areauniversal fattree: �� � �� �� (d) � ��� � � ����� � ���� �� depth of bitonic sorting network: ���� � ��
�
(e) � ��� � �� ����� � �� ��
Solution: depth of bitonic sorting network: ���� Solution: 6.896 Final Examination Name 4 Problem 2. Deﬁnitions (4 parts) [16 points] Give a onesentence description of each of the following terms to show that you know what they mean: (a) carrylookahead adder
Solution: Adding 2 Nbit numbers with � ��� hardware, � ��� �� depth. The idea is
to calculate the carries by doing parallel preﬁx in the “kpg” monoid.
(b) systolic circuit
Solution: a circuit formed of Moore machines. All state and communication with
neighboring processors is clocked.
(c) load factor � of a set � of messages on a network �. Solution: � � max� all cuts of R � number of msgs crossing the cut capacity of the cut (d) Beneˇ network s...
View
Full
Document
This document was uploaded on 03/20/2014 for the course EECS 6.896 at MIT.
 Spring '07
 BradleyKuszmaul

Click to edit the document details