Performance evaluation on a real-time database

Suhee Kim; Sang H. Son; John A. Stankovic

doi:10.1109/RTTAS.2002.1137401

Performance evaluation on a real-time database

Suhee Kim, Sang H. Son, John A. Stankovic

Department of Electrical Engineering and Computer Science

Research output: Contribution to journal › Conference article › peer-review

28 Scopus citations

Abstract

We have implemented an object-oriented real-time database system called BeeHive. Using BeeHive, the performance of two data-deadline cognizant scheduling policies, called EDDF and EDF-DC, and a baseline EDF policy all with/without admission control are evaluated through extensive experiments. We identify the ranges where data-deadline cognizant scheduling policies are effective. We also show that when admission control is used it plays a more significant role than specialized real-time data cognizant policies. Our admission control policy considers not only CPU utilizations, but also I/O requirements and utilizations. These results represent one of the few sets of experimental results found for an implemented real-time database; almost all previous results are via simulation.

Original language	English
Article number	1137401
Pages (from-to)	253-265
Number of pages	13
Journal	Real-Time Technology and Applications - Proceedings
DOIs	https://doi.org/10.1109/RTTAS.2002.1137401
State	Published - 2002
Event	8th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2002 - San Jose, CA, United States Duration: 25 Sep 2002 → 27 Sep 2002

Access to Document

10.1109/RTTAS.2002.1137401

Cite this

@article{5f54e085b09f453cb1f74c33eab4a579,

title = "Performance evaluation on a real-time database",

abstract = "We have implemented an object-oriented real-time database system called BeeHive. Using BeeHive, the performance of two data-deadline cognizant scheduling policies, called EDDF and EDF-DC, and a baseline EDF policy all with/without admission control are evaluated through extensive experiments. We identify the ranges where data-deadline cognizant scheduling policies are effective. We also show that when admission control is used it plays a more significant role than specialized real-time data cognizant policies. Our admission control policy considers not only CPU utilizations, but also I/O requirements and utilizations. These results represent one of the few sets of experimental results found for an implemented real-time database; almost all previous results are via simulation.",

author = "Suhee Kim and Son, {Sang H.} and Stankovic, {John A.}",

year = "2002",

doi = "10.1109/RTTAS.2002.1137401",

language = "English",

pages = "253--265",

journal = "Real-Time Technology and Applications - Proceedings",

issn = "1080-1812",

publisher = "IEEE Computer Society",

note = "8th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2002 ; Conference date: 25-09-2002 Through 27-09-2002",

}

TY - JOUR

T1 - Performance evaluation on a real-time database

AU - Kim, Suhee

AU - Son, Sang H.

AU - Stankovic, John A.

PY - 2002

Y1 - 2002

N2 - We have implemented an object-oriented real-time database system called BeeHive. Using BeeHive, the performance of two data-deadline cognizant scheduling policies, called EDDF and EDF-DC, and a baseline EDF policy all with/without admission control are evaluated through extensive experiments. We identify the ranges where data-deadline cognizant scheduling policies are effective. We also show that when admission control is used it plays a more significant role than specialized real-time data cognizant policies. Our admission control policy considers not only CPU utilizations, but also I/O requirements and utilizations. These results represent one of the few sets of experimental results found for an implemented real-time database; almost all previous results are via simulation.

AB - We have implemented an object-oriented real-time database system called BeeHive. Using BeeHive, the performance of two data-deadline cognizant scheduling policies, called EDDF and EDF-DC, and a baseline EDF policy all with/without admission control are evaluated through extensive experiments. We identify the ranges where data-deadline cognizant scheduling policies are effective. We also show that when admission control is used it plays a more significant role than specialized real-time data cognizant policies. Our admission control policy considers not only CPU utilizations, but also I/O requirements and utilizations. These results represent one of the few sets of experimental results found for an implemented real-time database; almost all previous results are via simulation.

UR - http://www.scopus.com/inward/record.url?scp=84884317922&partnerID=8YFLogxK

U2 - 10.1109/RTTAS.2002.1137401

DO - 10.1109/RTTAS.2002.1137401

M3 - Conference article

AN - SCOPUS:84884317922

SN - 1080-1812

SP - 253

EP - 265

JO - Real-Time Technology and Applications - Proceedings

JF - Real-Time Technology and Applications - Proceedings

M1 - 1137401

T2 - 8th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2002

Y2 - 25 September 2002 through 27 September 2002

ER -

Performance evaluation on a real-time database

Abstract

Access to Document

Other files and links

Fingerprint

Cite this