TY - GEN

T1 - The Statistical Longest Path Problem and its Application to Delay Analysis of Logical Circuits

AU - Ando, Ei

AU - Yamashita, Masafumi

AU - Nakata, Toshio

AU - Matsunaga, Yusuke

PY - 2002

Y1 - 2002

N2 - 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 F̃(x) such that F̃(x) ≤ F(x) if F(x) ≥ α, given a constant α (0.5 ≤ α < 1.0). We conduct two experiments to demonstrate the accuracy of F̃(x).

AB - 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 F̃(x) such that F̃(x) ≤ F(x) if F(x) ≥ α, given a constant α (0.5 ≤ α < 1.0). We conduct two experiments to demonstrate the accuracy of F̃(x).

UR - http://www.scopus.com/inward/record.url?scp=0141649415&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0141649415&partnerID=8YFLogxK

U2 - 10.1145/589411.589440

DO - 10.1145/589411.589440

M3 - Conference contribution

AN - SCOPUS:0141649415

SN - 1581135262

SN - 9781581135268

T3 - ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems

SP - 134

EP - 139

BT - ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems

PB - Association for Computing Machinery (ACM)

T2 - ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems

Y2 - 2 December 2002 through 3 December 2002

ER -