test.0.cc

基于nachos模拟器的源代码

//     Test FCFS scheduling
//
#include "system.h"
#include "list.h"
#include "testcase.h"

//extern void TestScheduler( int );

//----------------------------------------------------------------------
// ThreadTest0
//      FCFS algorithm
//      Order of arrival: A, B, C, D, E, F, G, H, I
//      Process  Burst Time  Arrival Time
//        TA         7		  0
//        TB         2		  0
//        TC         5		  0
//        TD        12		100
//        TE        15		100
//        TF         1		100
//        TG         2		500
//        TH         3		500
//        TI         8		500
//----------------------------------------------------------------------

void
ThreadTest0()
{
 
    int  numThreads = 9;
    int  startTime[] = {   0,   0,   0, 100, 100, 100, 500, 500, 500,   0,   0};
    int  burstTime[] = {   7,   2,   5,  12,  15,   1,   2,   3,   8,   0,   0};
    int   priority[] = {   0,   0,   0,  00,  00,   0,   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_FCFS);

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

    TestScheduler( ( int ) procList );
}