Hello,
tonyex, I appreciate your help in evaluating the fit-PC. Compilation of OpenSSL took about 100sec on my AMD 4600+ (~ 9 times faster than the fit-PC according to your stats). If you don't mind, I have another 'benchmark' (I guess that term would apply) to try. Below is a program I wrote several months back - it is an insertion sort. If you could compile it and run it at 10,000 and 100,000 numbers. This will give me another fair gauge of the fit-PC level of performance in what I would be using it for.
On my AMD, compiling took ~1sec, 10,000 ~1sec, 100,000 ~10-15sec.
On the Compaq, compiling took ~1min., 10,000 ~40sec, I didn't run 100,000 but would guess about 6_1/2 to 10min.
sortCount.cc
Code:
/*
* CSIS 2617 Assignment 4
* Complexity of a Sort Function
*/
#include <iostream>
#include <stdlib.h>
#include <ctime>
/* function declarations */
void initArray (int, int [], int);
double insertionSort (int [], int);
/* main program */
int main()
{
int size, seed;
double num_compares;
std::cout << "How large of a list shall we sort?\n";
std::cin >> size;
int list[size];
seed = time(NULL);
initArray(seed, list, size);
num_compares = insertionSort(list, size);
std::cout << "For a random list size of "
<< size
<< std::endl
<< "the number of comparisions to sort it "
<< "via an insertion sort is "
<< num_compares
<< std::endl;
return 0;
}
/* routine to initialize an array with random ints */
void initArray (int seed, int list[], int size)
{
int i;
srand(seed);
for (i = 0; i < size; i++){
list[i] = rand();
}
}
/* routine to perform insertion sort */
double insertionSort (int list[], int size)
{
double count = 0;
int i, j, temp_val;
for (i = 1; i < size; i++){
temp_val = list[i];
for (j = i-1; j >= 0 && temp_val < list[j]; j--){
list[j+1] = list[j];
count++;
}
list[j+1] = temp_val;
}
return count;
}