统计最长路径问题及其在逻辑电路延迟分析中的应用

TAU '02 Pub Date : 2002-12-02 DOI:10.1145/589411.589440

Ei Ando, M. Yamashita, Toshio Nakata, Y. Matsunaga

{"title":"统计最长路径问题及其在逻辑电路延迟分析中的应用","authors":"Ei Ando, M. Yamashita, Toshio Nakata, Y. Matsunaga","doi":"10.1145/589411.589440","DOIUrl":null,"url":null,"abstract":"This paper presents an algorithm for estimating, in the sense below, the length of a longest path of a given directed acyclic graph (DAG) whose edge lengths are given as random variables with normal distributions. Let F(x) be the distribution function of the length of a longest path of a given DAG. The algorithm computes a normal distribution function &Ftilde;(x) such that ˜F(x) 〈 F(x) if F(x) 〉 a, given a constant a (0.5 〈 a 〈 1.0). We conduct two experiments to demonstrate the accuracy of &Ftilde;(x).","PeriodicalId":338381,"journal":{"name":"TAU '02","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"The statistical longest path problem and its application to delay analysis of logical circuits\",\"authors\":\"Ei Ando, M. Yamashita, Toshio Nakata, Y. Matsunaga\",\"doi\":\"10.1145/589411.589440\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an algorithm for estimating, in the sense below, the length of a longest path of a given directed acyclic graph (DAG) whose edge lengths are given as random variables with normal distributions. Let F(x) be the distribution function of the length of a longest path of a given DAG. The algorithm computes a normal distribution function &Ftilde;(x) such that ˜F(x) 〈 F(x) if F(x) 〉 a, given a constant a (0.5 〈 a 〈 1.0). We conduct two experiments to demonstrate the accuracy of &Ftilde;(x).\",\"PeriodicalId\":338381,\"journal\":{\"name\":\"TAU '02\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-12-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"TAU '02\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/589411.589440\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"TAU '02","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/589411.589440","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

本文给出了一种估计给定有向无环图(DAG)的最长路径长度的算法，该有向无环图的边长度是正态分布的随机变量。设F(x)为给定DAG的最长路径长度的分布函数。该算法计算一个正态分布函数&Ftilde;(x)，如果给定常数a (0.5 < a < 1.0)， F(x) > a，则F(x) < F(x)。我们进行了两个实验来证明&Ftilde;(x)的准确性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The statistical longest path problem and its application to delay analysis of logical circuits

This paper presents an algorithm for estimating, in the sense below, the length of a longest path of a given directed acyclic graph (DAG) whose edge lengths are given as random variables with normal distributions. Let F(x) be the distribution function of the length of a longest path of a given DAG. The algorithm computes a normal distribution function &Ftilde;(x) such that ˜F(x) 〈 F(x) if F(x) 〉 a, given a constant a (0.5 〈 a 〈 1.0). We conduct two experiments to demonstrate the accuracy of &Ftilde;(x).

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

TAU '02

自引率

0.00%

发文量