Please use this identifier to cite or link to this item:
|Title:||Some performance issues for transactions with firm deadlines|
|Source:||Tay, Y.C. (1995). Some performance issues for transactions with firm deadlines. Proceedings - Real-Time Systems Symposium : 322-331. ScholarBank@NUS Repository.|
|Abstract:||We present a performance model for transactions with firm deadlines on a database system that uses locking, but without priority scheduling. Such a system may be a legacy, or bought off-the-shelf. Excluding priority scheduling is also a way of determining how resource and data contention affect deadline misses. The model is used to (a) define workload - a number that helps the evaluation of a system design by predicting the stress on it; (b) show that performance is proportional to the cube of transaction length, so transactions should request a minimal number of locks; (c) examine how deadlines should vary with transaction length, thus demonstrating the crucial role of resource contention; and (d) show that execution times and multiprogramming levels can cause a bias only though priority scheduling. We also offer an interpretation of 'missed deadlines must be rare' in terms of abort cost.|
|Source Title:||Proceedings - Real-Time Systems Symposium|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 10, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.