{"id":"W2948863035","doi":"10.1109/access.2019.2920917","title":"Parallel Multidimensional Lookahead Sorting Algorithm","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Speedup; Parallel computing; Overhead (engineering); Sorting; Sorting algorithm; Algorithm; Locality; Locality of reference; Parallel algorithm; CPU cache; Cache-oblivious algorithm; Cache; Cache algorithms","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.0002804464,0.0004030565,0.0006625323,0.001002548,0.0007797668,0.0009755433,0.00120885,0.0005648289,0.004964496],"category_scores_gemma":[0.0006393919,0.0002444304,0.0004901096,0.001217209,0.0003965709,0.001130991,0.0009873201,0.000728571,0.001760436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005637113,"about_ca_system_score_gemma":0.00133214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001343967,"about_ca_topic_score_gemma":0.001812722,"domain_scores_codex":[0.9995683,0.00004823424,0.00004119433,0.00007651978,0.0002210769,0.00004464248],"domain_scores_gemma":[0.9997248,0.0000439785,0.00002196968,0.00007017914,0.0001151504,0.00002398241],"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.0006846079,0.0001821342,0.001079183,0.0002426247,0.00007777324,0.0002549359,0.0001590249,0.105852,0.05249349,0.04837784,0.01806718,0.7725292],"study_design_scores_gemma":[0.0001451294,0.0002104339,0.0004969107,0.00003285352,0.00003955554,0.0004990516,0.00005666534,0.8843667,0.03908919,0.02605995,0.04894398,0.00005956435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01335485,0.0004733658,0.9781415,0.0002097841,0.0001862758,0.0001155544,0.0001798686,0.00201125,0.005327595],"genre_scores_gemma":[0.1176925,0.0003623431,0.8712598,0.000258864,0.00008456175,0.0001942695,0.0008314966,0.0001800801,0.009136162],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004964496,"threshold_uncertainty_score":0.01660788,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02410109803025487,"score_gpt":0.2965552075192603,"score_spread":0.2724541094890054,"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."}}