projects
/
pintos-anon
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
| inline |
side by side
(parent:
b5ced19
)
It's okay to use a single sorted queue for MLFQS.
author
Ben Pfaff
<blp@cs.stanford.edu>
Tue, 20 Dec 2005 22:32:05 +0000
(22:32 +0000)
committer
Ben Pfaff
<blp@cs.stanford.edu>
Tue, 20 Dec 2005 22:32:05 +0000
(22:32 +0000)
doc/threads.texi
patch
|
blob
|
history
diff --git
a/doc/threads.texi
b/doc/threads.texi
index 1093f335636dcc13c85e3bebe944129d97c7beae..0bc1534eb9c207e8166da68c8da37d2bc288a405 100644
(file)
--- a/
doc/threads.texi
+++ b/
doc/threads.texi
@@
-717,4
+717,10
@@
just before the first @func{printf} in @func{main}. Then modify
It doesn't have to. We won't test priority donation and the advanced
scheduler at the same time.
+
+@item Can I use one queue instead of 64 queues?
+
+Yes, that's fine. It's easiest to describe the algorithm in terms of 64
+separate queues, but that may not be the best implementation. If you
+use a single queue, it should probably be sorted.
@end table