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.
 ******************************************************************************/

/**
 * A Shortest Job First Scheduler
 *
 * @class CS431 Fall 2006
 * @author Ira W. Snyder (devel@irasnyder.com)
 */
public class SJFScheduler extends Scheduler
{
    /**
     * Find the Process with the shortest timeslice in the run queue.
     *
     * @return the Process with the shortest timeslice
     */
    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;
    }

    /**
     * Emulate a single time unit in a Shortest Job First scheduler.
     *
     * @return false if the scheduler is finished, true otherwise
     */
    protected boolean step ()
    {
        /* Leave if we are truly done */
        if (schedulerFinished ())
            return false;

        /* Pull in any new processes */
        queueWaitingProcesses ();

        /* 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: */