From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.0 required=5.0 tests=BAYES_00,FORGED_HOTMAIL_RCVD2, FREEMAIL_FROM autolearn=no autolearn_force=no version=3.4.4 X-Google-Thread: a07f3367d7,bf2e2a640e02895,start X-Google-Attributes: gida07f3367d7,public,usenet X-Google-NewGroupId: yes X-Google-Language: ENGLISH,CP1252 Received: by 10.68.227.67 with SMTP id ry3mr379892pbc.8.1343312529079; Thu, 26 Jul 2012 07:22:09 -0700 (PDT) Path: b9ni64715285pbl.0!nntp.google.com!border1.nntp.dca.giganews.com!novia!volia.net!news2.volia.net!feed-A.news.volia.net!border1.nntp.ams2.giganews.com!border2.nntp.ams2.giganews.com!border4.nntp.ams.giganews.com!border2.nntp.ams.giganews.com!nntp.giganews.com!newsfeed.straub-nv.de!reality.xs3.de!news.stack.nl!newsfeed.xs4all.nl!newsfeed5.news.xs4all.nl!xs4all!newsgate.cistron.nl!newsgate.news.xs4all.nl!news2.euro.net!82.197.223.103.MISMATCH!feeder3.cambriumusenet.nl!feed.tweaknews.nl!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail From: Austin Obyrne Newsgroups: comp.lang.ada Subject: Computer operations per second - Question. Date: Sun, 22 Jul 2012 13:20:36 -0700 (PDT) Organization: http://groups.google.com Message-ID: NNTP-Posting-Host: 86.167.61.142 Mime-Version: 1.0 X-Trace: posting.google.com 1342988549 31993 127.0.0.1 (22 Jul 2012 20:22:29 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: Sun, 22 Jul 2012 20:22:29 +0000 (UTC) Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=86.167.61.142; posting-account=pmkN8QoAAAAtIhXRUfydb0SCISnwaeyg User-Agent: G2/1.0 X-Original-Bytes: 2104 Content-Type: text/plain; charset=windows-1252 Content-Transfer-Encoding: quoted-printable Date: 2012-07-22T13:20:36-07:00 List-Id: I have just completed writing a very strong cryptographic cipher in Ada-95 = and I need to try and analyise the time complexity of this cipher i.e the t= ime taken to test a key space of 2560, 000,000,000,000 keys at say =91n=92 = operations per second. The processor of my home computer is a 2.61 GHz AMD processor and it has 2.= 87 Gb of RAM. Is it correct for me say that my computer has a capability of 2.61 Giga ope= rations per second i.e =91n=92 =3D 2.61 x 10^6? I know this question is hardly related to Ada programming but I know also t= hat many Ada programmer readers are well-informed computer scientists. Can I assume that an operation is performed every cycle of the computer clo= ck at 2.61 x10^6 operations persecond=20 It seems a bit na=EFve to say that =91n=92 is dependent only on the process= or frequency?=20 Anybody please? - adacrypt