Filters








624 Hits in 11.3 sec

An Efficient SAN-Level Caching Method Based on Chunk-Aging

Yang Wang, Wei Xue, Yifeng Luo, Jiwu Shu
2007 2007 International Conference on Networking, Architecture, and Storage (NAS 2007)  
This paper proposes a SAN-level caching method employing chunk-aging to control the migrations of chunks of data from disks to cache, which takes the temporal distribution of chunk accesses into account  ...  Caching based on front-end hosts or back-end disk arrays lacks the intelligence to identify hot data chunks within a global view, while SAN-level caching can intelligently identify such hot ones and then  ...  Conclusion and Future Work This paper presents an efficient SAN-level caching method in which chunk-aging is proposed to control the migrations of hot data chunks, and by considering the access counts  ... 
doi:10.1109/nas.2007.11 dblp:conf/nas/ShuWXL07 fatcat:rtot7xsy4ndoxk4sqvmcczxw34

EdgeBuffer: Caching and prefetching content at the edge in the MobilityFirst future Internet architecture

Feixiong Zhang, Chenren Xu, Yanyong Zhang, K. K. Ramakrishnan, Shreyasee Mukherjee, Roy Yates, Thu Nguyen
2015 2015 IEEE 16th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM)  
on the aggregated network-level statistics.  ...  We discuss the proposed mobile content caching/prefetching method in the context of the MobilityFirst future Internet architecture.  ...  The RUC value is managed using an explicit aging method with a periodic aging function as discussed in [16] .  ... 
doi:10.1109/wowmom.2015.7158137 dblp:conf/wowmom/ZhangXZRMYN15 fatcat:avcafdfpazgxpfhk6kiy7vwwva

Cloud Computing Databases: Latest Trends And Architectural Concepts

Tarandeep Singh, Parvinder S. Sandhu
2011 Zenodo  
These services represent a variety of reformations of data management architectures, and more are on the horizon.  ...  Cloud services can provide efficiencies for application providers, both by limiting up-front capital expenses, and by reducing the cost of ownership over time.  ...  on DB server and db server stores the data on SAN.  ... 
doi:10.5281/zenodo.1057021 fatcat:3cykccfz7jab3h7bb2i5nwg7iy

Celleration

Eyal Zohar, Israel Cidon, Osnat (Ossi) Mokryn
2012 Proceedings of the Twelfth Workshop on Mobile Computing Systems & Applications - HotMobile '12  
These predictions establish an ad-hoc gateway-to-mobile TRE learning mechanism that leverages the gateway's history records and the user mobile device's cached content for an efficient TRE operation for  ...  Celleration is based on a novel TRE technique, in which the cellular gateway observes the forwarded chunks to identify the beginning of a previously observed chunk chain, which in turn is used as a reliable  ...  This helps to measure the effect of long-term chunk caching on the TRE efficiency.  ... 
doi:10.1145/2162081.2162096 dblp:conf/wmcsa/ZoharCM12 fatcat:rsn5koo3ijcbhj2pgzijtjgh5q

Efficient query processing in distributed search engines

Simon Jonassen
2012 SIGIR Forum  
Third, we elaborate on caching in Web search engines in two independent contributions. First, we present an analytical model that finds the optimal split in a static memory-based two-level cache.  ...  We present an efficient self-skipping inverted index designed for modern index compression methods and several query processing optimizations.  ...  Rocha-Junior for the useful advices and comments on the paper. Acknowledgments. This work was done while the second author was an intern at Yahoo!  ... 
doi:10.1145/2492189.2492201 fatcat:uwasxhngrfgntemkhawyv3te64

A Survey and Classification of Storage Deduplication Systems

João Paulo, José Pereira
2014 ACM Computing Surveys  
The automatic elimination of duplicate data in a storage system, commonly known as deduplication, is increasingly accepted as an effective technique to reduce storage costs.  ...  Since finding duplicates is potentially a resource intensive operation, it is invariably based on an indexing data structure that supports efficient matching of duplicate chunks.  ...  In virtualized hosts, each VM has its own page cache as a firstlevel cache mechanism, and when this mechanism fails to service an I/O request, a second-level hypervisor cache, shared by all VMs, is used  ... 
doi:10.1145/2611778 fatcat:kh76pmfu3nhlji4v5uyrfhgycu

A low-cost memory remapping scheme for address bus protection

Lan Gao, Jun Yang, Marek Chrobak, Youtao Zhang, San Nguyen, Hsien-Hsin S. Lee
2006 Proceedings of the 15th international conference on Parallel architectures and compilation techniques - PACT '06  
In this paper, we present an anatomy of these attempts and show that they impose great pressure on both the memory and the disk.  ...  The address sequence on the processor-memory bus can reveal abundant information about the control flow of a program.  ...  For example, an FPGA-based programmable device can be attached to an SMP bus to perform on-line cache emulations taking real-time bus traffic from real workloads [20] .  ... 
doi:10.1145/1152154.1152169 dblp:conf/IEEEpact/GaoYCZNL06 fatcat:vwwpfeqijbeihcybhqiph6tklq

Primary Data Deduplication - Large Scale Study and System Design

Ahmed El-Shimi, Ran Kalach, Ankit Kumar, Adi Ottean, Jin Li, Sudipta Sengupta
2012 USENIX Annual Technical Conference  
The findings are used to arrive at a chunking and compression approach which maximizes deduplication savings while minimizing the generated metadata and producing a uniform chunk size distribution.  ...  We present the architecture of a new primary data deduplication system and evaluate the deduplication performance and chunking aspects of the system.  ...  We divide the hashes into partitions based on either file type or file age and then, based on memory threshold, we load hashes to the index such that the index size is within the threshold.  ... 
dblp:conf/usenix/El-ShimiKKO0S12 fatcat:vhskhbziaba43mqa4rwynaqaqu

