/* Description:
* This file contains a simple program for statistically
* calculating pi using a specific scheduling policy.
*/
/* Local Includes */
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
#include <math.h>
#include <errno.h>
#include <sched.h>
#include <fcntl.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <sched.h>
#define DEFAULT_ITERATIONS 1000000
#define RADIUS (RAND_MAX / 2)
inline double dist(double x0, double y0, double x1, double y1){
return sqrt(pow((x1-x0),2) + pow((y1-y0),2));
}
inline double zeroDist(double x, double y){
return dist(0, 0, x, y);
}
int main(int argc, char* argv[]){
long i;
long iterations;
struct sched_param param;
int policy, numProcesses;
double x, y;
double inCircle = 0.0;
double inSquare = 0.0;
double pCircle = 0.0;
double piCalc = 0.0;
pid_t id;
/* Process program arguments to select iterations and policy */
/* Set iterations if supplied or set to DEFAULT_ITERATIONS*/
if(argc > 2){
iterations = atol(argv[1]);
printf("iterations is: %d\n", iterations);
if(iterations < 1){
fprintf(stderr, "Bad iterations value\n");
exit(EXIT_FAILURE);
}
}
else{
iterations = DEFAULT_ITERATIONS;
}
/* Set default policy if not supplied */
if(argc < 3){
policy = SCHED_OTHER;
}
else{
if(!strcmp(argv[2], "SCHED_OTHER")){
policy = SCHED_OTHER;
}
else if(!strcmp(argv[2], "SCHED_FIFO")){
policy = SCHED_FIFO;
}
else if(!strcmp(argv[2], "SCHED_RR")){
policy = SCHED_RR;
}
else{
fprintf(stderr, "Unhandeled scheduling policy\n");
exit(EXIT_FAILURE);
}
}
// Set number of processes if not supplied
if(argc < 4){
numProcesses = 1; //set numProcesses = 1 if not set
}
else{
numProcesses = atol(argv[3]);
}
/* Set policy if supplied */
/*if(argc > 2){
if(!strcmp(argv[2], "SCHED_OTHER")){
policy = SCHED_OTHER;
}
else if(!strcmp(argv[2], "SCHED_FIFO")){
policy = SCHED_FIFO;
}
else if(!strcmp(argv[2], "SCHED_RR")){
policy = SCHED_RR;
}
else{
fprintf(stderr, "Unhandeled scheduling policy\n");
exit(EXIT_FAILURE);
}
}*/
//set number of processes to be forke if supplied
/*if(argc > 3){
numProcesses = atol(argv[3]);
}*/
/* Set process to max priority for given scheduler */
param.sched_priority = sched_get_priority_max(policy);
/* Set new scheduler policy */
fprintf(stdout, "Current Scheduling Policy: %d\n", sched_getscheduler(0));
fprintf(stdout, "Setting Scheduling Policy to: %d\n", policy);
printf("sched_setscheduler(0, policy, ¶m): %d\n", sched_setscheduler(id, policy, ¶m));
if(sched_setscheduler(id, policy, ¶m)){
perror("Error setting scheduler policy");
exit(EXIT_FAILURE);
}
fprintf(stdout, "New Scheduling Policy: %d\n", sched_getscheduler(0));
/* Fork N children */
for (i = 0; i < numProcesses; i++){
id = fork();
if(id == 0){ //child process
printf("Child process %d created\n", id);
/* Calculate pi using statistical methode across all iterations*/
for(i=0; i<iterations; i++){
x = (random() % (RADIUS * 2)) - RADIUS;
y = (random() % (RADIUS * 2)) - RADIUS;
if(zeroDist(x,y) < RADIUS){
inCircle++;
}
inSquare++;
}
/* Finish calculation */
pCircle = inCircle/inSquare;
piCalc = pCircle * 4.0;
/* Print result */
fprintf(stdout, "pi = %f\n", piCalc);
break;
}
else if(id > 0){ //parent
printf("Parent is %d\n", id);
int status = 0;
waitpid(id, &status, 0);
}
else{ //error
printf("Error. pid %d is negative\n", id );
}
}
return 0;
}