parallel routing 中文意思是什麼
parallel routing
解釋
并行路由-
Describes the design and realization of partial run - time reconfigurable fpga in detail. in order to reduce the affect of the reconfiguration time on system execution time, mostly static circuit design method in logical design stage and incremental routing method in component implementation stage are proposed. the fft parallel processing algorithm is examined through vvp platform
本章詳細闡述了基於vvp平臺的多sharc功能插板的具體硬體實現，以動態重構fpga設計為核心，論述了局部動態重構fpga設計流程和方法，提出了極大靜態電路邏輯設計方法和遞增式布線方法，以達到減小動態重配置時間，提高系統運行效率的目的。 -
Abstract : an efficient parallel global router using random optimization that is independent of net ordering is roposed. parallel approaches are described and strategies guaranteeing the routing quality are discussed. the wire length model is implemented on multiprocessor, which enables the algorithm to approach feasibility of large - scale problems. timing - driven model on multiprocessor and wire length model on distributed processors are also presented. the parallel algorithm greatly reduces the run - time of routing. the experimental results show good speedups with no degradation of the routing quality
文摘:設計實現了一個高效的線長模式下基於多處理機的并行總體布線器.通過對非時延驅動模式下串、并行演算法的總運行時間和求解時間的比較，表明該并行演算法能夠在保證求解質量無明顯變化的前提下大大加快總體布線演算法的求解速度.同時，也提出了基於分散式體系結構的并行總體布線演算法 -
Optimal one - to - many parallel routing algorithm in n - star networks
網路中最優的點到多點平行路由演算法 -
Thirdly, we study an efficient parallel routing table computation algorithm, we describe xipeng ' s parallel routing table computation algorithm with formal method, and improve the dividing algorithm of area. the automatic finding and maintenance can be completed in the division
對xipeng提出的并行路由表計算方法進行了形式化的描述，對其發現和維護warr演算法進行了改進，實現了路由表計算過程中自動發現及維護warr的功能。 -
Based on the analysis and comparison on the normal design methods of distributing system, we propose a wholely distributed implementation method of ospf based on warr ( with - area - routing - region ), lay an emphasis on the parallel routing table computation and the design of the link state database, and describe the ospf protocol processing in detail. in the chapter four we give a software implementation of our design. the test of implementation proves that our design is feasible and correct
在對現有分散式系統一般設計方法分析比較的基礎上，提出了基於warr （ witharearoutingregion ）技術的全分佈ospf協議實現方案，重點對并行路由表計算及鏈路狀態數據庫發計進行了詳細研究，並詳細分析了osfp協議的各個處理過程，從軟體設計角度實現了該設計方案，實際測試環境測試的結果驗證了該方案的可行性及正確性，同時系統性能分析的結果表明，該設計方案能滿足tbit路由器設計需求。 -
By analyzing the normal parallel method and comparing parallel routing table computation based warr and jesper ' s parallel dijkstra algorithm, propose a scheme of distributed implementation of ospf protocol. secondly, based on the warr, we propose a wholely distributed implementation method of ospf
分析了可擴展tbit路由器結構的特點以及分散式系統協議并行的一般方法，並對基於warr方法的并行路由表計算和jesper的并行dijkstra演算法進行比較，選取加速ospf協議路由表計算的方法。 -
Tree construction is a commonly used approach in solving the multicast routing problem. one advantage of multicast tree is that data are distributed to different multicasting destinations along the branches in parallel, which reduces the delay. the other is that message need only be replicated at forking nodes, which minimizes the data replication, spares the network bandwidth, reduces the network load and lessens the congestion
實現組播的一般方式是建立組播樹，組播樹的優點在於：首先，信息以并行方式沿著樹枝發送到不同的組播終點，從而降低了信息傳遞的時延；其次，信息的復制只在樹的分支處進行，因此網路中需要傳送的復制信息量最少，能夠節約網路帶寬資源，降低網路負載，減少擁塞。 -
A parallel integrated algorithm for flexible qos multicast routing in the ip dwdm optical internet
的并行一體化多播路由演算法 -
12 lev g f, pippenger n, valiant l g. a fast parallel algorithm for routing in permutation networks. ieee transactions on computers, 1981, 30 : 93 - 100
為支持跨機器執行的網格化mpi grid - based mpis的自動化執行， superscheduler也支持多個節點之間的資源協分配co - allocation 。 -
In this method, each routing node runs a same ospf dameon and they do the routing computation and protocol processing independently based on their own warr. ospf damenoas commuciate by message delivery, with little semaphores needed to do the synchronization work between the dameons, and so we can get highly parallel degree between the dameons
該方案中，各個節點運行相同的ospf進程，並基於各自warr獨立進行路由計算和協議處理，進程間通過消息傳遞的方式進行通信，不需要太多的信號量進行同步，因此有很高的并行度。 -
On the above, to overcome the pre - maturity and low speed of search in the late phase of multicast routing algorithm based on genetic algorithm, the author gives the multi - population parallel annealing genetic multicast routing algorithm to solve the bandwidth, delay, delay jitter and packet loss constrained least - cost multicast routing problem, which combines the
在此基礎上，將多種群并行技術和退火技術相結合，以克服現有基於遺傳演算法的組播路由演算法過早收斂和後期搜索速度較慢的缺陷，且使用樹狀編碼方法，提出求解帶寬、時延、時延抖動和分組丟失率約束的代價最小組播樹的多種群并行退火遺傳組播路由演算法。 -
Design and realize the modeling method on the basis of network chart, emerging the choice structure and parallel structure, and automatically routing the execution of task by configuring the executed condition and next condition
摘要提出了一種基於有向網路圖的建模方法，將選擇結構和并行結構合併在一起，並在任務的配置過程中配置任務的執行條件和後置條件以路由任務的執行。
分享友人