نتایج جستجو برای: round robin schesuling algorithm

تعداد نتایج: 800200  

Journal: :International Journal of Computer Applications 2014

2007
Fumio Ishizaki Gang Uk Hwang

In this paper, we focus on a packet scheduling algorithm exploiting multiuser diversity in wireless networks. We compare the delay performance of individual user under the scheduling algorithm exploiting multiuser diversity with that under the round-robin scheduling algorithm in order to reveal the characteristics of the scheduling algorithm exploiting multiuser diversity. For this purpose, we ...

2016

In recent years, the Internet has incremented the several incipient applications that rely on multicast transmission. This paper discusses the challenges of scheduling algorithms for multicast in high-speed switches that reduces the overhead of adaptation by selecting a HOL (Head of Line Cell) using Round Robin pointer. The objective of this paper is to design a scheduling algorithm called MDDR...

2016
Maysoon A. Mohammed Mazlina AbdulMajid Balsam A. Mustafa T. F. Hasan P. B. Galvin

In Round-Robin Scheduling, the quantum time is static and tasks are scheduled such that no process uses CPU time more than one slice time each cycle. If quantum time is too large, the response time of the processes will not be tolerated in an interactive environment. If quantum the time is too small, unnecessary frequent context switch may occur. Consequently, overheads result in fewer throughp...

2017
Maysoon A. Mohammed Mazlina AbdulMajid Balsam A. Mustafa T. F. Hasan A. Silberschatz P. B. Galvin

In Round-Robin Scheduling, the quantum time is static and tasks are scheduled such that no process uses CPU time more than one slice time each cycle. If quantum time is too large, the response time of the processes will not be tolerated in an interactive environment. If quantum the time is too small, unnecessary frequent context switch may occur. Consequently, overheads result in fewer throughp...

2002
M Kaykobad Pradipta Prometheus Mitra Irwin King

This paper improves the complexity of a newly introduced MST (Majority Spanning Tree) algorithm for ranking players of a round-robin tournament previously published.

Journal: :JIPS 2011
Wei Nie Houjun Wang Jong Hyuk Park

The IEEE 802.16 standard is supposed to provide a wide-range broadband wireless service, but it leaves the implementation of the wireless resource scheduler as an open issue. We have studied the scheduling problem and propose a two level scheduling (TLS) scheme with support for quality of service and fairness guarantees for downlink traffic in a WiMAX network. A central controller Base Station ...

Journal: :Computers & OR 1995
Mohammad Kaykobad Q. N. U. Ahmed A. T. M. Shafiqul Khalid Rezwan-al Bakhtiar

Scope and Purpose The problem of ranking players in a round-robin tournament is to rank players according to their performance in the tournament. Similar problem also arises in soliciting consumer preferences regarding a set of products and establishing funding priorities. In this paper we have developed a new heuristic algorithm where the number of violations has been chosen as the criterion o...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید