{"id":"W2896639624","doi":"10.1016/j.jpdc.2018.10.004","title":"Automatic generation of benchmarks for I/O-intensive parallel applications","year":2018,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"St. Francis Xavier University","funders":"University of Illinois at Urbana-Champaign; National Natural Science Foundation of China","keywords":"Computer science; Parallel computing; Benchmark (surveying); TRACE (psycholinguistics); Computation; Supercomputer; Overhead (engineering); Parallel I/O; Parallel algorithm; Algorithm; Programming language","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002832349,0.0001138182,0.0002752009,0.0001091691,0.0001705465,0.00005609406,0.0005174766,0.00006491705,0.000002696518],"category_scores_gemma":[0.0002971505,0.00009616801,0.00007105752,0.00024895,0.0001425324,0.0003355372,0.000204824,0.0001126292,8.191698e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003361886,"about_ca_system_score_gemma":0.0000579771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001986298,"about_ca_topic_score_gemma":0.000001422645,"domain_scores_codex":[0.9989025,0.00002448232,0.0005537692,0.0001759444,0.0001589336,0.0001843948],"domain_scores_gemma":[0.9977818,0.0001806842,0.0007561764,0.0002696411,0.0009512961,0.00006046978],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001074779,0.0003932307,0.002332313,0.0002937404,0.0004181484,0.00003305284,0.001791451,0.03351143,0.01215627,0.3307442,0.03187299,0.5863457],"study_design_scores_gemma":[0.0009511253,0.0005133888,0.001357781,0.00006990202,0.00003247155,0.0001683063,0.0003565706,0.9667289,0.001207621,0.02620177,0.00223151,0.0001806827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03208404,0.0003374598,0.9666293,0.0005343881,0.0001269896,0.000194725,0.0000265484,0.00004511036,0.00002150067],"genre_scores_gemma":[0.5817568,0.00001510123,0.4180245,0.0000491834,0.0001233253,0.000003925277,0.00002301753,0.000002822752,0.000001365777],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9332174,"threshold_uncertainty_score":0.3921617,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03221570556506162,"score_gpt":0.2941877268886827,"score_spread":0.2619720213236211,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}