From: Stephan Heinemann <zombie@cs.tu-berlin.de>
Subject: Re: Ravenscar
Date: 10 Aug 2003 17:46:49 GMT
Date: 2003-08-10T17:46:49+00:00 [thread overview]
Message-ID: <bh60e9$ge4$2@news.cs.tu-berlin.de> (raw)
In-Reply-To: bgmgt9$4ce$1@news.cs.tu-berlin.de
The rational given for simple barriers is to guarantee a temporally
deterministic bounded epilogue. I do not see the non-determinism. If
a complex function call were made, this function could, of course, call
other subprograms or even other protected entries (with the same complex
epilogue). But the WCET of subprograms or the WCBT of protected entries
can (?) be determined. So, I do not really understand the given reasoning.
Of course, the RTSS can be more efficient without the need to
reevaluate barriers.
Stephan
next prev parent reply other threads:[~2003-08-10 17:46 UTC|newest]
Thread overview: 22+ messages / expand[flat|nested] mbox.gz Atom feed top
2003-08-03 16:30 Ravenscar Stephan Heinemann
2003-08-04 8:19 ` Ravenscar Lutz Donnerhacke
2003-08-04 12:52 ` Ravenscar Matthew Heaney
2003-08-04 14:24 ` Ravenscar Phil Thornley
2003-08-04 20:49 ` Ravenscar Stephan Heinemann
2003-08-07 16:37 ` Ravenscar - Scheduling Stephan Heinemann
2003-08-07 17:16 ` Stephan Heinemann
2003-08-10 17:46 ` Stephan Heinemann [this message]
2003-08-06 9:43 ` Ravenscar Rodrigo Garcia
2003-08-09 15:44 ` Ravenscar - timouts Stephan Heinemann
2003-08-09 18:29 ` Ravenscar - Multiple Protected Entries Stephan Heinemann
2003-08-10 2:36 ` Jeffrey Carter
2003-08-10 17:41 ` Stephan Heinemann
2003-08-10 19:17 ` Jeffrey Carter
2003-08-11 16:35 ` Stephan Heinemann
2003-08-11 17:05 ` Stephan Heinemann
2003-08-11 19:18 ` Jeffrey Carter
2003-08-12 17:07 ` Stephan Heinemann
2003-08-12 16:31 ` Colin Paul Gloster
2003-08-12 17:10 ` Stephan Heinemann
2003-08-12 19:10 ` Colin Paul Gloster
2003-08-13 19:17 ` Colin Paul Gloster
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox