{"id":"W2012846815","doi":"10.1145/2451916.2451956","title":"Buffer sizing for clock networks using robust geometric programming considering variations in buffer sizes","year":2013,"lang":"en","type":"article","venue":"","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures; Western Canada Research Grid; Compute Canada","keywords":"Sizing; Clock network; Skew; Buffer (optical fiber); Heuristics; Robustness (evolution); Geometric programming; Computer science; Mathematical optimization; Linear programming; Clock skew; Timing failure; Power (physics); Parallel computing; Algorithm; Jitter; Mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005536479,0.0008209731,0.0004808838,0.0005861438,0.0002405025,0.0006289036,0.0006807869,0.0004348446,0.001494339],"category_scores_gemma":[0.001234051,0.0003887532,0.0006213413,0.0006161324,0.0004635834,0.0008166354,0.0004680924,0.0005206962,0.0001535996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001072986,"about_ca_system_score_gemma":0.0008958124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002004383,"about_ca_topic_score_gemma":0.003028912,"domain_scores_codex":[0.9997631,0.0000692489,0.000008072914,0.00005955016,0.00007073145,0.00002940663],"domain_scores_gemma":[0.9996881,0.0001705312,0.00007349764,0.00002033722,0.00003886254,0.00000867944],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001216449,0.000006733726,0.00008666,0.00001952477,0.000006735152,0.00001525222,0.00001084089,0.9816881,0.003888745,0.003795181,0.0001422763,0.01032779],"study_design_scores_gemma":[0.000003380263,0.00002304995,0.00003513481,0.000002355249,0.000004940131,0.000009989975,0.000004747616,0.9958317,0.001519372,0.002240648,0.0003223212,0.000002393797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02762945,0.0001735074,0.969101,0.00009744639,0.00001531096,0.00004333905,0.00005169839,0.0001689451,0.002719295],"genre_scores_gemma":[0.5824402,0.000381264,0.4144611,0.00008812331,0.00003791036,0.000140438,0.0001242471,0.0001875473,0.002139145],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002004383,"threshold_uncertainty_score":0.007785082,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02583528047665263,"score_gpt":0.2179349536066769,"score_spread":0.1920996731300243,"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."}}