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=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,a011e82e0079f0ea X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-08-07 10:16:59 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!newsfeed.vmunix.org!newsfeed.stueberl.de!eusc.inter.net!cs.tu-berlin.de!not-for-mail From: Stephan Heinemann Newsgroups: comp.lang.ada Subject: Re: Ravenscar - Scheduling Date: 7 Aug 2003 17:16:58 GMT Organization: Technische Universitaet Berlin, Deutschland Message-ID: References: NNTP-Posting-Host: fiesta.cs.tu-berlin.de Mime-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 8bit X-Trace: news.cs.tu-berlin.de 1060276618 18086 130.149.17.156 (7 Aug 2003 17:16:58 GMT) X-Complaints-To: news@cs.tu-berlin.de NNTP-Posting-Date: 7 Aug 2003 17:16:58 GMT User-Agent: tin/1.4.6-20020816 ("Aerials") (UNIX) (SunOS/5.9 (sun4u)) Xref: archiver1.google.com comp.lang.ada:41234 Date: 2003-08-07T17:16:58+00:00 List-Id: > Ravenscar was definied with pre-emptive fixed priority scheduling in mind. > I also read that non pre-emptive scheduling could be applied. I am working > with Petri Nets and need do control the preemption points of the scheduler > in order to model the whole system (I am working on a code-generator). > Co-operative scheduling would be ideal for this purpose. I need somehow > prevent the scheduler from preempting actions (Ada code snippets) which > are associated with transitions. Any ideas? I guess I found what I was looking for in Alan Burns "Non-Preemptive Dispatching and Locking Policies"... The "execution token" seems to be exactly what I need. Anyway, further ideas are still welcome. Stephan