Subversion Repositories programming

/*******************************************************************************
 * SJFScheduler.java
 *
 * This file holds the implementation of the SJFScheduler class, which is a
 * Shortest Job First Scheduler, non-preemptive.
 *
 * Copyright (c) 2006, Ira W. Snyder (devel@irasnyder.com)
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
 * IN THE SOFTWARE.
 ******************************************************************************/

import java.util.Comparator;
import java.util.Vector;
import java.lang.ClassCastException;

class SJFScheduler extends Scheduler
{
    /**
     * An SJFProcess is a Process with these additions:
     * 1) It has an add time associated with it
     */
    private class SJFProcess extends Process
    {
        public final int add_time;

        public SJFProcess (String name, int timeslice, int add_time)
        {
            super(name, timeslice);
            this.add_time = add_time;
        }
    }

    private Vector<SJFProcess> wait_queue;

    public SJFScheduler ()
    {
        super ();
        this.wait_queue = new Vector<SJFProcess> ();
    }

    public void addProcess (Process proc, int add_time)
    {
        wait_queue.add (new SJFProcess (proc.name, proc.timeslice, add_time));
    }

    private Process findShortest ()
    {
        Process shortest = new Process ("fake", Integer.MAX_VALUE);

        for (Process p : run_queue)
            if (p.timeslice < shortest.timeslice)
                shortest = p;

        return shortest;
    }

    protected boolean step ()
    {
        /* Leave if we are truly done */
        if (cur_proc == null && run_queue.isEmpty () && wait_queue.isEmpty ())
            return false;

        /* Create a clone of wait_queue. This is so we can delete things from
         * the actual wait_queue, while iterating over it */
        Vector<SJFProcess> wq_clone = (Vector<SJFProcess>)wait_queue.clone ();

        /* Pull anything that gets added at this time into run_queue */
        for (SJFProcess p : wq_clone)
            if (p.add_time == cur_time)
            {
                wait_queue.remove (p);
                run_queue.add (p);
            }

        /* If there is no process, then get one! */
        if (cur_proc == null)
            startProcess (findShortest ());

        /* If the current process is set to run, do so, return false */
        if (cur_proc.time_left > 0)
            scheduleCurrent ();
        else
            completeCurrent ();

        return true;
    }
}

/* vim: set ts=4 sts=4 sw=4 expandtab: */