{"id":"W3011330615","doi":"10.4230/lipics.opodis.2019.25","title":"On Memory, Communication, and Synchronous Schedulers When Moving and Computing","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Ottawa","funders":"Strategic International Collaborative Research Program; Japan Science and Technology Agency; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Robot; Constant (computer programming); Focus (optics); Shared memory; Euclidean geometry; Distributed computing; Theoretical computer science; Artificial intelligence; Parallel computing; Mathematics; Programming language","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005618453,0.0003187536,0.0004091539,0.0001049644,0.0005693719,0.000853472,0.001090043,0.000131075,0.000004208182],"category_scores_gemma":[0.0001423863,0.0003028188,0.00008368702,0.000195666,0.0001238456,0.000838468,0.0008774347,0.0003725148,0.00003610479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005239616,"about_ca_system_score_gemma":0.00005257646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002218703,"about_ca_topic_score_gemma":0.000002834632,"domain_scores_codex":[0.9980218,0.00007645937,0.0007703051,0.0003272788,0.0003151513,0.0004890261],"domain_scores_gemma":[0.9981738,0.0003399398,0.0003839811,0.0006475637,0.0001524996,0.0003021677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003455543,0.0007768397,0.02207284,0.006482858,0.001167357,0.0000383396,0.3326742,0.02508331,0.0001796688,0.33576,0.05441855,0.2210004],"study_design_scores_gemma":[0.002195145,0.0003183576,0.0007770055,0.0003515964,0.00001917765,0.0000691323,0.001294016,0.9799929,0.00007590037,0.001129553,0.01325648,0.0005207961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2722958,0.0002846841,0.7196712,0.002638639,0.0003343608,0.0008431749,0.00008784413,0.0004191771,0.003425141],"genre_scores_gemma":[0.9553518,0.00001938884,0.04194941,0.002447036,0.00007898873,0.00001174477,0.00009704542,0.00002115135,0.00002348505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9549095,"threshold_uncertainty_score":0.9999424,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01519221613903183,"score_gpt":0.232456800512032,"score_spread":0.2172645843730002,"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."}}