{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006797411,0.001975519,0.0007848413,0.00213033,0.0006527677,0.001050051,0.001861599,0.0006991843,0.006147579],"category_scores_gemma":[0.005402691,0.0006237901,0.0006328573,0.001371523,0.0003629729,0.0009802259,0.0009975244,0.0009540352,0.001693613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006021807,"about_ca_system_score_gemma":0.001556555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002813967,"about_ca_topic_score_gemma":0.00358743,"domain_scores_codex":[0.9991822,0.0001771365,0.00007381431,0.0001781224,0.0002545216,0.0001341561],"domain_scores_gemma":[0.9969642,0.001127308,0.0002206602,0.0004280863,0.001093606,0.0001661297],"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.003659729,0.0009464222,0.01528499,0.001426432,0.0001913783,0.001390457,0.0005950177,0.09837985,0.2177374,0.01127922,0.07647517,0.5726339],"study_design_scores_gemma":[0.0004295255,0.0004965034,0.005495129,0.00006991925,0.00009697435,0.0002473921,0.000241574,0.8059148,0.1580795,0.007763588,0.02109885,0.00006625683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4284993,0.001237429,0.4379292,0.0005769558,0.0007362337,0.0008438917,0.007495636,0.1068777,0.01580369],"genre_scores_gemma":[0.6489691,0.0002955282,0.3178433,0.0001960862,0.0001083596,0.000860089,0.02074335,0.00775386,0.003230341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006147579,"threshold_uncertainty_score":0.02056575,"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."}}