簇文件 的英文怎麼說

中文拼音 [cùwénjiàn]
簇文件 英文
clustered file
  • 簇 : Ⅰ動詞[書面語] （聚集; 簇擁） crowd together; form a cluster; pile up Ⅱ名詞（聚集成的團或堆） clus...
  • 文 : Ⅰ名詞1 （字） character; script; writing 2 （文字） language 3 （文章） literary composition; wri...
  • 件 : Ⅰ量詞（用於個體事物） piece; article; item Ⅱ名詞1. （指可以一一計算的事物） 2. （文件） letter; correspondence; paper; document
  • 文件 : 1 （公文、信件等） document; file; papers; instrument 2 [自動化] file; 文件保護 file protection; ...
  1. The paper will study the upper questions based on the two interconnection networks. first, we give a fault - tolerant routing algorithm under the connectivity of the crossed cube in o ( n ) time and the length of the longest routing path ; second, with the rapid progress in vlsi, the failing probability of processors and links is very low, the traditional connectivity underestimates the resilience of large networks / here by applying the concept " conditional connectivity " introduce by harary, we show that the n - crossed cube can tolerate up to 2n - 3 ( n > 2 ) processors failure and remain connected provide that all the neighbors of each processor do not ' fail at the same time, the result is the same as the hypercube. we also give a related algorithm in o ( n ) time, and the length of the longest path ; third, we apply cluster faun tolerance introduced by q. - p

    根據menger定理， n -維交叉立方體可以容納n - 1個故障頂點，我們給出了它的時間復雜度為o （ n ）的容錯路由選擇演算法及其最長路徑長度分析；在此基礎上本文證明， n -維交叉立方體的條件連通度為2n - 2 （ n 2 ） ，並給出了相應時間復雜度為o （ n ）的演算法及其最長路徑長度；除此之外，本文還證明當n -維交叉立方體中的故障簇個數不大於n - 1 ，其直徑不大於1 ，故障頂點總數不超過2n - 3 （ n 2 ）時，交叉立方體中任兩個無故障頂點都至少有一條可靠路徑。
  2. You can use folders to organize explicitly logical clusters of files within the hierarchy of a project

    可以使用文件夾在項目層次結構中顯式組織邏輯文件簇。
  3. For the next interconnection network, we proved the connectivity of the n - enhanced crossed cube is n + 1, and its conditional connectivity is 2n ( n > 3 ) provided that all the neighbors of each professor do not fail at the same time, which is better than the hypercube and the crossed cube, two related algorithms in o ( n ) time are also given ; more, we proved that the n - enhanced crossed cube can tolerate as many as n faulty clusters of diameter at most 1 with at most 2n - 1 faulty nodes in total ( n > 3 ), which is better than the hypercube and the crossed cube also

    本文證明n -維加強交叉立方體的連通度為n + l ，條件連通度為zn （ n > 3 ） ，簇容錯特徵數為（ n ， l ， zn ） ， （ : 1 > 3 ） ，這些性質都比交叉立方體的更優越。更進一步，木文也給出了加強交叉立方體的基於連通度的，條件連通度的時間復雜度為o （ n ）的容錯路由選擇演算法及最長路徑長度。
  4. In designing or selecting a topology for a parallel processing system, one fundamental consideration is system - level fault tolerance. in order to improve the fault tolerance, the paper analyses from the two following sides : one is by adding the less links related to the original networks, modifying the topology of the original one, we get higher fault tolerance of the new network ; the other is under the same topology network, ignoring the likelihood of one processor and ail its neighbors failing at the same time, or considering the distribution of the faulty nodes, that is studying the fault tolerance under the conditional connectivity or cluster - fault - lolerance

    本文以提高網路的容錯度為目的，從兩個方面分析互連網路的容錯性質：一是在原網路基礎上增加少量連接，使新型網路具有更高的連通度（容錯度為連通度減1 ） ；二是在給定互連網路拓撲結構下，考慮故障處理器發生的概率和故障處理器的分佈狀況，在其中的某一具體條件下，即在條件連通度和簇容錯下分析互連網路的容錯性能，從而得到更高的網路容錯度。
分享友人
分享到 Line

分享到臉書