ScholarLens Back to search
2007•Unpublished venueRequires access

Efficient priority assignment policies for distributed real-time database systems

Hong-Ren Chen, Y.H. Chin

Open publisher page 3 citations

Abstract

Abstract: A lot of research works have been done in this filed of real-time database systems to seek for optimizing transaction scheduling. The findings of such studies examining the use of various algorithms of priority assignment policy have been discussed widely. One drawback of these approaches is presenting poor performance due to neglect repetitively missed real-time transactions. In this paper, an improved priority assignment policy named Flexible High Reward with concurrency control factor (FHR-CF) is proposed to reduce the MissRatio and WastedRatio. Key-word: priority assignment policy, real-time transaction scheduling, concurrency control factor, real-time database systems 1

About this research paper

What this paper is about

Abstract: A lot of research works have been done in this filed of real-time database systems to seek for optimizing transaction scheduling. The findings of such studies examining the use of various algorithms of priority assignment policy have been discussed widely. One drawback of these approaches is presenting poor performance due to neglect repetitively missed real-time transactions. In this paper, an improved priority assignment policy named Flexible High Reward with concurrency control factor (FHR-CF) is proposed to reduce the MissRatio and WastedRatio. Key-word: priority assignment policy, real-time transaction scheduling, concurrency control factor, real-time database systems 1

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract: A lot of research works have been done in this filed of real-time database systems to seek for optimizing transaction scheduling. The findings of such studies examining the use of various algorithms of priority assignment policy have been discussed widely. One drawback of these approaches is presenting poor performance due to neglect repetitively missed real-time transactions. In this paper, an improved priority assignment policy named Flexible High Reward with concurrency control factor (FHR-CF) is proposed to reduce the MissRatio and WastedRatio. Key-word: priority assignment policy, real-time transaction scheduling, concurrency control factor, real-time database systems 1

Key concepts: Computer science, Concurrency control, Database transaction, Scheduling (production processes), Serializability, Real-time database, Deadline-monotonic scheduling, Priority inheritance

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Efficient priority assignment policies for distributed real-time database systems — Research Paper | ScholarLens