英文好又很懂電腦的大大請進(拜託)...
 

A iterative comparator for k-bit unsigned binary numbers consists of k cells arranged in a linear or cascade circuit
A cell recelives one bit from each of the two operands x and y and a pair of signals GE (x>=y thus far)and LE(x<=y thus far) from a heighboring cell and produces GE and LEsignals for the other neighbor
NOTE that GE=LE1 means that the two numbers are equal thus far

a.design the required cell assuming that GE and LE signals propagate from right to left

b.Repeat part a for left-to-right signals propagation

c.Show tjat the cells or part a or bcan be connected into a tree structure as opposed to linear array to produce a faster comparator

We plan to build a 4096-node parallel computer.
The nodes are organized as a 16*16*16 3D mesh,wish each node connected to six neighbors(two along each dimension)
We can fit 8 nodes on a custom VLSI chip,and 16 chip can be placed on a printed circuit board

a.Devise a partitioning scheme for the parallel computer that will minimize the number of off-chip,off-board,and off-chassis links

b.Considering the packing scheme of Figure (a) and the paritioning suggested in part a,would we be able to accommodate 8-bit-wide channels between neighboring processors

c.Does the 3D packaging scheme of Figure (b) offer any benefits for this design?



上面是在說什麼...