Abstract
Two types of applications are considered: hard real-time (HRT) and soft real-time (SRT). HRT applications need to meet their deadlines under all circumstances; deadlines of SRT applications may occasionally be missed. Both applications are constructed from objects. HRT and SRT applications coexist on the same set of processors and share objects to allow a consistent exchange of data via transactions. Several concurrency control algorithms exist to assure consistent transaction results in distributed database systems. The addition of versions to objects can diminish the execution time of read-only transactions and increases the number of permitted interleavings of concurrently executing transactions. Imposing two different orderings, one for read-only transactions and one for all other transactions, the wait-time of read-only transactions is considerably reduced. Small delays increase the probability that SRT deadlines are met or a design is reached in which all HRT requirements are met. The interleaving of HRT- and SRT-transactions is severely reduced when SRT-transactions are not allowed to perturb HRT-transactions. The here-defined transfer-serializability criterion permits the interleaving of HRT- and SRT-transactions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
