| 412 |
ira |
1 |
/*******************************************************************************
|
|
|
2 |
* FCFSScheduler.java
|
|
|
3 |
*
|
|
|
4 |
* This file holds the implementation of the First Come First Serve Scheduler
|
| 415 |
ira |
5 |
* class for CS431 Project #1.
|
| 412 |
ira |
6 |
*
|
|
|
7 |
* Copyright (c) 2006, Ira W. Snyder (devel@irasnyder.com)
|
|
|
8 |
*
|
|
|
9 |
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
10 |
* of this software and associated documentation files (the "Software"), to deal
|
|
|
11 |
* in the Software without restriction, including without limitation the rights
|
|
|
12 |
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
13 |
* copies of the Software, and to permit persons to whom the Software is
|
|
|
14 |
* furnished to do so, subject to the following conditions:
|
|
|
15 |
*
|
|
|
16 |
* The above copyright notice and this permission notice shall be included in
|
|
|
17 |
* all copies or substantial portions of the Software.
|
|
|
18 |
*
|
|
|
19 |
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
20 |
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
21 |
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
22 |
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
23 |
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
|
24 |
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
|
|
25 |
* IN THE SOFTWARE.
|
|
|
26 |
******************************************************************************/
|
|
|
27 |
|
| 415 |
ira |
28 |
/**
|
|
|
29 |
* First-Come First-Served Scheduler.
|
|
|
30 |
*
|
|
|
31 |
* @class CS431 Fall 2006
|
|
|
32 |
* @author Ira W. Snyder (devel@irasnyder.com)
|
|
|
33 |
*/
|
|
|
34 |
public class FCFSScheduler extends Scheduler
|
| 412 |
ira |
35 |
{
|
| 415 |
ira |
36 |
/**
|
|
|
37 |
* Emulate a single time unit in a First-Come First-Served Scheduler.
|
|
|
38 |
*
|
|
|
39 |
* @return false if we are finished, true otherwise
|
|
|
40 |
*/
|
| 413 |
ira |
41 |
protected boolean step ()
|
| 412 |
ira |
42 |
{
|
| 413 |
ira |
43 |
/* Check if we're completely finished */
|
|
|
44 |
if (cur_proc == null && run_queue.isEmpty ())
|
|
|
45 |
return false;
|
| 412 |
ira |
46 |
|
| 413 |
ira |
47 |
/* Check if we have a process, if not, load one */
|
|
|
48 |
if (cur_proc == null)
|
|
|
49 |
startProcess (run_queue.elementAt (0));
|
| 412 |
ira |
50 |
|
| 413 |
ira |
51 |
/* If we're able, run the current process */
|
|
|
52 |
if (cur_proc.time_left > 0)
|
|
|
53 |
scheduleCurrent ();
|
|
|
54 |
else
|
|
|
55 |
completeCurrent ();
|
| 412 |
ira |
56 |
|
| 413 |
ira |
57 |
return true;
|
| 412 |
ira |
58 |
}
|
|
|
59 |
}
|
|
|
60 |
|
|
|
61 |
/* vim: set ts=4 sts=4 sw=4 expandtab: */
|
|
|
62 |
|