Since the number of instructions issued per cycle and the cycle time are theoretically orthogonal,
we could have a superpipelined superscalar machine. A superpipelined superscalar machine of
degree (re,n) has a cycle time 1/m that of the base machine, and it can execute n instructions
every cycle.
Formalizing a superpipelined superscalar machine according to our definitions:
• Instructions issued per cycle = n, and the cycle time is 1/m that of the base machine
• Simple operation latency measured in cycles = m
• Simple operation latency measured in instructions = n*m