Simulation of queues, Data Structure & Algorithms

Simulation is the process of making an abstract model of a real world situation in order to be aware of the effect of modifications and alterations and the effect of introducing number of strategies on the situation. The simulation program must necessity schedule the events in the simulation so the activities occur in the correct time sequence.  Take an example, suppose a person visit an outlet at time 't1' to deposit the bill of his cell phone. The transaction can be expected to take a certain period of the time 't2' to complete. If any of the service window is free or not busy, then the person can immediately deposit the bill in time (t1+t2) spending the exact time required to deposit the bill. If none of the service window is free and there is long queue waiting at each window. Then the person joins the smallest queue and waits until all previous people deposits their bills and leaves the line. In such case, the time spends by person in the bill office in t2+time spends in waiting. These kinds of problem are solved by writing a program to simulate the actions of the persons. The various service windows can be represented by different queues and each person waiting in that line is represented by the node in that particular queue. The node at the front of the queue represents the person currently taking service at the window. We can define  various  events related  with  the  process  like  arrival  of  a  person and departure of a person etc.

When a departure node is removed from the event list when the person leaves, the amount of time spent by  the  departing  person  is  computed  and  added  to  a  total  and  the  node representing the person is separated from the front of the queue. After a node has been removed from the front of the queue, the next person in the queue becomes the first to be service window and a departure node is added to the event list. At the end of simulation, when the event list gets empty, the total sum will be divided by the number of persons to obtain the average time spent by a person.

 

 

Posted Date: 7/10/2012 6:15:43 AM | Location : United States







Related Discussions:- Simulation of queues, Assignment Help, Ask Question on Simulation of queues, Get Answer, Expert's Help, Simulation of queues Discussions

Write discussion on Simulation of queues
Your posts are moderated
Related Questions
In assignment, you have already started the process of designing a database for the Beauty Salon mini-case (enclosed again below), mainly in the phase of conceptual database design

It is a naturally occurring sorting method exemplified through a card player arranging the cards dealt to him. He picks up the cards like they are dealt & added them into the neede

What is a linear array? An array is a way to reference a series of memory locations using the similar name. Every memory location is shown by an array element. An  array elemen

write an algorithm given each students name and grade points for six courses.find his grade point average and group students into the gpa groups 3.5

Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various luminous jewels of particular colour. Nec

Explain Internal and External Nodes  To  draw  the  tree's  extension  by  changing  the  empty  subtrees  by  special nodes. The  extra  nodes shown by little squares are know

The maximum degree of any vertex in a simple graph with n vertices is (n-1) is the maximum degree of the vertex in a simple graph.

Krushkal's algorithm uses the concept of forest of trees. At first the forest contains n single node trees (and no edges). At each of the step, we add on one (the cheapest one) edg

In a circular linked list There is no beginning and no end.

State the complex reallocation procedure Some languages provide arrays whose sizes are established at run-time and can change during execution. These dynamic arrays have an in