SMART-IO: SysteM-AwaRe Two-Level Data Organization for Efficient Scientific Analytics

Yuan Tian, Scott Klasky, Weikuan Yu, Hasan Abbasi, Bin Wang, Norbert Podhorszki, Ray Grout, Matthew Wolf
2012 2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems  
This scheme can adapt data layouts based on data characteristics and underlying storage systems, and enable efficient scientific analytics.  ...  To this end, we design a system-aware Optimized Chunking model, which aims to find an optimized organization that can strike for a good balance between data transfer efficiency and processing overhead.  ...  CONCLUSIONS The complexity of gigantic scientific data, and the physical limitation of current storage system pose a grand challenge on providing an efficient I/O method.  ... 
doi:10.1109/mascots.2012.30 dblp:conf/mascots/TianKYAWPGW12 fatcat:k5hf4igbpjasjdtrbxawrsj7aq

Energy and Performance Optimization of Demand Paging With OneNAND Flash

Yongsoo Joo, Yongseok Choi, Jaehyun Park, Chanik Park, Sung Woo Chung, Eui-Young Chung, Naehyuck Chang
2008 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
The deployment of such devices requires careful system-level resource management because of their impact on energy consumption and performance, and existing memory optimization techniques, such as the  ...  New fusion memory devices consisting of multiple heterogeneous memory components in a single die or package offer efficient ways to optimize embedded systems in terms of energy, performance, and cost.  ...  MRFU moves these "hot" chunks from the disk array to the SAN cache by tracking the access count of each chunk.  ... 
doi:10.1109/tcad.2008.2006081 fatcat:gbisuwop3vhyhopimu4hgqr74u

PRESIDIO

Lawrence L. You, Kristal T. Pollack, Darrell D. E. Long, K. Gopinath
2011 ACM Transactions on Storage  
In addition, the framework uses a virtualized content addressable store (VCAS) that hides from the user the complexity of knowing which space-efficient techniques are used, including chunk-based deduplication  ...  As an aid to the design of such systems, we evaluate and present various parameters that affect the efficiency of a storage system using empirical data.  ...  ACKNOWLEDGMENTS We thank Christos Karamonolis, Kave Eshghi and George Forman of Hewlett-Packard Laboratories for their help and insight into the behavior of file chunking.  ... 
doi:10.1145/1970348.1970351 fatcat:bmuwmv3zq5h75jlmk57xxiu6e4

Information Density Estimation for Content Retrieval in MANETs

M. Fiore, C. Casetti, C.-F. Chiasserini
2009 IEEE Transactions on Mobile Computing  
., without the intervention of servers), thus requiring an efficient query/response propagation algorithm to prevent network congestion.  ...  This paper focuses on a cooperative environment in wireless ad hoc networks, where mobile nodes share information in a peer-to-peer fashion.  ...  On the one hand, a node receiving the query replies by immediately sending all the requested chunks it has in its cache.  ... 
doi:10.1109/tmc.2008.110 fatcat:6fnn2d22mvasnhqzni4gt3cmeu

stdchk: A Checkpoint Storage System for Desktop Grid Computing

Samer Al-Kiswany, Matei Ripeanu, Sudharshan S. Vazhkudai, Abdullah Gharaibeh
2008 2008 The 28th International Conference on Distributed Computing Systems  
Checkpointing is an indispensable technique to provide fault tolerance for long-running high-throughput applications like those running on desktop grids.  ...  This article argues that a checkpoint storage system, optimized to operate in these environments, can offer multiple benefits: reduce the load on a traditional file system, offer high-performance through  ...  ., chunks names are based on a hash of their content.  ... 
doi:10.1109/icdcs.2008.19 dblp:conf/icdcs/Al-KiswanyRVG08 fatcat:v3w7yxewujd4zaadegep6ehvkm

Adaptive granularity memory systems

Doe Hyun Yoon, Min Kyu Jeong, Mattan Erez
2011 Proceeding of the 38th annual international symposium on Computer architecture - ISCA '11  
We augment virtual memory to allow each page to specify its preferred granularity of access based on spatial locality and errortolerance tradeoffs.  ...  We use sector caches and sub-ranked memory systems to implement adaptive granularity. We also show how to incorporate adaptive granularity into memory access scheduling.  ...  The cache hierarchy of the base system has an instruction pointer prefetcher for the instruction caches and a stream prefetcher for the data caches.  ... 
doi:10.1145/2000064.2000100 dblp:conf/isca/YoonJE11 fatcat:ty3xafhgl5dxbj3kz5v2uor3da

Adaptive granularity memory systems

Doe Hyun Yoon, Min Kyu Jeong, Mattan Erez
2011 SIGARCH Computer Architecture News  
We augment virtual memory to allow each page to specify its preferred granularity of access based on spatial locality and errortolerance tradeoffs.  ...  We use sector caches and sub-ranked memory systems to implement adaptive granularity. We also show how to incorporate adaptive granularity into memory access scheduling.  ...  The cache hierarchy of the base system has an instruction pointer prefetcher for the instruction caches and a stream prefetcher for the data caches.  ... 
doi:10.1145/2024723.2000100 fatcat:kwb7uoqcdnh4bhwaznn46udryq
« Previous Showing results 1 — 15 out of 624 results