資源分配演算法 的英文怎麼說

中文拼音 [zīyuánfēnpèiyǎnsuànfǎ]
資源分配演算法 英文
resource allocation algorithm
  • 資 : Ⅰ名詞1 （錢財; 費用） money; wealth; expenses 2 （資質） intelligence; endowment 3 （資格） quali...
  • 源 : 名詞1. （水流起頭的地方） source （of a river）; fountainhead 2. （來源） source; cause 3. （姓氏） a surname
  • 分 : 分Ⅰ名詞1. （成分） component 2. （職責和權利的限度） what is within one's duty or rights Ⅱ同 「份」Ⅲ動詞[書面語] （料想） judge
  • 配 : Ⅰ動詞1 （兩性結合） join in marriage 2 （使動物交配） mate （animals） 3 （按適當的標準或比例加以...
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 資源 : natural resources; resource
  1. A resource allocation algorithm based on conflict resolution

    一種基於沖突消解的資源分配演算法
  2. In chapter 2, we study resource assignment algorithms of load balancing of links

    在第二章研究了ipoverwdm網中基於鏈路負載均衡的資源分配演算法。
  3. Based on the available resources mapping algorithm using the directed acyclic graph, a new dynamic resource co - allocation algorithm is proposed to solve the dynamic problem of the resource co - allocation in the grid

    摘要針對網格系統中資源協同分配的動態性問題，分析了現有的基於有向無環圖的資源映射方法，提出了一種動態資源協同分配演算法。
  4. So, according to the characteristics of resource allocation problem, this paper gives the iterating algorithm by means of piecewise linearization. the algorithm is proved to be convergent

    因此，本文根據資源分配問題的特點，設計了適合於應用分解協調技術的逐點線性化迭代演算法，並證明了演算法的收斂性
  5. Therefore this paper proposes the delay equalization algorithm which can both guarantee the qos of high priority traffic and effectively reduce the delay of ubr traffic in broadband satellite network. it is based on the prediction and equalization the delay of vbr or abr traffic so that the saved slots can be allocated to ubr traffic. the approach of dynamic alternation slots between vbr and ubr traffic can improve the mean tdma frame utilization while reducing the delay of ubr traffic

    因此本文在基於流量估計的資源調度演算法基礎上，提出了一種在寬帶衛星網路下能夠保證高級別類業務qos ，同時又能夠有效地降低ubr業務時延的時延均衡（ delayequalization ）調度演算法，它是基於對vbr或abr業務時延的預測，均衡時延的方法，保證vbr或者abr業務qos的同時，將節省的時隙分配給ubr業務。
  6. We provide an ebr algorithm of streaming traffic using in wireless resource allocation policy and keeping compatibility with 3g umts qos standards. with analyses on the issues that affect streaming qos, we improve the cell re - selection with a third - period based method

    本文提出了一種適合流業務的ebr演算法模型來實現（ e ） gprs中無線資源分配並解決（ e ） gprs在qos保證上與3gumts標準的兼容。
  7. This article first analyzes a paradoxical phenomenon that is predominant in campus lan settings where there is a large amount of idle cpu cycles available while at the same time the computing needs from many researchers ca n ' t be met. it proposes an idea of setting up a campus computing grid with a detailed plan for its implementation, discusses the challenges of upscaling a campus computing grid into an internet computing grid and suggests possible solutions. gram ( grid resource allocation manager ) of globus toolkit 3. 2 and relative technology on it is studied, and the solutions to extend gram to support task rescheduling and the cooperation type task are proposed. the design and implement of the gram client based on web that is the kernel part of the task anagement module are discussed, and the design of resource discovery module and task transfer module are gived

    本文首先分析了校園網環境中存在大量計算資源閑置與科研人員科學計算需要得不到滿足之間的矛盾，給出了建立校園計算網格的構想及具體的設計方案，並提出了校園計算網格推廣到internet計算網格存在的問題及解決方案;研究了globustoolkit3 . 2中的資源分配管理器gram及其相關技術，並給出了擴展gram對任務再調度和協作型任務支持的解決方案;設計實現了校園計算網格中任務管理模塊的核心部分基於web的gram客戶端，並介紹了資源發現與任務遷移模塊的設計;然後在分析min - min調度演算法基礎上，借鑒qosguidedmin - min演算法的思想，並利用主機資源分類的思想，給出了在負載平衡和時間跨度都有較大改善的balance - qosguidedmin - min演算法模型的思想與實現;最後設計實現了調度演算法驗證模塊，並在此模塊上對比了改進的演算法balance - qosguidedmin - min與min - min演算法的調度性能。
  8. On the basis of comparing and analyzing dominating production planning and control approaches, an integrated production planning approach combining network planning and theory of constraints is put forward. and then, some key problems with the approach were studied, such as equipment resources assigned, bottleneck identified, selection of the operation priority rules, and optimization algorithm base on theory of constraints

    然後，在比較與分析了當前主要幾種生產計劃與控制方法的基礎上，提出了一種基於網路計劃與約束理論集成的模具生產計劃與管理的方法，並重點研究了網路計劃與約束理論集成方法的資源分配、瓶頸資源識別、工序優先級別選擇以及基於約束理論的優化演算法等問題。
  9. A simple adaptive resource allocation scheme for multiuser ofdm system

    系統自適應資源分配演算法
  10. In chapter 4 we study the resource allocation considering link load balancing. two methods, i. e., optical - layering method and mpls based method, are used

    第四章分兩種方法一基於光層的方法和mpls技術的方法，研究了ipoverwdm網中基於鏈路負載平衡的資源分配演算法。
  11. With the constraint of subcarrier switching path, a subcarrier label assignment strategy in satellite subcarrier switching networks was proposed for unsymmetrical transmission

    摘要分析了衛星通信副載波標記交換網路中網路對動態業務條件下非對稱業務傳輸的適應問題，提出了一種副載波標記劃分策略與資源分配演算法。
  12. If youve developed the proper resource allocation algorithms and policies, the reward is to sit back and watch as your finite resources are deployed to the right application at the right time to minimize service - level disruptions or to increase business value to your company

    如果已經開發了適當的資源分配演算法和策略，那麼您就可以坐在那兒，觀察自己的有限資源如何在正確的時間部署到正確的應用程序上，從而最小化服務不可用的級別，或者為您的公司提高業務的價值。
  13. In this paper we firstly illustrate the feasibility and advantages of eliminating intermediate layers, e. g. sdh / sonet and atm, to map the ip packets directly into wavelength channels. under this framework, we then f ocus our interest on the resource allocation of ip over wdm networks

    第二章研究了ipoverwdm網中支持qos的資源分配演算法，分兩種方法予以研究：一為基於光層的方法，採用固定選路后，資源分配問題就能簡化為波長分配問題，從而可大大簡化網路的控制和管理。
  14. In this paper, based on dynamic fuzzy logic, we proposed a mutil - agent coordinate work model in antagonistic environment and non - antagonistic environment in dealing with the mutil - agent system ' s work mechanism. and out ' s works include five respects as follows : ( 1 ) based on the principle of yielding, we gave the algorithm to resolve conflicts among agents. ( 2 ) based on the concept of set cover, we gave a generic algorithm to distribute the resource among agents

    本文基於動態模糊邏輯理論，針對多agent系統中在對抗和非對抗環境中的工作機理，建立了多agent基於對抗和非對抗環境的協調工作模型，主要包括如下幾個方面的工作： （ 1 ）基於讓步原則，給出了多agent的沖突消解演算法； （ 2 ）基於集合覆蓋的概念，給出了多agent的資源分配通用演算法（ 3 ）基於動態模糊邏輯，分析了當前agent的bdi模型的不足，並針對這些不足，給出了基於dfl的agent的心智模型。
  15. ( 3 ) for the wireless channels subject to several types of fading existing in different time scales, the dynamics of channel conditions are decoupled into two random processes with different mathematic properties in different time scales. two algorithms in this scheme are proposed to dealing with each time scale : the resource optimizer allocates the resource to maximize the total revenue with price fairness and provide qos guarantees to applications, and the slot scheduler exploits the time variability of

    （ 3 ）針對無線通道衰落的多時間尺度特性，將通道條件snr分解到不同時間尺度上，在不同時間尺度上針對不同的衰落特性來設計不同的演算法，完成不同的任務：在大時間尺度（幀）上進行資源分配，面向應用提供qos保證，保持應用間price公平性的情況下，尋求系統總收益utility的最大化；在小時間尺度（時隙）上進行時隙調度，利用各用戶通道容量的時變性，使各用戶獲得比平均通道條件情況下更高的吞吐量。
  16. Simulation results show that the developed scheme performs well in terms of qos performance metrics such as the lightpath hop length and the network maximal link load. for ip over wdm networks consist of oxcs and routers, which are inter - connected by optical fibers, chapter 3 presents a novel routing and wavelength assignment algorithm based on k - shortest path

    對于由大量路由器和oxc通過光纖互連而組成的ipoverwdm網路，第三章創新性地提出了將ip層矛咣層綜合考慮進行：路由選擇，並利用k ? ?最短路由對有長度限制的請求進行資源分配的演算法。
  17. A differentiated routing algorithm is proposed to route network traffic based on rdm bandwidth allocation model. advertising rdm model parameters and bandwidth utilization statics, different routing path is computed and established for different traffic class by using corresponding logical view of network. it is shown that diffroute can improve service quality in differentiated network effectly while improving resource utilization

    提出一種多路區分路由演算法：針對區分服務網路中存在的「類間效應」 ，以rdm鏈路帶寬分配模型為基礎，通過為不同類負載計算不同的傳輸通路，區分路由可以在確保資源分配公平性的基礎上有效改善各類網路負載的分佈狀況，提高區分服務網路的服務質量； 4
  18. However, in modern communications network, in order to utilize precious bandwidth resource efficiently, static allocation policies, which usually distribute bandwidth in advance, can not meet the demand of fast - growing communications

    然而，在現代通信網路中，為了有效地利用寶貴的帶寬資源，預先配置大小的靜態分配演算法已經不能適應快速發展的通信需要。
  19. The duty of real - time system is to provide time constraint guarantees for the real - time applications, in other words, it make the applications access to the resources they need timely. many works have devoted into individual resource scheduling ( i. e. processor capability, disk bandwidth and network bandwidth ). obtaining simultaneous and timely access to multiple resource is known to be a np - complete problem

    大量的研究工作集中在單純的網路帶寬、磁盤帶寬和處理器資源各自的調度優化上，而在同一個節點上同時使用多個資源的是比較復雜np完全問題，本文分析了一種在資源預留系統（ resourcekernel ）中解決該問題的途徑，聯合調度服務器（ css ） ，並對其中的關鍵問題? ?伸縮量分配（ slacksharing ）作出了改進，提出了一種基於當前系統負荷的分配演算法。
  20. At last we study the network surviving problem in wdm network with partial wavelength conversion. based on the layered graph, a routing and wavelength assignment algorithm based on qos in survivable wdm network is proposed. this results show that this algorithm can not only meet the different qos requirements of the client layer ’ s service, but also utilize the finite networking resources efficiently with the reduced blocking probability

    首先研究了部分波長可變wdm網狀網中的網路生存性，而後結合分層圖模型提出了一種在動態業務情況下的支持不同qos要求的路由波長分配演算法，模擬結果表明該演算法具有很好的性能，提高了全網的資源利用率，滿足了客戶層業務在建立光通路時不同的qos要求對網路阻塞率的要求。
分享友人
分享到 Line

分享到臉書