Deutsch English Français Italiano |
<lkadcnF82okU1@mid.individual.net> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!weretis.net!feeder8.news.weretis.net!fu-berlin.de!uni-berlin.de!individual.net!not-for-mail From: Niklas Holsti <niklas.holsti@tidorum.invalid> Newsgroups: comp.arch Subject: Re: is Vax addressing sane today Date: Tue, 10 Sep 2024 11:13:11 +0300 Organization: Tidorum Ltd Lines: 42 Message-ID: <lkadcnF82okU1@mid.individual.net> References: <vbd6b9$g147$1@dont-email.me> <memo.20240905225550.19028d@jgd.cix.co.uk> <2024Sep6.080535@mips.complang.tuwien.ac.at> <vbiftm$ui9$1@gal.iecc.com> <2024Sep8.155511@mips.complang.tuwien.ac.at> <73c6d21457c487c61051ec52fe25ea5d@www.novabbs.org> <vbl3qj$22a2q$1@dont-email.me> <09ce1622b872f0b0fa944e868a8c97be@www.novabbs.org> <vbnisc$2hb59$1@dont-email.me> <b600ed88d1ede37171831e0f3cdd4e31@www.novabbs.org> Mime-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit X-Trace: individual.net RghVrbY6ACrjQ/uYT5BmUwXWNydo8TKf8maua3lm4HHh75mXWF Cancel-Lock: sha1:+9G7HZe8ucjWH8aO9Oog3DKnwK0= sha256:LBh2rO/6aWzxMUMqPBQm9ffgzTu1Y/oavOm5cb6EXb8= User-Agent: Mozilla Thunderbird Content-Language: en-US In-Reply-To: <b600ed88d1ede37171831e0f3cdd4e31@www.novabbs.org> Bytes: 3203 On 2024-09-09 23:44, MitchAlsup1 wrote: > On Mon, 9 Sep 2024 19:38:52 +0000, Brett wrote: [snip] >> The future of programming languages is type safe with checks, you need >> to get on that bandwagon early. > > This would/will happen faster when type-safe with checks are well > represented in benchmarks used to measure various architectural > things, and the exceptions and checks are actually utilized showing > performance degradation of lesser endowed architectures. Not all the type-safe, checking languages are equal in that respect. In some languages, and I am thinking of Ada, the language design and the favored programming styles work to reduce the number of run-time checks required. In the Ada case, the ability to declare array types with programmer-chosen index types with bounded range, such as range-bounded integers or enumerations, means that the compiler can avoid indexing checks when the (sub)type of the index is known at compile time to fit within the index range of the array. It is also helpful that loop counters in Ada are also (sub)typed in the same way, which provides compile-time information on their range with respect to the index range of arrays accessed in the loop, even if the bounds of the range are not known at compile time. As a result of these language features, the matching programming styles, and the attention paid to these issues by the compilers, the number of run-time checks executed by an Ada program and their effect on execution time are often surprisingly small. So, to demonstrate the usefulness of HW support for checks, the benchmarks should use languages that require checks but do not have the features that let programmers reduce the number of checks by suitable programming styles. If Ada were used for the benchmarks, the programmers would have to use an abnormal, pessimal style that defeats the compiler's ability to elide checks.