From mboxrd@z Thu Jan 1 00:00:00 1970 To: 9fans@cse.psu.edu From: Ozan Yigit Message-ID: References: , <200107202152.RAA04992@smarty.smart.net> Subject: Re: [9fans] commercial deployment Date: Tue, 24 Jul 2001 11:34:18 +0000 Topicbox-Message-UUID: d4a3f100-eac9-11e9-9e20-41e7f4b1d025 humbubba@smarty.smart.net (Rick Hohensee) writes: > What are "pre-run-time scheduling with constraints" and how does rtlinux > fail there? this is not the right forum to discuss rtlinux, but we know that what they call "hard" is not quite hard enough. :) as for pre-run-time scheduling [which is really the only practical way to provide the predictibility needed for serious hard rt] the two seminal papers are: Jia Xu, David Lorge Parnas, Pre-Run-Time Scheduling of Processes with Exclusion Relations on Nested or Overlapping Critical Sections. and Jia Xu, David Lorge Parnas, Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations", IEEE Transactions on Software Engineering, vol. 16, no. 3, March 1990, pp. 360-369. also see, by way of a faq :) Jia Xu, David Lorge Parnas, Priority Scheduling Versus Pre-Run-Time Scheduling. 7-23, Real Time Systems, Vol. 18, Jan 2000. enjoy. oz -- www.cs.yorku.ca/~oz | if you couldn't find any weirdness, maybe york u. computer science | we'll just have to make some! -- hobbes