cache algorithms 中文意思是什麼

cache algorithms 解釋
快取文件置換機制
  • cache : n. 1. （探險者等貯藏糧食、器材等的）暗窖，密藏處。2. 貯藏物。3. 【計算機】高速緩沖內存。vt. 1. 貯藏；密藏；窖藏。2. 【計算機】把…儲存到硬盤上。
  • algorithms : 演算法式
  1. Topics covered include : specification and verification, concurrent algorithms, synchronization, naming, networking, replication techniques ( including distributed cache management ), and principles and algorithms for achieving reliability

    其中包含以下的主題：規格與驗證、同步演演算法、同步化、命名、網路、復制技術（包括分散式快取管理） ，以及確保系統可靠度的設計原則與演演算法。
  2. Excepting algorithms self, the software performance analysis and optimization always relate to the multi - hiberarchy storage archtechture, trying to utilize the nearside storage media such as register or level 1 cache and reduce actions on farside storage, and try to reach a linear performance, i. e. the computing performance only relate to the speed of cpu clock

    現在的軟體性能分析及其相關的性能優化，除了程序本身演算法之外，幾乎所有的分析和優化都是在這樣一個多級的存儲體系結構上進行的，試圖盡可能地利用近端的存儲，期望達到一個接近線速的計算性能，即計算的性能僅由cpu的處理速度決定，與其他外設和數據存儲無關。
  3. Next, proposing the grid resource access scheme. the goal is considering the resource provider ’ s and consumer ’ s behalf, and they can gain most interests, so that it can offer the motivation to attract them attending the grid. finally, proposing the optimization of grid cache management policy, and this paper gives the caculating method of the resource value, then gives the optimal admission policy of grid cache. because in the research of grid resource management, it is unnecessary to use real systems to evaluate the performance and accuracy of the algorithms, usually emulators are used to handle with it. several grid emulators are illustrated in this paper, and gridsim, a grid modeling and emulation toolkit, is introduced in details. finally, with the help of gridsim toolkit, the emulation of grid resource management algorithms with qos requirements is realized

    其目標是考慮到資源提供者和使用者兩方面的價值利益，使雙方都達到盡量大的收益，從而使資源提供者有足夠的動機繼續提供其資源共享，同時使使用者以盡量少的花費獲得較優的服務; （ 5 ）提出了基於經濟模型的網格cache管理優化，給出了網格cache判斷預測資源價值的計算公式，進而對網格cache策略進行了基於經濟的優化，主要是其接受策略的經濟優化。
  4. In this thesis, we present a thorough theoretical analysis and explanation of optimal cache - oblivious algorithms

    本文首先對高速緩存參數無關最優演算法的理論基礎進行全面的分析和闡述。
  5. We then do a performance investigation, comparing cache - oblivious algorithms with traditional ram - model algorithms. in the last, on the basis of thorough research, we present an optimal sub - linear working space cache - oblivious sorting algorithm. we conclude that cache - oblivious algorithms do outperform traditional ram - model algorithms when working on large data sets

    接著通過性能測試，把高速緩存參數無關演算法與傳統的基於ram模型的演算法做了比較，最後，在深入研究的基礎上提出了一個最優的子線性工作空間的高速緩存參數無關的排序演算法。
  6. In this way, associative database access is supported, and system performance and data availability during disconnection improve. based on this caching scheme, the thesis investigates thoroughly key issues on cache replacement strategy, cache coherency policy, and query processing algorithms

    基於該緩存機制，本文就緩存替換策略、緩存一致性維護策略和基於緩存的查詢處理這幾個關鍵技術對移動客戶緩存進行了深入的研究。
  7. It balances these two performance metrics. therefore, it can better estimate all the algorithms of proxy cache and the overall performance of a proxy caching system

    它體現了陳舊率和命中率的對比程度，能很好地衡量代理緩存的各種演算法的優劣和代理緩存系統的整體性能。
  8. This paper puts forward two basic querying algorithms : one is single node query algorithm based on cache, and the other is double node join algorithms based on cost model

    本文提出基於組緩沖的單點查詢演算法和基於代價的多點連接演算法兩種基本查詢演算法。
  9. 2. according to the research on proxy cache replacement policies, it is discussed that replacement algorithms based on cost / value model are preferable. however, the model requires to be modified and simplified to easily calculate, to reflect web access characteristics and to reduce access latency

    2 、通過對代理緩存的替換策略的研究，論述了基於成本價值模型的替換演算法是較優的，但必須修正和簡化其模型，使計算相對簡單，又能體現web的訪問特性，減少延遲。
分享友人
分享到 Line

分享到臉書