throughput latency 中文意思是什麼

throughput latency 解釋
把傳輸延遲
  1. These likenesses are the basis to analyze the architecture performance with queueing theory that has some good conclusion to meet the analysis of architecture performance. we also debate the maximum throughput in average and average latency of software architecture

    這些相似性構成了使用網路排隊理論分析體系結構的基礎,網路排隊理論有許多結論,這些結論能夠滿足體系結構性能分析的要求,文中主要分析了體系結構的平均最大吞吐量和平均響應時間。
  2. The performance metrics, access latency, throughput, hr hit ratio and bhr byte hit ratio are analyzed and discussed. simulations show that compared with caching only model, iwpcm can further improve the throughput, hr and bhr efficiently and reduce the access latency. the performance evaluation based on the spn model can provide a basis for implementation of web prefetching and caching and the combination of web prefetching and caching holds the promise of improving the qos of web systems

    對于緩存命中率和位元組命中率等性能指標,使用基於一階ppm prediction by partial match預測演算法,通過四種典型的緩存替換策略gdsf greedy dual size frequency , gdsize greedy dual size , lfu least frequently used , lru least recently used在僅緩存模型和一體化模型中的應用驗證了一體化模型比僅緩存技術具有更好的性能。
  3. Allows the tcp ip stack to give deference to low latency over higher throughput ; should be disabled

    允許tcp / ip棧適應在高吞吐量情況下低延時的情況;這個選項應該禁用。
  4. By using the replication live monitor, you will have the most important replication operational statistics, latency and throughput, at your fingertips

    通過使用repliation live monitor ,可以隨時獲得最重要的復制操作的統計信息。
  5. Finally it describes a new network task scheduling algorithm which considers both throughput and latency. the contributions of this paper are as below : proposed a new duplication based task scheduling algorithm for fork - join graph considering the communication limits between different processors, named tdc _ fj. the test results show that tdc _ fj is flexible and effective for fork - join graph and it achieves good performance and reduces the requirements of processors

    本文主要貢獻如下:提出了滿足通信限制的基於復制的優化fork - join調度演算法tdc _ fj , tdc _ fj利用基於復制的fork - join最優化調度結果來對fork - join任務圖進行調度,並且在調度過程中加入處理器之間的通信限制,也就是一條通信通道不能同時被兩個通信事件佔用。
  6. To shorten the throughput - constrained latency of data parallel pipelines in grids, an algorithm for optimizing task assignments was proposed

    摘要為了縮短網格中數據并行流水線在吞吐率受限下的延遲,提出了一種優化任務指派的演演算法。
分享友人