From: franke@minet.uni-jena.de (Frank Ecke)
Subject: Re: Please: ada Help: Scheduling Algorithms?
Date: 1998/11/26
Date: 1998-11-26T00:00:00+00:00 [thread overview]
Message-ID: <slrn75r1j8.klo.franke@pax01f.mipool.uni-jena.de> (raw)
In-Reply-To: ua9PmbMG#GA.293@nih2naab.prod2.compuserve.com
On Wed, 25 Nov 1998, MarcoPolo <nic_azzuri@compuserve.com> spake thuswise:
> does anyone know any scheduling in ada
Ada's Annex D requires that a ``preemptive scheduling, based on conceptual
priority-ordered ready queues,'' model be supported (see (ARM, D.2.1 ``The Task
Dispatching Model.'')) (ARM, D.2.2 ``The Standard Task Dispatching Policy'')
describes a specific task dispatching policy, FIFO_Within_Priorities.
``Implementations are allowed to define other task dispatching policies, but
need not support more than one such policy per partition.'' Reading D.2.2
carefully (especially (11)) will reveal that Simple-Round-Robin can be achieved
using delay 0.0.
Hope this helps,
Frank
--
Frank Ecke <franke@minet.uni-jena.de>
In a world without walls and fences, who needs windows and gates?
prev parent reply other threads:[~1998-11-26 0:00 UTC|newest]
Thread overview: 2+ messages / expand[flat|nested] mbox.gz Atom feed top
1998-11-25 0:00 Please: ada Help: Scheduling Algorithms? MarcoPolo
1998-11-26 0:00 ` Frank Ecke [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox