test.1.cpp

LINUX 下的 NACHOS 系统 实现系统调度的算法功能

//     Test Nonpreemptive Shortest Job First scheduling 


#include "system.h"
#include "list.h"
#include "testcase.h"

//----------------------------------------------------------------------
// ThreadTest1
//      Non-preemptive SJF scheduling algorithm
//      Order of arrival: All at same time 0
//      Process  Burst Time  Priority Arrival
//        P1        10          0        0
//        P2        29          0        0
//        P3         3          0        0
//        P4         7          0        0
//        P5        12          0        0
//----------------------------------------------------------------------

void ThreadTest1()
{
 
    int  numThreads = 5;
    int  startTime[] = {  0,  0,  0,  0,  0 };
    int  burstTime[] = { 10, 29,  3,  7, 12 };
    int   priority[] = {  0,  0,  0,  0,  0 };
    schedpair * a_pair;

    List<schedpair *> * procList = new List<schedpair *>();

    for( int i = 0; i < numThreads; i++ ) {
       a_pair = new schedpair;
       a_pair->burst = burstTime[i];
       a_pair->prior = priority[i];
       procList->SortedInsert( a_pair, startTime[i] );
    }

    scheduler->SetSchedPolicy(SCHED_SJF);

    printf("Starting at ");
    stats->PrintElapsedTicks();
    printf("Queuing threads.\n");

    TestScheduler( ( int ) procList );
}