doi:10.3850/978-981-08-7300-4_1466

ABSTRACT

A priority table base CPU scheduling algorithm in real-time database (RTDBS) is presented. It is applicable in environments where data requests arrive with different requirements such as real-time deadline, and user priority. Previous work on CPU scheduling is based on traditional CPU scheduler for meeting the real-time deadlines. The general idea is based on modeling the CPU scheduler in RTDBS requests as points in the multi-dimensional space, where each of the dimensions represents one of the parameters i.e. one dimension represents the deadline of task, another represents the criticalness or value and a third dimension represents the priority of the request, etc. The CPU scheduling problem reduces the problem of finding a linear order to scheduling these multidimensional points. Priority table base algorithms are adopted to define a linear order for sorting and scheduling objects that lie in the multi-dimensional space. This generalizes the onedimensional CPU scheduling algorithms (e.g., EDF, MCF, and CDF). Several techniques are presented to show how a CPU scheduler deals with the progressive arrival of task over time. In this dissertation traditional CPU scheduling algorithms are investigated, implemented and compared with priority table base CPU scheduling algorithm in real time database system.

Keywords: Real-time database, CPU scheduling, Priority table, Deadline.

© 2011 ICCA 2010 Organizers