Talk:Scheduling algorithm
From Wikipedia, the free encyclopedia
 |
This article is part of WikiProject Computer networking, an attempt to build a comprehensive and detailed guide to Computer networking on Wikipedia. If you would like to participate, you can edit the article attached to this page, or visit the project page, where you can join the project and/or contribute to the discussion. | |
| B | This article has been rated as B-Class on the assessment scale. | |
| Mid | This article is on a subject of mid priority within Computer networking for inclusion in Wikipedia 1.0. | |
|
Computer networking To-do:
|
||
[edit] Work/non-work conserving schedulers in communication systems
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.
137.111.13.34 05:28, 18 June 2006 (UTC)
- Okay. Non-work conserving (or conservative?) scheduling are only used in circuit-oriented TDMA systems, right? Any good examples? GSM?
- I suppose that work conserving scheduling is used in packet-switching, not only best-effort, but also systems where resources are reserved in advance (for example GPRS and ATM), and systems that offer guaranteed quality of service, since remaining capacity can be given to users that do not require any special service.
- Mange01 07:45, 21 October 2006 (UTC)
[edit] Separate communication article?
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 with [[[scheduling (computing)]], which now should focus on operational systems and multitasking.
Which of all the scheduling disciplines, policies and algorithms listed in the scheduling (computing) article belongs to networking, and which belongs to operational systems?
Is it possible to clearify what is an algorithm (such as fair queuing), and what is a policy or discipline (such as max-min fairness)?
Mange01 07:25, 21 October 2006 (UTC)
I would like to catch your attention to one of the key area of scheduling which we can not ignore, the scheduling of time for institutes and organizations. A lot of projects pending because of Non-solvability of scheduling problem, like one of the major IT firm is unable to schedule the time table for MIT.
