I am looking for a model (or "law", as in Moore's law) to describe the acceleration of sequential computation over time. By sequential computation I mean, for example, repeated applications of a hash function (e.g. SHA256). (Another example would be repeated multiplication modulo an unfactorisable RSA modulus.)

In his keynote David Patterson has a chart about "single program speed" (see here) which more or less captures what I am looking for. Does this metric have other names, and have there been studies about it?

Below is an image from "Computer Architecture: A Quantitative Approach":

enter image description here

  • \$\begingroup\$ This question isn't appropriate for a site devoted to electronics design. I've recommended that it be migrated. \$\endgroup\$ – Elliot Alderson Jan 1 at 13:21
  • \$\begingroup\$ Where do you suggest it be migrated to? \$\endgroup\$ – Randomblue Jan 2 at 16:10
  • \$\begingroup\$ Re: migration. Am I to surmise that a question about Moore’s law, which is specifically about microprocessor engineering, would not belong to this Electrical Engineering site either? \$\endgroup\$ – Edgar Brown Jan 3 at 0:58

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Browse other questions tagged or ask your own question.