Performance of hard real-time transaction scheduling policies in parallel database systems

Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247) Pub Date : 1998-07-19 DOI:10.1109/MASCOT.1998.693692

Sonia Takkar, S. Dandamudi

{"title":"Performance of hard real-time transaction scheduling policies in parallel database systems","authors":"Sonia Takkar, S. Dandamudi","doi":"10.1109/MASCOT.1998.693692","DOIUrl":null,"url":null,"abstract":"Real-time transactions, in addition to preserving consistency of the database as in traditional transactions, have to meet the deadlines. Scheduling real-time transactions in parallel database systems has not received much attention. This paper focuses on real-time transaction scheduling in shared-nothing parallel database systems. We evaluate the performance of a new priority-based scheduling policy, in which all scheduling decisions are made locally by each node. In contrast, several other algorithms, proposed for the distributed systems, require communication among the nodes to globally synchronize their local block and abort decisions. Such synchronization can deteriorate performance as real-time transactions will have to meet deadlines. We use miss ratio as the performance metric and show that, in general, the new policy provides a superior performance for the workload and system parameters considered in this study.","PeriodicalId":272859,"journal":{"name":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.1998.693692","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

Abstract

Real-time transactions, in addition to preserving consistency of the database as in traditional transactions, have to meet the deadlines. Scheduling real-time transactions in parallel database systems has not received much attention. This paper focuses on real-time transaction scheduling in shared-nothing parallel database systems. We evaluate the performance of a new priority-based scheduling policy, in which all scheduling decisions are made locally by each node. In contrast, several other algorithms, proposed for the distributed systems, require communication among the nodes to globally synchronize their local block and abort decisions. Such synchronization can deteriorate performance as real-time transactions will have to meet deadlines. We use miss ratio as the performance metric and show that, in general, the new policy provides a superior performance for the workload and system parameters considered in this study.

查看原文本刊更多论文

并行数据库系统中硬实时事务调度策略的性能研究

实时事务除了像传统事务一样保持数据库的一致性外，还必须满足截止日期。在并行数据库系统中调度实时事务并没有受到太多的关注。本文主要研究无共享并行数据库系统中的实时事务调度问题。我们评估了一种新的基于优先级的调度策略的性能，其中所有调度决策都是由每个节点在本地做出的。相比之下，为分布式系统提出的其他几种算法需要节点之间的通信来全局同步其本地块和中止决策。这种同步可能会降低性能，因为实时事务必须满足最后期限。我们使用缺失率作为性能度量，并表明，总的来说，对于本研究中考虑的工作负载和系统参数，新策略提供了更好的性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247)

自引率

0.00%

发文量