final solutions

896 final examination name 4 problem 2 denitions 4

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: � � �� �� Solution: � side of tree of meshes or area-universal fat-tree: �� � �� �� (d) � ��� � � ����� � ���� �� depth of bitonic sorting network: ���� � �� � (e) � ��� � �� ����� � �� �� Solution: depth of bitonic sorting network: ���� Solution: 6.896 Final Examination Name 4 Problem 2. Definitions (4 parts) [16 points] Give a one-sentence description of each of the following terms to show that you know what they mean: (a) carry-lookahead adder Solution: Adding 2 N-bit numbers with � ��� hardware, � ��� �� depth. The idea is to calculate the carries by doing parallel prefix 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.

Ask a homework question - tutors are online