TY - GEN
T1 - Optimizing I/O-intensive transactions in highly interactive applications
AU - Sharaf, Mohamed A.
AU - Chrysanthis, Panos K.
AU - Labrinidis, Alexandros
AU - Amza, Cristiana
PY - 2009
Y1 - 2009
N2 - The performance provided by an interactive online database system is typically measured in terms of meeting certain pre-specified service level agreements (slas)With expected transaction latency being the most commonly used type of sla. this form of sla acts as a soft deadline for each transaction,And user satisfaction can be measured in terms of minimizing tardiness,that is.the deviation from sla. this objective is further complicated for i/o-intensive transactions,Where the storage system becomes the performance bottleneck. moreover,Common i/o scheduling policies employed by the operating system with a goal of improving i/o throughput or average latency may run counter to optimizing per-transaction performance since the operating system is typically oblivious to the application high-level sla specifications. in this paper,We propose a new sla-aware policy for scheduling i/o requests of database transactions. our proposed policy synergistically combines novel deadline-aware scheduling policies for database transactions with features of operating system scheduling policies designed for improving i/o throughput. this enables our proposed policy to dynamically adapt to workload and consistently provide the best performance.
AB - The performance provided by an interactive online database system is typically measured in terms of meeting certain pre-specified service level agreements (slas)With expected transaction latency being the most commonly used type of sla. this form of sla acts as a soft deadline for each transaction,And user satisfaction can be measured in terms of minimizing tardiness,that is.the deviation from sla. this objective is further complicated for i/o-intensive transactions,Where the storage system becomes the performance bottleneck. moreover,Common i/o scheduling policies employed by the operating system with a goal of improving i/o throughput or average latency may run counter to optimizing per-transaction performance since the operating system is typically oblivious to the application high-level sla specifications. in this paper,We propose a new sla-aware policy for scheduling i/o requests of database transactions. our proposed policy synergistically combines novel deadline-aware scheduling policies for database transactions with features of operating system scheduling policies designed for improving i/o throughput. this enables our proposed policy to dynamically adapt to workload and consistently provide the best performance.
KW - Database systems
KW - I/O scheduling
KW - Transaction processing
UR - http://www.scopus.com/inward/record.url?scp=70849124079&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70849124079&partnerID=8YFLogxK
U2 - 10.1145/1559845.1559927
DO - 10.1145/1559845.1559927
M3 - Conference contribution
AN - SCOPUS:70849124079
SN - 9781605585543
T3 - SIGMOD-PODS'09 - Proceedings of the International Conference on Management of Data and 28th Symposium on Principles of Database Systems
SP - 785
EP - 797
BT - SIGMOD-PODS'09 - Proceedings of the International Conference on Management of Data and 28th Symposium on Principles of Database Systems
T2 - International Conference on Management of Data and 28th Symposium on Principles of Database Systems, SIGMOD-PODS'09
Y2 - 29 June 2009 through 2 July 2009
ER -