瀏覽單個文章
葉利
Major Member
 
葉利的大頭照
 

加入日期: Oct 2006
文章: 203
嘗試翻譯,時間短促,難免有錯,望見諒。

1.Web-Conscious Storage Management for Web Proxies
用於代理主機之網路可意識型儲存管理

2.user-level disk management
用戶等級的磁碟管理

3.Using realistic trace-driven simulations we show that the proxy’s
使用可行的追蹤驅動模擬,我們展示代理主機的...

4.secondary storage I/O throughput can be improved by a factor of 18, enabling a single-disk proxy to serve around 500 (URL-get) operations per second.
輔助(或叫二級)記憶体輸入/輸出輸貫量可以通過18因子/因素得以改善,使得單一磁碟代理主機每秒鐘為大約500(獲得URL)項作業提供服務。

5.Our experimental evaluation suggests that Foxy outperforms traditional proxies such as SQUID by more than a factor of 7 under heavy load.
我們的實驗評估顯示,在大負荷載入量狀況下,Foxy勝過諸如SQUID一類傳統的代理伺服器7因子/因素。

6.non-caching mode
非快取模態

7.proof-of-concept proxy server
代理伺服器

8.cache miss
高速緩衝儲存器遺漏

9.data-locality
資料局部性

10.Most of the meta-data overhead that cripples web proxy performance can be traced to the storage of each URL in a separate file.
大部分元資料弱化網路代理主機之表現力的冗餘工作,可以追蹤至一個單獨的檔案中每個URL之儲存。

11.To eliminate this performance bottleneck we propose a novel URL-grouping method (called BUDDY), in which we store all the URLs into a small number of files.
為消除這種瓶頸,我們提議一種新型URL編組方式(稱爲BUDDY),利用這種方式,我們將所有URL儲存到少數幾個檔案内。

12.Towards this end, we develop a file-space management algorithm (called STREAM) that (much-like log-structured file systems) streams write operations to the disk: The web proxy stores all URLs in a single file organized in slots of 512 bytes long. Each URL occupies an integer number of (usually) contiguous slots.
爲了完成這項工作,我們開發出一種檔案空間管理演算法(叫做STREAM),這種演算法(很像日誌結構檔案系統),讓流通過寫操作將作業寫入磁碟:代理主機在一個組織在512數元組長度的磁格中的單一檔案内,儲存所有的URL。每個URL(通常)佔用一個整數鄰接磁格。

13.LAZY-READS technique
(注:如果LAZY不是一種縮略式的話)懶惰式讀取技術

14.NURL
抱歉,未能翻譯出。如果是INURL,為限定在URL中搜尋。

15.consider the case of an HTML page that contains several embedded images.
設想一個HTML頁面的個案,這個頁面内嵌有數張的圖片。

16.A first step towards improving the performance of read operations, LAZYREADS, reduce this overhead by clustering several read operations and by sending them to the disk together. This
grouping of read requests not only reduces the disk head ping-pong effect but also presents the system with better opportunities for disk head scheduling.
改善讀取作業的第一步,懶惰式讀取,通過叢集數個讀取作業,並將其一併發送至磁碟,減少冗餘/磁碟額外開銷。這種讀取的分組,不僅要求減少磁頭的交替作用,同時系統也獲得更佳機會進行磁頭作業排程。

17.ping-pong effect
交替術作用
舊 2006-10-10, 04:52 PM #3
回應時引用此文章
葉利離線中