S. A. E. Sassen

Learn More
A transaction scheduling mechanism is designed for a shared-memory, multi-processor database system. The scheduler used is a variant of static locking, adapted for real-time and more than one processor. It is assumed that transactions arrive according to a Poisson process, execution times of transactions are independent and exponentially distributed, and(More)
A real-time application is assumed to be constructed from transactions manipulating a set of structured data. The performance measure for real-time systems is not given by the mean transaction duration but by the number of transactions that meet their deadline. Consequently, performance modelling must include the transaction response time distribution. A(More)
  • 1