Talk:Scheduling algorithm
In wireless communication systems, scheduling is an important concept. The basic task of a Scheduler is to allocate the radio resource among users. The function of scheduler in wireless networks is two fold: First to provide certain minimum required Quality of Service (QoS) to the user and second to maximize the system throughput. As wireless networks work in a traditional layered model, the scheduler works at medium access control (MAC) layer. There are many scheduling algorithms in the literature but mainly wireless schedulers can be classified in two broad categories.
1. Work - Conserving Schedulers. 2. Non - Work Conserving Schedulers.
A work conserving scheduler never remains idle if there is a packet to be transmitted in the queue. A non - work conserving scheduler is one which remains idle even if there is a packet to be transmitted in the queue while scheduler may be expecting for another packet of high priority.
I suggest that the data packet scheduling issues are removed from [[[scheduling (computing)]] and scheduling algorithm articles into a separate article on scheduling (communication). Perhaps the remaining scheduling algorithm article should be merged [[[scheduling (computing)]], which now focuses on operational systems and multitasking.
Which of all the scheduling disciplines, policies and articles belongs networking, and which belongs to operational systems?