the program, generate a chart that depicts the performance of each of the algorithms

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

Loop for 1,000 experiments

            Generate page address stream (similar to Figure 8.14, see next page)

            Loop for working set size from 2 through 20

                        Faults[working set size][LRU] += LRU( working set size, stream)

                        Faults[working set size][FIFO] += FIFO ( working set size, stream)

                        Faults[working set size][Clock] += Clock ( working set size, stream)

                        Faults[working set size][Random] += Random ( working set size, stream)

            End of working set size loop

End of Experiment loop

Loop for working set size from 2 through 20

Test trace with:

                        Print( working set size,

Faults[working set size][LRU] / 1000.0,

                                    Faults[working set size][FIFO] / 1000.0,

                                    Faults[working set size][Clock] / 1000.0,

                                    Faults[working set size][Random] / 1000.0 )

End of working set size loop

 

Each function ( LRU, FIFO, Clock, and Random ) count the number of page faults which occur for a page address stream based on the working set size

External to the program, generate a chart that depicts the performance of each of the algorithms (similar to Figure 8.16).

 

 

Generate page address stream

Each page address stream is 1,000 page addresses.

for( part=0; part<10; part++ )

            Base address equals 25 times a uniform random value in [0,9], inclusive.

for( index=0; index <100; index ++ )

                        Address[100*part+index] = Base + normal random number in [0,25], inclusive.

 

Uniform random number generator

int uniform( int lo, int hi )

{

            int x, y = hi – lo + 1, z = RAND_MAX / y;

            while ( y <= (x = ( random() / z )) );

            return x + lo;

}

 

Normal random number generator

int normal ()

{

            int x = 0;

            for( int i=0; i<5; i++ )

            {

                        x += uniform( 0, 5 );

            }

            return x;

}

 

Related Questions

. The fundamental operations of create, read, update, and delete (CRUD) in either Python or Java

CS 340 Milestone One Guidelines and Rubric  Overview: For this assignment, you will implement the fundamental operations of create, read, update,

. Develop a program to emulate a purchase transaction at a retail store. This  program will have two classes, a LineItem class and a Transaction class

Retail Transaction Programming Project  Project Requirements:  Develop a program to emulate a purchase transaction at a retail store. This

. The following program contains five errors. Identify the errors and fix them

7COM1028   Secure Systems Programming   Referral Coursework: Secure

. Accepts the following from a user: Item Name Item Quantity Item Price Allows the user to create a file to store the sales receipt contents

Create a GUI program that:Accepts the following from a user:Item NameItem QuantityItem PriceAllows the user to create a file to store the sales receip

. The final project will encompass developing a web service using a software stack and implementing an industry-standard interface. Regardless of whether you choose to pursue application development goals as a pure developer or as a software engineer

CS 340 Final Project Guidelines and Rubric  Overview The final project will encompass developing a web service using a software stack and impleme