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_50,INVALID_DATE,
	MSGID_SHORT autolearn=no autolearn_force=no version=3.4.4
Path: utzoo!dciem!nrcaer!sce!jeffw
From: jeffw@sce.carleton.ca (Jeff Wilson)
Newsgroups: comp.lang.ada
Subject: Ada timing
Message-ID: <679@sce.carleton.ca>
Date: 19 Oct 89 00:05:25 GMT
Organization: Systems & Computer Eng. Dept., Carleton University, Ottawa, Canada
List-Id: <comp.lang.ada>


     I'm trying to obtain some information about the semantics
of Ada timing.  For instance, if a task executes a timed entry
call, does the specified time begin when the call

1) 'leaves' the task?
2) 'leaves' the task's logical processor?
3) 'arrives' at the acceptor's logical processor?
4) 'arrives' at the acceptor's entry queue?

Any information which directly or remotely deals with Ada
timing semantics and implementations would be appreciated.

Jeff Wilson
Dept. of Systems and Computer Engineering
Carleton University
Ottawa, Ontario, Canada K1S 5B6
jeffw@sce.carleton.ca