Re: complexity

Article View: comp.arch

Article #20927

#20927

From: Les Milash
Date: Fri, 28 Apr 1989 16:36

11 lines
920 bytes

In article <4844@pt.cs.cmu.edu> lindsay@MATHOM.GANDALF.CS.CMU.EDU (Donald Lindsay) writes:
>schow@bnr-public.uucp (Stanley Chow) says:
>>It would be interesting to speculate on total system complexity, is it
>>higher for CISC or for RISC (with its attendent memory and compiler
>>requirements).
>
>Moving complexity from one place to
>another may be a big win, or a big lose,

Yes, moving it outside of loops or moving it from runtime 
to compiletime would seem generally advangageous.

Technical Details

Message-ID: <407@unicads.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!ames!ncar!boulder!unicads!les

References: <38853@bbn.COM> <423@bnr-fos.UUCP> <4844@pt.cs.cmu.edu>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!ames!ncar!boulder!unicads!les
From: les@unicads.UUCP (Les Milash)
Newsgroups: comp.arch
Subject: Re: complexity
Keywords: code scheduling compilers
Message-ID: <407@unicads.UUCP>
Date: 28 Apr 89 16:36:45 GMT
References: <38853@bbn.COM> <423@bnr-fos.UUCP> <4844@pt.cs.cmu.edu>
Reply-To: les@unicads.UUCP (Les Milash)
Organization: Unicad  Boulder, CO
Lines: 11

Reply to Parent Message