Re: Semaphores without using entry

["Matthew Heaney" <mheaney@on2.com>]

[-- Warning: decoded text below may be mangled, UTF-8 assumed --]
[-- Attachment #1: Type: text/plain, Size: 1017 bytes --]


"Jos� Alberto" <HIGHLAND@santandersupernet.com> wrote in message
news:a0eqqq$9dk$1@news.ya.com...
> Hello to everybody,
>
> I need to use semaphores for a concurrent program, but I've been told not
to
> use the entry clause, but I can use the Ada.Synchronous_Task_Control
> package.

Actually, when I searched for "suspension" using the search engine, these 5
articles came up:

      Item # Date Time Recs   Subject
      000143 99/04/11 01:35 226  Task Synchronization Using Suspension
Objects
      000155 99/04/19 04:54 427  I'm Queueless, or, Suspension Objects
Instead of Entries
      000159 99/05/05 01:26 727  Do Not Entry: Bounded Queue of Suspension
Objects
      000173 99/10/24 17:19 380  Bounded Buffer with Entry-less Get Queue
      000175 99/10/27 00:05 412  Bounded Buffer with Entry-less Get Queue -
Update


See http://www.acm.org/archives/patterns.html for the complete list.

I did a whole series of articles about concurrency patterns in Ada95.  Maybe
they will be of some use to you.