نتایج جستجو برای: flow path design

تعداد نتایج: 1522003  

2007
A. Ying M. Narula M. Abdou Y. Ando I. Komada

The successful design and development of a complex system, like the ITER test blanket module (TBM) warrants the need f extensive computer aided engineering (CAE) activities. In this light, a sophisticated numerical flow solver (‘SC/Tetra’ by RADLE®), with a robust CAD interface, has been used to develop and evaluate helium coolant flow schemes for a solid breeder est blanket module design curre...

Journal: :Networks 2009
Andreas Bley

In this paper, we discuss the relation of unsplittable shortest path routing (USPR) to other routing schemes and study the approximability of three USPR network planning problems. Given a digraph D = (V,A) and a set K of directed commodities, an USPR is a set of flow paths Φ(s,t), (s, t) ∈ K, such that there exists a metric λ = (λa) ∈ Z+ with respect to which each Φ(s,t) is the unique shortest ...

2012
Pawan Tamta B. P. Pande H. S. Dhami R. K. Ahuja T. L. Magnanti G. G. Brown M. W. Carlyle J. Salmerón C. Burch R. D. Carr M. Marathe C. A. Phillips R. L. Church M. P. Scaparra K. J. Cormican D. P. Morton T. E. Harris F. S. Ross H. D. Ratliff G. T. Sicilia

We develop an algorithm which reduces the arbitrary instance of the network flow problem to a simple path disjoint network in polynomial time. Then the flow in each path is taken as the minimum of the arc capacities of that path from where the flow in each arc can be easily determined. The polynomial time algorithm can determine any instance of the network flow problem faster than the previousl...

Journal: :Networks 2007
Chandra Chekuri F. Bruce Shepherd Gianpaolo Oriolo Maria Grazia Scutellà

The authors settle the complexity status of the robust network design problem in undirected graphs. The fact that the flow-cut gap in general graphs can be large, poses some difficulty in establishing a hardness result. Instead, the authors introduce a single-source version of the problem where the flow-cut gap is known to be one. They then show that this restricted problem is coNP-Hard. This v...

2009
Farhad Mehdipour Hiroaki Honda Hiroshi Kataoka Koji Inoue Kazuaki Murakami

A large-scale reconfigurable data-path (LSRDP) processor based on single-flux quantum circuits has been proposed to overcome the barriers originating from the CMOS technology. LSRDP is integrated to a general purpose processor in a high-performance computing system to accelerate the execution of data flow graphs extracted from scientific applications. The LSRDP micro-architecture design procedu...

2013
Ankur Rai Navneet Singh

The path-segment-protecting p-cycles (“flow p-cycles” for short) have capacity efficiency near that of the Shared Backup Path-Protection (SBPP) scheme currently favoured for optical networking. In this paper a significant extension to the method of p-cycle is introduced for network protection. The Flow p-cycle is use to protect path segments of adjacent workingflow, directly straddle the p-cycl...

2009
Farhad Mehdipour Hiroaki Honda Hiroshi Kataoka Koji Inoue Kazuaki Murakami

A large-scale reconfigurable data-path (LSRDP) processor based on single-flux quantum circuits has been proposed to overcome the barriers originating from the CMOS technology. LSRDP is integrated to a general purpose processor in a high-performance computing system to accelerate the execution of data flow graphs extracted from scientific applications. The LSRDP micro-architecture design procedu...

2009
Farhad Mehdipour Hiroaki Honda Hiroshi Kataoka Koji Inoue Kazuaki Murakami

As a solution to gain high performance computation, a large-scale reconfigurable data-path (LSRDP) processor is introduced in this paper. LSRDP is implemented by virtue of single-flux quantum circuits and integrated to a general purpose processor to accelerate the execution of data flow graphs (DFGs) extracted from scientific applications. Design procedure of the LSRDP and particularly the proc...

2006
Danil Sokolov

A method for automated synthesis of asynchronous circuits using direct mapping for control path and data path is presented. The idea of direct mapping is that a graph specification of a system is translated into a circuit netlist by mapping the graph nodes into circuit elements and the graph arcs into circuit interconnects. The key feature of this approach is its low algorithmic complexity and ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید