Re: How to simulate semaphores with Ada's tasks?

["Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>]

On 25/08/2016 02:41, Andrew Shvets wrote:
> From what I've read, tasks do not have semaphores that can permit it
> to lock a piece of memory and prevent it from being accessed, is this
> correct?

It is unclear what you mean here. Semaphore blocks a resource, not 
necessarily memory. Technically you cannot block memory at the language 
level, e.g. using memory management registers. It is too low-level. So 
it is operations that are blocked with memory encapsulated somewhere 
into an object or a package.

> If so, then the best possible way to simulate this is to have tasks
> send messages to one another and synchronize when something is
> locked/unlocked.

That is called "monitor". It can be used to implement the semaphore too, 
but nobody does that. In most cases monitor is better than semaphore 
when that comes in question.

Semaphore has little if no use when k>1. Only mutex (semaphore k=1) is 
actively used.

> Is there a better approach?

Sometimes monitor is better sometimes mutex is.

Regarding mutex what kind of are you looking for? Plain? Reentrant? 
Read-write mutex? Arrays of mutexes?

In Ada synchronization objects like mutex are implemented using 
protected object. A plain mutex or semaphore is trivial to implement.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de