{"id":"W2000185635","doi":"10.1006/jpdc.2002.1861","title":"Efficient Selection and Sorting Schemes Using Coteries for Processing Large Distributed Files","year":2002,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Sorting; Node (physics); Quicksort; Sorting algorithm; Key (lock); Selection (genetic algorithm); Ranking (information retrieval); Scheme (mathematics); Theoretical computer science; Binary logarithm; Sorting network; Distributed computing; Computer network; sort; Algorithm; Mathematics; Discrete mathematics; Information retrieval; Operating system; Artificial intelligence","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.0009144407,0.0007236107,0.0009457385,0.001513225,0.001813473,0.001856189,0.002098753,0.0008050685,0.007881727],"category_scores_gemma":[0.002670348,0.0005457799,0.0004512091,0.002668609,0.0006280877,0.001919075,0.001716753,0.0006971419,0.001469244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001186498,"about_ca_system_score_gemma":0.001694156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004845299,"about_ca_topic_score_gemma":0.0124635,"domain_scores_codex":[0.9993129,0.0001199651,0.00008789985,0.0001351192,0.000211885,0.0001322241],"domain_scores_gemma":[0.9974117,0.0005963042,0.0001846519,0.0008925945,0.0006955372,0.0002192729],"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.004946954,0.0005609838,0.00496538,0.0003394203,0.0001276009,0.0002515128,0.0004898404,0.02498743,0.1349123,0.02794314,0.01946225,0.7810132],"study_design_scores_gemma":[0.001063413,0.001464438,0.004717963,0.00008207265,0.0002261133,0.0007336553,0.000532073,0.7287668,0.1894698,0.03541285,0.03734228,0.0001885213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2839087,0.001106543,0.693849,0.0005918478,0.0005841061,0.0003805927,0.0004611878,0.0109381,0.00818003],"genre_scores_gemma":[0.4489427,0.0003565849,0.5310459,0.000325191,0.0001071891,0.0002145491,0.0009191076,0.0004264258,0.01766234],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007881727,"threshold_uncertainty_score":0.02636701,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02461302314226602,"score_gpt":0.2677037008635714,"score_spread":0.2430906777213054,"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."}}