From: synoptik@home.com (Andrew Logue)
Subject: Embedded Concurrency in Ada
Date: 1999/10/21
Date: 1999-10-21T00:00:00+00:00 [thread overview]
Message-ID: <8E65D75A8synoptikdamudderfuck@news> (raw)
Hi All,
I have an Ada specific question that is specific to embedded systems based
on the Rational (verdix) VADSNet kernel. The target platform has a single
40 MHZ processor. The Vads kernel provides system calls (memory
management, hardware interrupt management, task scheduling, etc.) and
system elaboration for a single Ada program. I believe the task
management/scheduling is implemented in C, but probably doesn't matter
anyway.
What is the maximum number of Ada tasks supported by the kernel? If there
is no set limit, how can I determine the "point of no return", where task
management overhead consumes, say 20% of total CPU power. This question
assumes that heap and code space are unlimited. At what point does context
switching/stack management overhead become detrimental to system
performance, especially in a real-time system?
Obviously the hard-line answer to this question lies with system timing
requirements, hardware constraints, etc. But is there a way to gather some
metrics on how much system CPU resources are "wasted" or eaten up by the
kernel itself?
Regards,
Andrew Logue
Systems Architect/Bug Squisher
Computing Devices Canada
andrew.logue@cdcgy.com
synoptik@home.com
next reply other threads:[~1999-10-21 0:00 UTC|newest]
Thread overview: 2+ messages / expand[flat|nested] mbox.gz Atom feed top
1999-10-21 0:00 Andrew Logue [this message]
1999-10-21 0:00 ` Embedded Concurrency in Ada Robert Dewar
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox