Probabilistic approximation of a location problem

Lozhkin, S.A.; Romanov, D.S.; Gotmanov, A.N.; Dajnyak, A.B.; Zapadinsky, A.B.; Shupletsov, M.S.

Home Authors Papers Year of conference Themes Organizations To MES conference

Authors

Date of publication

2008

Abstract

The problem of allocation of combinational logic networks on a plane under condition of minimization of a delay on a critical way is considered. Nodes of a network are modelled by points on a plane, and connections – pieces of direct lines. The path delay is calculated as the sum of squares of lengths of connections (pieces), its components. As even in so simplified form the allocation problem remains calculationally complex, for its decision authors suggest to use the approached technique in which combinatory delay functional replaced with polynominals from coordinates of network nodes on a plane. For creation of approximation the probabalistic model of signal distribution is used, at which each path may be critical with some probability.

Keywords

allocation's problem

Library reference

Lozhkin S.A., Romanov D.S., Gotmanov A.N., Dajnyak A.B., Zapadinsky A.B., Shupletsov M.S. Probabilistic approximation of a location problem // Problems of Perspective Micro- and Nanoelectronic Systems Development - 2008. Proceedings / edited by A. Stempkovsky, Moscow, IPPM RAS, 2008. P. 132-135.

URL of paper

http://www.mes-conference.ru/data/year2008/20.pdf