Parthenon

CS252: Reading Assignment #6
Due Friday, Sept 29th


For Friday, read the following paper and turn in a single paragraph, as described below:
  1. Subbarao Palacharla, Norman P. Jouppi and J. E. Smith, Complexity-effective superscalar processors,    Proceedings of the 24th International Symposium on Computer Architecture (ISCA). Denver, 1997
Write one paragraph for Friday.  See if you can sumarize three constraints that most limit increasing the number of instructions per cycle arbitrarily.

Back to CS252 page


Maintained by John Kubatowicz (kubitron@cs.berkeley.edu). Last modified 13 September, 1998.