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.9 required=5.0 tests=BAYES_00 autolearn=unavailable autolearn_force=no version=3.4.4 Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!mx02.eternal-september.org!feeder.eternal-september.org!news.swapon.de!fu-berlin.de!uni-berlin.de!individual.net!not-for-mail From: Niklas Holsti Newsgroups: comp.lang.ada Subject: Re: longest path through a task Date: Thu, 28 May 2015 12:04:03 +0300 Organization: Tidorum Ltd Message-ID: References: <9ad1fcdc-cdf9-4ff0-aa7e-051d53b6736a@googlegroups.com> <7d56e720-5e91-4950-b4ae-29d7ddbdc11a@googlegroups.com> Mime-Version: 1.0 Content-Type: text/plain; charset=windows-1252; format=flowed Content-Transfer-Encoding: 7bit X-Trace: individual.net 6uM1XOi+J4aBHDdXQHvqXAPuId2Wpd7uv2+/e561wHWNcO+RT9 Cancel-Lock: sha1:zUwiVNDIpkmby6Eij4mqXKp58gg= User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.8; rv:31.0) Gecko/20100101 Thunderbird/31.7.0 In-Reply-To: <7d56e720-5e91-4950-b4ae-29d7ddbdc11a@googlegroups.com> Xref: news.eternal-september.org comp.lang.ada:26029 Date: 2015-05-28T12:04:03+03:00 List-Id: On 15-05-28 09:54 , jan.de.kruyf@gmail.com wrote: > On Wednesday, May 27, 2015 at 10:09:22 PM UTC+2, Niklas Holsti > wrote: >> What kind of ARM are you using? A classic ARM7, or a Cortex? "M" >> series? > > Thank you Niklas. CortexM4 since Ada has a cross environment for it. > I dont think it will get serious. I dumped the multithread stuff and > made a single-thread / multitask runtime (slow in Ada unfortunately, > but not as slow as multi-threading and interrupts. Did you get some numbers for the task-switch and interrupt-latency times with the Ravenscar kernel? What does "slow" mean, in numbers? > I did a bit of internet trawling last night to find out what they did > for the Xoberon environment I posted about in the language shootout. > They restricted the language further, and added a bound on number of > loop executions. The bound you would then give a value in the > program. ... > p.s. Ah I see it is your bread and butter, very interesting :) Well, I tried to make it my bread and butter, but failed. So I'm back working for my former employer and doing real applications, not tools. -- Niklas Holsti Tidorum Ltd niklas holsti tidorum fi . @ .