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

Ei Ando, Masafumi Yamashita, Toshio Nakata, Yusuke Matsunaga

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

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 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).

Original languageEnglish
Title of host publicationACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems
PublisherAssociation for Computing Machinery (ACM)
Pages134-139
Number of pages6
ISBN (Print)1581135262, 9781581135268
Publication statusPublished - Jan 1 2002
EventACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems - Monterey, CA, United States
Duration: Dec 2 2002Dec 3 2002

Publication series

NameACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems

Other

OtherACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems
CountryUnited States
CityMonterey, CA
Period12/2/0212/3/02

Fingerprint

Normal distribution
Distribution functions
Networks (circuits)
Random variables
Experiments

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Ando, E., Yamashita, M., Nakata, T., & Matsunaga, Y. (2002). The Statistical Longest Path Problem and its Application to Delay Analysis of Logical Circuits. In ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems (pp. 134-139). (ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems). Association for Computing Machinery (ACM).

The Statistical Longest Path Problem and its Application to Delay Analysis of Logical Circuits. / Ando, Ei; Yamashita, Masafumi; Nakata, Toshio; Matsunaga, Yusuke.

ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems. Association for Computing Machinery (ACM), 2002. p. 134-139 (ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ando, E, Yamashita, M, Nakata, T & Matsunaga, Y 2002, The Statistical Longest Path Problem and its Application to Delay Analysis of Logical Circuits. in ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems. ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, Association for Computing Machinery (ACM), pp. 134-139, ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, Monterey, CA, United States, 12/2/02.
Ando E, Yamashita M, Nakata T, Matsunaga Y. The Statistical Longest Path Problem and its Application to Delay Analysis of Logical Circuits. In ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems. Association for Computing Machinery (ACM). 2002. p. 134-139. (ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems).
Ando, Ei ; Yamashita, Masafumi ; Nakata, Toshio ; Matsunaga, Yusuke. / The Statistical Longest Path Problem and its Application to Delay Analysis of Logical Circuits. ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems. Association for Computing Machinery (ACM), 2002. pp. 134-139 (ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems).
@inproceedings{a5392ce126894c9e9b07471c6c4f002b,
title = "The Statistical Longest Path Problem and its Application to Delay Analysis of Logical Circuits",
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 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).",
author = "Ei Ando and Masafumi Yamashita and Toshio Nakata and Yusuke Matsunaga",
year = "2002",
month = "1",
day = "1",
language = "English",
isbn = "1581135262",
series = "ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems",
publisher = "Association for Computing Machinery (ACM)",
pages = "134--139",
booktitle = "ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems",
address = "United States",

}

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/1/1

Y1 - 2002/1/1

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

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)

ER -