(query) analytical measures of instruction set architectures

Article View: comp.arch

Article #22169

#22169

From: Bruce K. Holmer
Date: Tue, 06 Feb 1990 08:18

17 lines
1079 bytes

[]

I would like references to papers or theses describing analytical
measures of various characteristics of instruction set architectures.
For example, there has been much talk about RISC/CISC, but has anyone
come up with a numerical measure of instruction set complexity?  Other
interesting instruction set parameters include traditional terms such
as regularity, orthogonality, and composability.  Again the question
is whether someone has proposed a method for computing numerical
quantities for these parameters.

Thanks,
--Bruce

holmer@ernie.berkeley.edu
...!ucbvax!ernie!holmer

Technical Details

Message-ID: <34144@ucbvax.BERKELEY.EDU>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!sun-barr!decwrl!ucbvax!ernie.Berkeley.EDU!holmer

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!sun-barr!decwrl!ucbvax!ernie.Berkeley.EDU!holmer
From: holmer@ernie.Berkeley.EDU (Bruce K. Holmer)
Newsgroups: comp.arch
Subject: (query) analytical measures of instruction set architectures
Message-ID: <34144@ucbvax.BERKELEY.EDU>
Date: 6 Feb 90 08:18:46 GMT
Sender: usenet@ucbvax.BERKELEY.EDU
Reply-To: holmer@ernie.Berkeley.EDU (Bruce K. Holmer)
Organization: University of California, Berkeley
Lines: 17