In this paper, we address the problem of priority scheduling in a database management system. We start by investigating the architectural consequences of adding priority to a DBMS. Specific priority-based schemes are then proposed for managing DBMS resources. including a priority-based diik scheduling algorithm and two approaches to adding priority to the buffer manager of a DBMS. We study the ...

There are several CPU scheduling algorithms like FCFS, SRTN,RR , priority etc. Scheduling decision of these algorithms are based on parameters which are assumed to be crisp. However, in many circumstances these parameters are vague. The vagueness of these parameters suggests that scheduler should use fuzzy logic in scheduling the jobs. A fuzzy priority CPU scheduling algorithm has been proposed...

tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. hence, integration has been proposed to decide about these problems concurrently. main problem in integration is how we can relate pro...

Scheduling is a common problem that has been raised for long time. Many algorithms have created this problem. Some offer flexibility in terms of constraints and complex operations. Because complexity, many will need huge computation resources execution A platform like web application restrictions such as time resources. algorithm not suited the platform. Priority scheduling based on priority qu...

This paper addresses the problem of real-time scheduling of a set of sporadic tasks on uniand multiprocessor platform based on priority promotion. A new preemptive scheduling algorithm, called Fixed-Priority with Priority Promotion (FPP), is proposed. In FPP scheduling, tasks are executed similar to traditional fixed-priority (FP) scheduling but the priority of some tasks are promoted at fixed ...

Mean waiting time is of a greater concern wherever queuing system is involved. Priority Scheduling is the general method used to reduce the mean waiting time of higher priority processes. However this method just focuses on favouring higher priority processes leaving the lower priority processes out of consideration and forcing them to starve for a longer period resulting in higher average mean...

This paper introduces schedulability analysis for global fixed priority scheduling with deferred pre-emption (gFPDS) for homogeneous multiprocessor systems. gFPDS is a superset of global fixed priority pre-emptive scheduling (gFPPS) and global fixed priority non-pre-emptive scheduling (gFPNS). We show how schedulability can be improved via appropriate choice of priority assignment and final non...

This paper investigates the use of genetic programming in automatized synthesis of scheduling heuristics. The applied scheduling technique is priority scheduling, where the next state of the system is determined based on priority values of certain system elements. The evolved solutions are compared with existing scheduling heuristics for single machine dynamic problem and job shop scheduling wi...

This paper investigates the use of genetic programming in automatized synthesis of scheduling heuristics for an arbitrary performance criteria. The applied scheduling technique is priority scheduling, where the next state of the system is determined based on priority values of certain system elements. Genetic programming is used to create the priority function which, coupled with an appropriate...

This paper investigates the use of genetic programming in automatized synthesis of scheduling heuristics. The applied scheduling technique is priority scheduling, where the next state of the system is determined based on priority values of certain system elements. The evolved solutions are compared with existing scheduling heuristics for single machine dynamic problem and job shop scheduling wi...