Procesamiento de colas

División de Ingeniería
TC2007, Métodos cuantitativos y simulación
Profesor: Dr. Lino AA Notarantonio
Tarea número: ________ Fecha: lunes 9 de noviembre de 2009-------------------------------------------------

Final Project
In our final project, we are going to simulate four scheduling methods for arriving processes that we are going to explain later, with a queue of tenprocesses. This program will be done in C++ programming language.

A process by definition is a series of actions, changes, or functions bringing about a result. Systems engineering processing is aprocess for applying systems engineering techniques to the development of all kinds of systems. These processes are also related to stages in a system life cycle, as in Petri nets.
In computing science aprocess is a part of a computer program, consisting of one or more threads, that is being sequentially executed by a computer system that has the ability to run several computer programsconcurrently.

Scheduling refers to the way processes are assigned to run on the available process units. This assignment is carried out by software known as a scheduler or is sometimes referred to as adispatcher. This scheduling can also be classified as:
* LIFO
* FIFO
* SJF
* Priority

LIFO (last in, first out) - In LIFO method the process that arrives last is the first to beserved. It is usually programmed using a stack.

FIFO (First In First Out)–In this method the first process to arrive is the first process to be served, making a list of how they are arriving.

SJF(shortest job First)-the CPU determines the length of the process that will be done (time of CPU that the process needs to finish the task), and the order they will be attended in.

Priority- in thismethod the process has a priority mark, which will be read by the CPU and then the processor will make the decision of which process will be first (in order of priority level they’ll be served)....