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=0.2 required=5.0 tests=BAYES_00,INVALID_MSGID,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,2e51f1f2f86af89e
X-Google-Attributes: gid103376,public
From: franke@minet.uni-jena.de (Frank Ecke)
Subject: Re: Please: ada Help: Scheduling Algorithms?
Date: 1998/11/26
Message-ID: <slrn75r1j8.klo.franke@pax01f.mipool.uni-jena.de>#1/1
X-Deja-AN: 415934481
References: <ua9PmbMG#GA.293@nih2naab.prod2.compuserve.com>
Organization: Department of Computer Science, FSU Jena, Germany
Reply-To: franke@minet.uni-jena.de
Newsgroups: comp.lang.ada
Date: 1998-11-26T00:00:00+00:00
List-Id: <comp.lang.ada>

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?