Path: utzoo!yunexus!ists!helios.physics.utoronto.ca!news-server.csri.toronto.edu!cs.utexas.edu!sun-barr!ccut!ascgw!sh8810!okilab!icot32!isvax!uemura
From: uemura@isvax.isl.melco.co.jp (Joe Uemura)
Newsgroups: comp.realtime
Subject: Re: real-time multicomputer systems
Summary: dealing with priority inversion
Message-ID: <17536@isvax.isl.melco.co.jp>
Date: 29 May 90 03:03:50 GMT
Article-I.D.: isvax.17536
References: <4228@hcx1.SSD.CSD.HARRIS.COM>
Organization: Mitsubishi Electric, Ofuna, Kanagawa, Japan
Lines: 25

In article <4228@hcx1.SSD.CSD.HARRIS.COM>, steve@SSD.CSD.HARRIS.COM (Steve Brosky) writes:
<lots of stuff deleted>
> 
> 
> The operating system supports real-time features like:
	.
	.
> * real-time process synchronization --
> 	very fast synchronization primitives to coordinate access to shared data
> 	between cooperating processes (this is not AT&T system V IPC semaphores,
>     they are too slow!).  The synchronization primitives which block, will
> 	also place a bound on priority inversion.
> 
Could you please elaborate more on what you mean by placing "a bound on
priority inversion"? Is this some form of avoidance protocol?

I would also like to hear if anyone knows of other
realtime Unix adaptations which deal with priory inversion.


Joe Uemura
Mitsubishi Electric Co
ISED Lab
Parallel Computing Group
Kamakura, Japan