İşlemcinin verimliliğini arttırabilmek amacıyla bu çalışmada, Döner Çekirdek Algoritması, Genetik Algoritma ile geliştirilmiştir. Kuyrukta bekleyen işlemler ve onlara ait parametrelere uygun kuantum süresi seçilerek optimum değerlerin bulunması hedeflenmiştir.

Worldwide Interoperability for Microwave Access (WiMAX) networks were expected to be the main Broadband Wireless Access (BWA) technology that provided several services such as data, voice, and video services including different classes of Quality of Services (QoS), which in turn were defined by IEEE 802.16 standard. Scheduling in WiMAX became one of the most challenging issues, since it was res...

Minimizing waiting time for tasks waiting in the queue for execution is one of the important scheduling criteria which took a wide area in scheduling preemptive tasks. In this paper we present Changeable Time Quantum (CTQ) approach combined with the round-robin algorithm, we try to adjust the time quantum according to the burst times of the tasks in the ready queue. There are two important bene...

In this paper we introduce Burst Round Robin, a proportional-share scheduling algorithm as an attempt to combine the low scheduling overhead of round robin algorithms and favor shortest jobs. As being documented that weight readjustment enables existing proportional share schedulers to significantly reduce, but not eliminate, the unfairness in their allocations. We present a novel weight adjust...

We present an efficient algorithm for effecting round-robin service in discrete-event simulation systems. The approach generalizes and improves upon a previous approach in which a single arrival and a single departure event is considered and handled at a time; further, the previous approach is already an improvement over naive round-robin scheduling currently in use in simulation libraries. The...

Round-robin based packet scheduling algorithms are suitable for high-speed networks, but in a variable-length packet environment, this kind of scheduling algorithm need consider packet length to guarantee scheduling fairness. Previous schemes are not perfect for fairness and efficiency. This paper presents a new easily implementable scheduling discipline, called Resilient Quantum Round-Robin (R...

Round Robin (RR) CPU scheduling algorithm has been designed chiefly for time sharing systems. The RR algorithm has proven to be more useful in multiprogramming environment in which time slice or quantum is given to processes in the ready queue. An ideal classical RR uses a static quantum time which is gotten from the average of processes in the ready queue. One of the major challenges in classi...

We present Group Ratio Round-Robin (GR), the first proportional share scheduler that combines accurate proportional fairness scheduling behavior with O(1) scheduling overhead on both uniprocessor and multiprocessor systems. GR uses a simple grouping strategy to organize clients into groups of similar processor allocations which can be more easily scheduled. Using this strategy, GR combines the ...

The basic idea behind parallel database systems is to perform operations in parallel to reduce the response time and improve the system throughput. Data placement is a key factor on the performance of parallel database systems. This paper proposes two data partition strategies to decluster XML documents with very large size, Path Schema based Path Instance Balancing (PSPIB) strategy, in which a...

This paper proposes a pipeline-based concurrent round-robin dispatching scheme, called PCRRD, for Clos-network switches. Our previously proposed concurrent round-robin dispatching (CRRD) scheme provides 100% throughput under uniform traffic by using simple round-robin arbiters, but it has the strict timing constraint that the dispatching scheduling has to be completed within one cell time slot....