Abstract
Deriving deadlines and periods for update transactions and scheduling hybrid transactions have been recognized as an important issue in real-time database systems. Despite years of research, all existing techniques focus on assigning deadlines and periods for update transactions in uniprocessor systems and, thus, cannot be applied in multiprocessor systems. Two partitioned scheduling methods for hybrid transactions in multiprocessor systems are proposed in this paper, by developing existing scheduling methods for uniprocessor systems to multiprocessor environments. An effective strategy is proposed to improve the efficiencies of the proposed methods, under which the improvement of efficiency is at the price of the acceptance ratio of transaction sets. For addressing the low acceptance ratio of the improvement strategy, we propose a novel scheduling method. A set of experiments is conducted to test the performances of the proposed methods. To the best of our knowledge, this is the first paper for co-scheduling of hybrid transactions on multiprocessor platforms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.