matteo/sgpemv2
matteo/sgpemv2
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

- Fix bug in FCFS. Thanks, Filippo.

Browse source 
git-svn-id: svn://svn.gna.org/svn/sgpemv2/trunk@1126 3ecf2c5c-341e-0410-92b4-d18e462d057c
This commit is contained in:
tchernobog 2006-09-13 11:59:44 +00:00
parent b4dd5d592c
commit 9c50d712f3
4 changed files with 11 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

10
doc/sgpem2uman.texi
View file

@ -809,7 +809,7 @@ It represent the processes status at each instant from the simulation beginning
to the actual one.@*
Into the graph is possible to view the processes only or both processes and threads.
@strong{Note:} this graph illustrates the @emph{past}. After each simulation
@strong{Watch out:} this graph illustrates the @emph{past}. After each simulation
step is gone, the corresponding processes'/threads' states are drawn.
The graph is divided in three areas:
@ -1197,8 +1197,10 @@ that the name of the class have to be the same of the name of the file
11 def sort_queue(self, event, queue):
@strong{12 cmpf = lambda a, b: \
a.get_schedulable().get_arrival_time() <= \
b.get_schedulable().get_arrival_time()
a.get_schedulable().get_arrival_time() + \
a.get_process().get_arrival_time <= \
b.get_schedulable().get_arrival_time() + \
b.get_process().get_arrival_time
13 self.sort(queue,cmpf)}
@end example
@sp 2
@ -1255,7 +1257,7 @@ parameter via @code{Policy.configure()} if the policy is
time-sliced, to ensure greater flexibility.
@sp 1
@item body of @code{ def sort_queue(self, event, queue):} line 12,13
@item body of @code{def sort_queue(self, event, queue):} line 12,13
Sort the queue of ready threads. This method is called by the
scheduler at each step of the simulation to sort the ready threads