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.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,3ccb707f4c91a5f2
X-Google-Attributes: gid103376,public
From: eachus@spectre.mitre.org (Robert I. Eachus)
Subject: Re: Java vs Ada 95 (Was Re: Once again,
 Ada absent from DoD SBIR solicitation)
Date: 1996/10/29
Message-ID: <EACHUS.96Oct29141806@spectre.mitre.org>#1/1
X-Deja-AN: 192975669
references: <325BC3B3.41C6@hso.link.com>
 <Dz2B9H.9HD.0.-s@inmet.camb.inmet.com>
organization: The Mitre Corp., Bedford, MA.
newsgroups: comp.lang.ada
Date: 1996-10-29T00:00:00+00:00
List-Id: <comp.lang.ada>



    Kenneth Almquist (ka@socrates.hr.att.com) said:

  > There may be no distributed overhead, but there certainly is overhead.
  > Here are some numbers from a toy benchmark:

  >	Ada with Unbounded_String:  10.02 seconds
  >	Icon (interpreted):          1.45 seconds

    First, nice benchmark.

    Second, do you have another version of gnat around?  If not 3.07
should be available soon.  This is one area where the reference
vs. value calling sequence pessimization is probably heavily felt, so
earlier (and later) versions of gnat should do better.

    Will it beat the Icon time?  I don't know, but certainly if it
doesn't the performance "problem" may occur other than in the gc
routines.  Even if Unbounded_String is implemented with a Controlled
type, clever optimization using RM rules only requires memory
allocation and freeing three times total.  (Finalization and the value
copies must occur, but there is no requirement to allocate new memory
when the new object is the same size, see 7.6(21).)

--

					Robert I. Eachus

with Standard_Disclaimer;
use  Standard_Disclaimer;
function Message (Text: in Clever_Ideas) return Better_Ideas is...