COMP 3000 Lab 2 2011: Difference between revisions

From Soma-notes
← Older editNewer edit →
Saran (talk | contribs)
109 edits
performance on vm Code
Line 1: Line 1:
==Part A (in Tutorial)==
# Copy the ISO images from the class DVD to your computer.  Boot at least two of the ISOs in Virtualbox or VMware Player by creating a new virtual machine and using the ISO for the virtual CD drive.  For at least two distributions:
## Roughly how long did the VM take to boot completely?
## How similar is the environment to that available on the Lambda SCS hosts?
# Create an account on the class wiki.  What username did you choose?
# Look at /proc/cpuinfo in a Linux virtual machine (any distribution).  Is the "guest" CPU the same as that reported by the Windows "host"?
# Examine the PCI devices as reported by the command line program "lspci" and identify the video card.  Is this "virtual" video card the same as the "real" one that Windows uses?
# Compile the program hello.c (below) with <tt>gcc -O hello.c -o hello-dyn</tt> and then run it using the command <tt>ltrace ./hello-dyn</tt> .  What dynamic functions does the program call?
# Compile the same program with <tt>gcc -O -static hello.c -o hello-static</tt> .  Run this second binary with ltrace as before.  What dynamic functions does the program now call?
# Run strace on the static and dynamically compiled versions of hello.  How many system calls do they each produce?
# How can you make the output of hello.c go to the file "hello-output" by changing how it is invoked at the command line?
# How can you make the output of hello.c go to the file "hello-output" by changing its code?
/* hello.c */
#include <stdio.h>
#include <unistd.h>
int main(int argc, char *argv[])
{
        printf("Hello, world!\n");
        return 0;
}
==Part B (on your own)==
==Part B (on your own)==


Line 33: Line 9:
# What are two strategies for accelerating programs that are slow within VMs?
# What are two strategies for accelerating programs that are slow within VMs?
# What are "guest additions" for VMs?  What are they for?
# What are "guest additions" for VMs?  What are they for?
/* perf.c for linux */
#include <stdio.h>
#include <time.h>
#define TIMEVARS() clock_t start, stop; double sec
#define TIMESTART(msg) printf(msg "..."); fflush(stdout); start = clock()
#define TIMESTOP()  stop = clock(); \
sec = ((double)(stop-start))/CLOCKS_PER_SEC; \
printf("done (%.3f seconds)\n", sec) 
int main()
{
        int n1 = 12345,n2 = 188765;
        int i= 0 ,j=0,composite = 0;
        TIMEVARS();
        TIMESTART("Starting work");
        for(i = n1; i < n2; i++) {
                for(j = 2; j < i; j++) {
                        if (i%j == 0) {
                                composite++;
                                break;
                        }
                }
        }
        TIMESTOP();
        printf("%d primes found between %d and %d\n",n2-n1 - composite,n1,n2);
        return 0;
}
/* perf.c for windows - compile using Visual Studio C++ compiler 2010 */
#include "stdafx.h"
#include <cstdio>
#include <ctime>
#define TIMEVARS() clock_t start, stop; double sec
#define TIMESTART(msg) printf(msg "..."); fflush(stdout); start = clock()
#define TIMESTOP()  stop = clock(); \
sec = ((double)(stop-start))/CLOCKS_PER_SEC; \
printf("done (%.3f seconds)\n", sec)
int _tmain(int argc, _TCHAR* argv[])
{
        int n1 = 12345,n2 = 188765;
        int i= 0 ,j=0,composite = 0;
        TIMEVARS();
        TIMESTART("Starting work");
        for(i = n1; i < n2; i++) {
                for(j = 2; j < i; j++) {
                        if (i%j == 0) {
                                composite++;
                                break;
                        }
                }
        }
        TIMESTOP();
        printf("%d primes found between %d and %d\n",n2-n1 - composite,n1,n2);
        return 0;
}

Revision as of 14:36, 26 September 2011

Part B (on your own)

  1. Typically, what does a guest OS's hard disk look like to the host OS?
  2. Do guest OSs need the same device drivers as host OSs? Why?
  3. Why do we "open" files? Specifically, to what extent is it possible to do file I/O without open and close operations - assuming you could change the UNIX API?
  4. What is the relationship between dynamic library calls and system calls?
  5. What type of programs should run at near-native efficiency within a virtual machine? Why?
  6. What type of programs should be significantly slower within a virtual machine? Why?
  7. What are two strategies for accelerating programs that are slow within VMs?
  8. What are "guest additions" for VMs? What are they for?
/* perf.c for linux */
#include <stdio.h>
#include <time.h>

#define TIMEVARS() clock_t start, stop; double sec
#define TIMESTART(msg) printf(msg "..."); fflush(stdout); start = clock()
#define TIMESTOP()   stop = clock(); \
sec = ((double)(stop-start))/CLOCKS_PER_SEC; \
printf("done (%.3f seconds)\n", sec)  

int main()
{
        int n1 = 12345,n2 = 188765;
        int i= 0 ,j=0,composite = 0;
        TIMEVARS();
        TIMESTART("Starting work");
        for(i = n1; i < n2; i++) {
                for(j = 2; j < i; j++) {
                        if (i%j == 0) {
                                composite++;
                                break;
                        }
                }
        }
        TIMESTOP();
        printf("%d primes found between %d and %d\n",n2-n1 - composite,n1,n2);
        return 0;

}

/* perf.c for windows - compile using Visual Studio C++ compiler 2010 */
#include "stdafx.h"
#include <cstdio>
#include <ctime>

#define TIMEVARS() clock_t start, stop; double sec
#define TIMESTART(msg) printf(msg "..."); fflush(stdout); start = clock()
#define TIMESTOP()   stop = clock(); \
sec = ((double)(stop-start))/CLOCKS_PER_SEC; \
printf("done (%.3f seconds)\n", sec)

int _tmain(int argc, _TCHAR* argv[])
{
        int n1 = 12345,n2 = 188765;
        int i= 0 ,j=0,composite = 0;
        TIMEVARS();
        TIMESTART("Starting work");
        for(i = n1; i < n2; i++) {
                for(j = 2; j < i; j++) {
                        if (i%j == 0) {
                                composite++;
                                break;
                        }
                }
        }
        TIMESTOP();
        printf("%d primes found between %d and %d\n",n2-n1 - composite,n1,n2);
        return 0;

}
Retrieved from "https://homeostasis.scs.carleton.ca/wiki/index.php?title=COMP_3000_Lab_2_2011&oldid=9743"