update C benchmarks to have initial exact configs

Author: Hao Ren

runtime/examples/benchmark/src/approx_bm25.c

@@ -53,7 +53,7 @@ int compare_tokens(const char *t1, const char *t2) {
 //   thresholds: [4]
 //   thresholds_lower: [1]
 //   thresholds_upper: [1000]
-//   decisions: [0, 1]
+//   decisions: [0, 0]
 //   decision_values: [0, 1]
 // }
 int count_and_lower_words(char *str, int len, int state) {
@@ -212,7 +212,7 @@ int calculate_df(const char *term, char **corpus, int num_docs) {
 //   thresholds: [2000]
 //   thresholds_lower: [1]
 //   thresholds_upper: [40]
-//   decisions: [0, 1]
+//   decisions: [0, 0]
 //   decision_values: [0, 1, 2]
 // }
 void score_term_over_docs(
@@ -291,7 +291,7 @@ void approx_score_term_over_docs_2(
 //   thresholds: [6]
 //   thresholds_lower: [1]
 //   thresholds_upper: [5]
-//   decisions: [0, 1]
+//   decisions: [0, 0]
 //   decision_values: [0, 1, 2, 3]
 // }
 int lowering_corpus(char** corpus, char** lower_corpus, int* _num_docs, double *doc_lengths, DocumentScore *scores, int state) {
@@ -493,7 +493,7 @@ int main(int argc, char **argv)
    if (ranked_scores)
    {
        printf("Ranking results:\n");
-       for (int i = 0; i < printed_doc; ++i)
+       for (int i = 0; i < 1000; ++i)
        {
            int doc_index = ranked_scores[i].doc_index;
            printf("Rank %d: Doc %d (Score: %.4f) - \"%s\"\n",

runtime/examples/benchmark/src/approx_kb.c

@@ -29,7 +29,7 @@ int approx_state_identity(int state) { return state; }
 //   thresholds: [1]
 //   thresholds_lower: [1]
 //   thresholds_upper: [10]
-//   decisions: [0, 1]
+//   decisions: [0, 0]
 //   decision_values: [0, 1, 2]
 // }
 int parse_embedding(const char *embedding_str, float *embedding, int state) {
@@ -195,7 +195,7 @@ void approx_compute_similarities_with_state_2(int cos_state) {
 //   thresholds: [2]
 //   thresholds_lower: [1]
 //   thresholds_upper: [5]
-//   decisions: [0, 1]
+//   decisions: [0, 0]
 //   decision_values: [0, 1, 2]
 // }
 void compute_similarities_with_state(int cos_state) {

runtime/examples/benchmark/src/approx_kmeans.c

@@ -44,7 +44,7 @@ double compute_distance_sq(const double *point1, const double *point2, int dim,
 //   thresholds: [8]
 //   thresholds_lower: [1]
 //   thresholds_upper: [20]
-//   decisions: [1, 2]
+//   decisions: [0, 0]
 //   decision_values: [0, 1, 2, 3, 4]
 // }
 int choose_cluster(const double *point, double **centroids, int k, int dim,
@@ -76,7 +76,7 @@ void reset_accumulators(double **new_centroids, int *cluster_sizes, int k, int d
 //   thresholds: [10000]
 //   thresholds_lower: [1]
 //   thresholds_upper: [20]
-//   decisions: [1, 2]
+//   decisions: [0, 0]
 //   decision_values: [0, 1, 2, 3, 4]
 // }
 void assign_points_and_accumulate(double **points, double **centroids, int *assignments,
@@ -114,7 +114,7 @@ void recompute_centroids(double **centroids, double **new_centroids,
 //   thresholds: [10000]
 //   thresholds_lower: [1]
 //   thresholds_upper: [1000000]
-//   decisions: [1, 2]
+//   decisions: [0, 0]
 //   decision_values: [0, 1, 2, 3, 4]
 // }
 void run_kmeans_iterations(int max_iters, int k, int dim, int num_points,

runtime/examples/benchmark/src/approx_lavaMD.c

@@ -121,7 +121,7 @@ int pair_interaction(int pi, int pj, fp a2,
 //   thresholds: [60]
 //   thresholds_lower: [1]
 //   thresholds_upper: [100]
-//   decisions: [1, 2]
+//   decisions: [0, 0]
 //   decision_values: [1, 2, 3, 4]
 // }
 static void self_box_accumulate(int pi_idx, int first_i, fp a2,
@@ -149,7 +149,7 @@ static void self_box_accumulate(int pi_idx, int first_i, fp a2,
 //   thresholds: [6]
 //   thresholds_lower: [1]
 //   thresholds_upper: [10]
-//   decisions: [1, 2]
+//   decisions: [0, 0]
 //   decision_values: [0, 1, 2, 3]
 // }
 void neighbor_box_accumulate(int pi_idx, int bx, fp a2,

runtime/examples/benchmark/src/approx_pagerank.c

@@ -264,7 +264,7 @@ double approx_update_node_rank_2(const GraphCSR *G,
 //   thresholds: [24]
 //   thresholds_lower: [1]
 //   thresholds_upper: [50]
-//   decisions: [0, 1]
+//   decisions: [0, 0]
 //   decision_values: [0, 1, 2]
 // }
 double update_node_rank(const GraphCSR *G,
@@ -372,7 +372,7 @@ void *approx_pagerank_worker_impl_2(void *argp, int state) {
 //   thresholds: [3]
 //   thresholds_lower: [1]
 //   thresholds_upper: [5]
-//   decisions: [0, 1]
+//   decisions: [0, 0]
 //   decision_values: [0, 1, 2]
 // }
 void *pagerank_worker_impl(void *argp, int state) {