From: "Dr. Hubert B. Keller" <keller@iai.fzk.de>
Subject: Re: tasking in Ada and Annex D question
Date: 1999/02/01
Date: 1999-02-01T00:00:00+00:00 [thread overview]
Message-ID: <36B5B157.5080216@iai.fzk.de> (raw)
In-Reply-To: 793jl9$hf@drn.newsguy.com
> Does Annex D
> not have some sort of "quantum" based scheduling? since both
> tasks are of equal priority, one will expect that one task will
> run out of its quantum, and the next ready task to become
> compute, no? (I really need to study AnnexD too :)
This mean Round Robin as a fair scheduling algorithm.
The showed behavior seems correct if having 2 tasks with same priority
and no delay. Using a delay of 0 results in preempting the task actually running
and
requeueing it at the tail of the queue and processing the next one.
Wether round robin is available or not depends on the implementation.
(See pragma dispatching_policy)
H.K.
next prev parent reply other threads:[~1999-02-01 0:00 UTC|newest]
Thread overview: 16+ messages / expand[flat|nested] mbox.gz Atom feed top
1999-01-31 0:00 tasking in Ada and Annex D question nabbasi
1999-02-01 0:00 ` Dr. Hubert B. Keller [this message]
1999-02-02 0:00 ` robert_dewar
1999-02-02 0:00 ` Roger Racine
1999-02-02 0:00 ` robert_dewar
1999-02-03 0:00 ` Nick Roberts
1999-02-03 0:00 ` Frank Mueller
1999-02-03 0:00 ` Frank Mueller
1999-02-03 0:00 ` Roger Racine
1999-02-03 0:00 ` Tom Moran
1999-02-02 0:00 ` Markus Kuhn
1999-02-02 0:00 ` robert_dewar
1999-02-02 0:00 ` Markus Kuhn
1999-02-02 0:00 ` Niklas Holsti
1999-02-03 0:00 ` Ehud Lamm
1999-02-03 0:00 ` 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