0
Multi-level scheduling method for multiplexing packets in a communications network
A method and system for data traffic management in telecommunications networks is presented. End user data streams are aggregated to achieve more efficient use of a communication channel. Bandwidth is dynamically allocated to the data streams of the various users, effectively reducing their communications costs. The system includes a class of service selector and a plurality of stream selectors. Each stream selector is associated with a single budget category. Data is placed into queues according to a priority assigned by the end user. Data packets are transmitted from their queues through the class of service selector and through one of the stream selectors in response to the traffic provided by the end users and the budget category subscriptions of the end users.
Wiki User
∙ 15y ago
Wiki User
∙ 9y agoMultilevel queue scheduling is an algorithm that partitions the ready queue to several separate queues. Each process in multilevel queue scheduling assigns the queues to one another based on memory size, process type, and process priority.
Add your answer:
Earn +20 pts
What is the collective noun for queue?
The noun 'queue' is a collective noun for a 'queue of people'.
What is a sentence for the word 'queue'?
A queue is a line, as standing in line to get a ticket, or standing in line to buy food. Get back in queue, you! Look at that queue. I've never seen a longer queue in front of the ticket box!
What does the British English word queue mean?
Queue = line (of people)
How do you spell it's in your queue?
That is the correct spelling of the word "queue" (a line or ordered list).
What type of noun is the word queue?
The noun 'queue' is a singular, common, concrete noun; a word for a line of people or vehicles awaiting their turn; a word for a thing. The word 'queue' is also a verb.
What CPU scheduling algorithm is used Windows NT?
Windows XP uses a quantum-based, preemptive priority scheduling algorithm
What are the advantages of multilevel queue scheduling?
we can apply the any algo on any level of queue. we can apply fifo, sjf(short job first) and round robin at any level. by doing this the efficiency of completing the process can be increased and every process will take the cpu burst
What are the Advantages and disadvantages of a queue?
The advantage of multilevel queue scheduling is that it covers all disadvantage of all others scheduling...................... The main disadvantage of multilevel queue scheduling is that it is very difficult to understand and it takes a lot of time........ By waqar ahmad awan (0333-9996376)
What is virtual round robin CPU scheduling?
A variant of round robin scheduling is called selfish round robin scheduling. In selfish round robin, there is a maximum limit on the number of processes that can be placed in the round-robin queue (including the process being executed by the CPU). After that maximum is reached, newly entering processes are placed on a holding queue. Processes in the holding queue do not get any time slice of the CPU. When a process in the round-robin queue completes and leaves the system, the oldest process in the holding queue is allowed to enter the round-robin queue
Define is circular queue with example?
A circular queue uses the same conventions as that of linear queue. Using Front will always point one position counterclockwise from the first element in the queue.
What kind of data structure is required to implement the round robin scheduling policy?
The circular queue data structure is required to implement the round robin scheduling policy. Round robin is similar to FCFS scheduling.
Explain with an example first come first serve scheduling algorithm?
By far the simplest CPU-scheduling algorithm is the first-come, first-served (FCFS) scheduling algorithm. With this scheme, the process that requests the CPU first is allocated the CPU first. The implementation of the FCFS policy is easily managed with a FIFO queue. When a process enters the ready queue, its PCB is linked onto the tail of the queue. When the CPU is free, it is allocated to the process at the head of the queue. The running process is then removed from the queue. The code for FCFS scheduling is simple to write and understand. The average waiting time under the FCFS policy, however, is often quite long. Consider the following set of processes that arrive at time 0, with the length of the CPU-burst time given in milliseconds:
What is aging in operating system?
After certain time if we increase the priority then lower priority jobs will get chance fast.this process is called aging.it is used for multilevel feedback queue.
Why in round robin new processes place at end of queue rather than at beginning?
in roundrobin scheduling each process is gven a fixed time to execute so whenever a new process arrives it is placed at the end of the queue,,,,,the advantage by doing this type of scheduling is response time will be gud...But the disadvantage waiting time is more
How do you say tail in french?
Une queue. Used to define the tail or the waiting queue.
What is average waiting time in round robin scheduling in operating system?
the total time that staying in the queue that wait for process of each process.
What is Multilevel feedback queue?
A multi-level feedback queue scheduling policy gives preference to short and I/O bound processes, it also rapidly establishes the nature of a process and schedules it accordingly. Multi-level feedback queues work on priorities. Processes are placed in separate queues based on their priority, this in turn is based on their CPU consumption and If a process uses too much of the CPU, it will be given a lower priority and therefore get less CPU time than fast and I/O bound processes. Any processes that do not complete in their allocated time slice / quantum are demoted to a queue of less priority, these lower priority queues generally have larger quantums / time slices. Each of the queues may use a different scheduling algorithm, this is done to make the overall scheduling method as efficient as possible. The features that may vary between different multi-level feedback queue scheduling methods are: - The number of queues - The scheduling algorithm assigned to each queue - The method used to promote/demote processes to different queues - The method that determines which queue a process enters --- Thomas Lee
