کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
379513 | 659311 | 2006 | 31 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Utilization of execution histories in scheduling real-time database transactions
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Utilization of execution histories in scheduling real-time database transactions Utilization of execution histories in scheduling real-time database transactions](/preview/png/379513.png)
چکیده انگلیسی
Real-time database systems support data processing needs of real-time systems where transactions have time constraints. Here we consider repetitively executed transactions, and assume that execution histories are logged. A well-known priority assignment technique called earliest-deadline-first is biased towards short transactions in which short transactions have better chances of completing their executions within their deadlines. We introduce the notion of “fair scheduling” in which the goal is to have “similar” completion ratios for all transaction classes (short to long in sizes). We propose priority assignment techniques that overcome the biased scheduling and show that they work via extensive simulation experiments.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Data & Knowledge Engineering - Volume 57, Issue 2, May 2006, Pages 148–178
Journal: Data & Knowledge Engineering - Volume 57, Issue 2, May 2006, Pages 148–178
نویسندگان
Erdogan Dogdu,