Search 250 million research papers

Smart packaging cache

Algueró Raga, Pol · QRU Quaderns de Recerca en Urbanisme · 2013

Projecte realitzat en col·laboració amb l'empresa Pyton Communication Services B.V.

Cited by 0Open access

Exadata Smart Flash Cache

Martin Bach, Karl Arao, Andy Colvin et al. · Apress eBooks · 2015

Oracle marketing must really like the term smart. They have applied it to numerous different features on the Exadata platform. They also seem to like the term flash, which is associated with at least a half dozen features as well. To add to the confusion, there are two features in Oracle Database 12c Release 1 that have almost exactly the same names—Database Smart Flash Cache (DBFC) and Exadata Smart Flash Cache (ESFC). While both features make use of flash-based memory devices, they are very different. In this chapter, we will focus on ESFC and the OLTP optimizations and only mention DBFC in passing.

Cited by 0

Smart cache: A self adaptive cache architecture for energy efficiency

Karthik T. Sundararajan, Timothy M. Jones, Nigel Topham · Edinburgh Research Explorer · 2011

The demand for low-power embedded systems requires designers to tune processor parameters to avoid excessive energy wastage. Tuning on a per-application or per-application-phase basis allows a greater saving in energy consumption without a noticeable degradation in performance. On-chip caches often consume a significant fraction of the total energy budget and are therefore prime candidates for adaptation. Fixed-configuration caches must be designed to deliver low average memory access times across a wide range of potential applications. However, this can lead to excessive energy consumption for applications that do not require the full capacity or associativity of the cache at all times. Furthermore, in systems where the clock period is constrained by the access times of level-1 caches, the clock frequency for all applications is effectively limited by the cache requirements of the most demanding phase within the most demanding application. This results in both performance and energy efficiency that represents the lowest common denominator across the applications. In this paper we present a Set and way Management cache Architecture for Run-Time reconfiguration (Smart cache), a cache architecture that allows reconfiguration in both its size and associativity. Results show the energy-delay of the Smart cache is on average 14% better than state-of-the-art cache reconfiguration architectures. We then leverage the flexibility provided by our cache to dynamically reconfigure the hierarchy as a program runs. We develop a decision tree based machine learning model to control the adaptation and automatically reconfigure the cache to the best configuration. Results show an average reduction in energy-delay product of 17% in the data cache (just 1% away from an oracle result) and 34% in the level-2 cache (just 5% away from an oracle), with an overall performance degradation of less than 2% compared with a baseline statically-configured cache.

Cited by 37Open access

Allocating SMART cache segments for schedulability

D.B. Kirk, J.K. Strosnider, J.E. Sasinowski · 2002

Since they were first introduced in the IBM 360/85 in 1969, cache designs have been optimized for average case performance, which has opened a wide gap between average case performance and the worst case performance that is critical to real-time computing community. The SMART (Strategic Memory Allocation for Real-Time) cache design narrows this gap. This paper focuses on an analytical approach to cache allocation. An overview of the SMART caching strategy is presented, as well as a dynamic programming algorithm which finds an allocation of cache segments to a set of periodic tasks that both minimizes the utilization of the task set and guaranteeing that the task set remains schedulable using rate monotonic scheduling. Results which show SMART caches narrowing the gap between average and worst case performance to less than 10% are then presented.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cited by 7

Hotel big data smart cache prototype

Yirui Wang · UPM Digital Archive (Technical University of Madrid) · 2019

With the increase of clients and hotel resources in Amadeus Hotel, it becomes a challenge for Amadeus Hotel to provide personalized hotel information for different clients and to optimize the Hotel searching process for both client and Amadeus sides. Nowadays, recommendation systems are playing a very important role in the domain of recommendation services, specifically online searching and shopping process. It could provide matches between users and items in order to provide attractive information which are matching their preferences. To overcome the challenge of Amadeus Hotel, a recommendation system will take steps to optimize the search result and provides hotels that the client actually needs for Amadeus Hotel. This paper proposes a recommendation solution to classify hotel profile and traveler profile and making the recommendation for Amadeus Hotel shopping processes. This solution could recommends personalized hotels for given users. The proposed approach combines customer reviews analysis, content based filtering and collaborative filtering with matrix factorization and classification techniques to improve the performance and it is benefitting from Amadeus large-scale data and hotel rating system. In this paper, it describes how a better hotel recommendation system have been designed and built, how this recommendation system have been integrated with several feature information and systems. The evaluation results shows how this recommendation system could improve the process of Amadeus hotel shopping and user experiences.

Cited by 0

S4D-Cache: Smart Selective SSD Cache for Parallel I/O Systems

Shuibing He, Xian‐He Sun, Bo Feng · 2014

Parallel file systems (PFS) are widely-used in modern computing systems to mask the ever-increasing performance gap between computing and data access. PFSs favor large requests, and do not work well for small requests, especially small random requests. Newer Solid State Drives (SSD) have excellent performance on small random data accesses, but also incur a high monetary cost. In this study, we propose a hybrid architecture named the Smart Selective SSD Cache (S4D-Cache), which employs a small set of SSD-based file servers as a selective cache of conventional HDD-based file servers. A novel scheme is introduced to identify performance-critical data, and conduct selective cache admission to fully utilize the hybrid architecture in terms of data-access parallelism and randomness. We have implemented an S4D-Cache under the MPI-IO and PVFS2 parallel file system. Our experiments show that S4D-Cache can significantly improve I/O throughput, and is a promising approach for parallel applications.

Cited by 37

User-oriented smart-cache for the Web

Zoé Lacroix, Arnaud Sahuguet, Raman Chandrasekar · 1998

Standard database approaches to querying information on the Web focus on the source(s) and provide a query language based on a given predefined organization (schema) of the data: this is the source-driven approach. However, can the Web be seen as a standard database? There is no super-user in charge of monitoring the source(s) (the data is constantly updated), there is no homogeneous structure (no common explicit structure thus), the Web itself never stops growing, etc. For these reasons, we believe that the source-driven standard approach is not suitable to the Web.

Cited by 8Open access

A Reinforcement Learning Based Smart Cache Strategy for Cache-Aided Ultra-Dense Network

Wei Li, Jun Wang, Guoyong Zhang et al. · IEEE Access · 2019

The integration of caching and ultra-dense network (UDN) can not only improve the efficiency of content retrieval by reducing duplicate content transmissions but also improve the network throughput and system energy efficiency (EE) of the UDN. In this paper, we focus on energy consumption aspects of cache-aided UDN (CUDN) and develop a novel caching strategy to improve the system EE. Different from the existing researches, we consider a more realistic scenario where the popularity of the cache content is dynamic and unknown. The proposed caching strategy is a deep reinforcement learning (DRL)-based approach that uses a deep Q-network to approximate the Q action-value function. We optimize the structure and corresponding parameters of the deep Q-network according to the latest findings in the field of DRL and deep learning (DL) to improve the performance of this caching strategy. The simulation results show that the performance in terms of EE of the CUDN can be significantly improved by using our proposed caching strategy.

Cited by 33Open access

Subject Guides: Money Smart: Geocache for College Cache

Cathy Cranston · 2016

Cited by 0

A Smart Cache Lockdown Technique for IoT System

Doosan Cho · Journal of Physics Conference Series · 2021

Abstract Applications used in IoT network devices are multimedia or control signal processing devices that process data streams. These devices are primarily designed as battery powered things. As battery operation time has become an important parameter, specialized optimization techniques are studied and applied to increase the battery operation time for IoT devices. In IoT device components, the memory is a representative one to consume large portion of energy. Thus, memory optimization techniques are being studied in IoT devices. In this study, a technique is proposed to optimize use of cache memory. With aggressive use of cache memory, it leads to reduce power consumption of the memory system. The cache memory consumes less power and is faster than the main memory, so its aggressive use helps IoT system’s power efficiency and performance. This study provides a technique to improve energy and performance by extracting frequently used data blocks and locking the data into cache to prevent eviction and increase cache’s hit ratio.

Cited by 0Open access

Contactless smart card as a cache for geocaching

Burda, Karel · Brno University of Technology Digital Library (Brno University of Technology) · 2020

V článku je posuzována možnost použít bezkontaktní mikropočítačovou kartu jako skrýš pro geokešing. Geokešing je rekreační venkovní aktivita, jejíž účastníci hledají na základě zeměpisných souřadnic skryté krabičky neboli skrýše. Nevýhodami stávajícího stavu je možnost účastníků podvádět a potřeba údržby skrýší. A pak zde ještě existuje problém, kdy nepoučená veřejnost při náhodném objevu skrýše ji interpretuje jako nástražné výbušné zařízení. V článku je navržen koncept možného řešení výše uvedených problémů a to cestou náhrady krabiček běžnými bezdrátovými mikropočítačovými kartami. Rovněž je zde navržena potřebná infrastruktura a i kryptografický protokol potřebný pro bezpečnou komunikaci mezi smartfonem účastníka a skrýší.

Cited by 0

Towards a Smart, Self-scaling Cooperative Web Cache

Petr Praus, Lubos ̌ Matl, Michael J. Donahoo · 2015

Abstract. The traditional client/server architecture for web service de-livery fails to naturally scale. This results in growing costs to the service provider for powerful hardware or extensive use of Content Distribution Networks. A P2P overlay network provides inherent scalability with mul-tiple benefits to both clients and servers. In this paper, we provide anal-ysis, design and prototype implementation of Cooperative Web Cache, which allows us to scale web service delivery and cope with demand spikes by employing clients in content replication. To demonstrate per-formance capabilities, we provide a prototype emulation for both client and server. 1

Cited by 0

Smart Technique for Cache-Assisted Device to Device Communications

Ahmed Hassan Abdel Salam, Hussein M. Elattar, Mohamed A. Aboul-Dahab · IEEE Access · 2020

The emergence of smart terminals with the consequence of higher network traffic growth rates, has increased the demand for new techniques that are needed to meet user requirements for high-quality communication and social media services. One of these techniques is Device-to-Device (D2D) communication, allowing direct data transmission of popular files between users. This is an advantage during rush hours where there is no access to the traffic via a base station (BS), thereby reducing network loads. In this article, we propose a new caching paradigm for D2D communication to achieve the goal of rising network offloading. A Smart Adaptive Algorithm (SAA) is proposed that smartly selects users with higher probabilities of sharing more data, then places popular files in their cache. This is done to optimize network offloading at minimal consumed energy by the user (user cost), taking into account the user speed, location, predicted zones, interests, and the size of the requested file. The data offloading ratio is taken as a performance metric in evaluating network offloading. It is defined as the proportion of requested data that can be delivered via D2D links. The offloading ratio is calculated in different scenarios in order to assess the influence of proactive caching on core network load. To minimize the complexity of the algorithm, and to respond in a shorter time period to the number of requests, user demand shall be handled with both the base station and the user's device application. For the simulation and implementation of the proposed algorithm, a human mobility model that predicts different human mobility behaviors is used. The simulation results reveal that the offloading ratio is significantly affected by the size of the file transmitted via D2D connection as well as the user speed. The amount of increase in the offloading ratio due to the increase in the user speed is based on the size of the files transmitted through D2D connection. The smaller files transmitted via D2D connection would result in a significant increase in the offloading ratio, whereas the larger file size would result in a less change in the offloading ratio for higher speed users. The simulation results also reveal that higher speed users share more data at a high bit rates compared to users with lower speeds. Simulation results also show that the proposed SAA has superior performance as compared to other algorithms available in literature.

Cited by 4Open access

Smart Cache Insertion and Promotion Policy for Content Delivery Networks

Peng Wang, Yu Liu, Zhelong Zhao et al. · 2023

Improving hit rates can be achieved by enhancing cache replacement algorithms with the identification of zero-reuse objects (ZROs) and inserting them at the end of the cache queue. Note that the promotion policy needs to achieve a similar task as the above insertion policy since the hit object may immediately become a ZRO (called P-ZRO) that is not suitable for placement at the front of the queue. However, existing studies have yet to consider P-ZROs, and current insertion algorithms struggle to simultaneously identify both ZROs and P-ZROs. To address these issues, we propose integrating the insertion and promotion policies. We do this by treating hit objects as special missing objects and employing reinforcement learning to create a unified model for both policies, where the learning function recognizes the relationship between performance changes and the emergence of ZROs and P-ZROs. Our proposed solution is a smart cache insertion and promotion policy (SCIP) that dynamically adjusts the insertion position using a bimodal insertion policy for both missing and hit objects, guided by the model. Extensive experiments demonstrate that SCIP significantly improves overall performance in real-world content delivery network systems and outperforms state-of-the-art insertion policies in terms of miss ratios in the simulator. In addition, deploying SCIP on optimal cache replacement algorithms can further decrease their miss ratios.

Cited by 1

Smart cache cleaning: Energy efficient vulnerability reduction in embedded processors

Jeyapaul, Shrivastava · 2011

Cited by 0

IATAC: a smart predictor to turn-off L2 cache lines

Jaume Abella, Antonio González, Xavier Vera et al. · ACM Transactions on Architecture and Code Optimization · 2005

As technology evolves, power dissipation increases and cooling systems become more complex and expensive. There are two main sources of power dissipation in a processor: dynamic power and leakage. Dynamic power has been the most significant factor, but leakage will become increasingly significant in future. It is predicted that leakage will shortly be the most significant cost as it grows at about a 5× rate per generation. Thus, reducing leakage is essential for future processor design. Since large caches occupy most of the area, they are one of the leakiest structures in the chip and hence, a main source of energy consumption for future processors.This paper introduces IATAC (inter-access time per access count), a new hardware technique to reduce cache leakage for L2 caches. IATAC dynamically adapts the cache size to the program requirements turning off cache lines whose content is not likely to be reused. Our evaluation shows that this approach outperforms all previous state-of-the-art techniques. IATAC turns off 65% of the cache lines across different L2 cache configurations with a very small performance degradation of around 2%.

Cited by 97Open access

Write activity reduction on flash main memory via smart victim cache

Liang Shi, Chun Jason Xue, Jingtong Hu et al. · 2010

Flash Memory is a desirable candidate for main memory replacement in embedded systems due to its low leakage power consumption, higher density and non-volatility characteristics. There are two challenges in applying flash memory as main memory. First, the write operations are much slower than read operations. Second, the lifetime of flash memory depends on the number of the write/erase operations. In this paper, we introduce a smart victim cache architecture to reduce the write activities by exploring the coarse grain accessing character of NAND flash memory. Experimental results show that the proposed approaches can reduce write activities on flash main memory by 65.38% on average compared to traditional architecture.

Cited by 49

Towards Smart Cache Management for Ontology Based, History-Aware Stream Reasoning.

Rui Yan, Brenda Praggastis, William P. Smith et al. · 2015

Cited by 0

A Smart Cache Content Update Policy Based on Deep Reinforcement Learning

Lincan Li, Chiew Foong Kwong, Qianyu Liu et al. · Wireless Communications and Mobile Computing · 2020

This paper proposes a DRL-based cache content update policy in the cache-enabled network to improve the cache hit ratio and reduce the average latency. In contrast to the existing policies, a more practical cache scenario is considered in this work, in which the content requests vary by both time and location. Considering the constraint of the limited cache capacity, the dynamic content update problem is modeled as a Markov decision process (MDP). Besides that, the deep Q-learning network (DQN) algorithm is utilised to solve the MDP problem. Specifically, the neural network is optimised to approximate the <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" id="M1"> <a:mi>Q</a:mi> </a:math> value where the training data are chosen from the experience replay memory. The DQN agent derives the optimal policy for the cache decision. Compared with the existing policies, the simulation results show that our proposed policy is 56%–64% improved in terms of the cache hit ratio and 56%–59% decreased in terms of the average latency.

Cited by 6Open access

A Computation Offloading Mechanism Based on Sharable Cache in Smart Community

Yixin Zhang, Yong Yan, Yang Yang et al. · 2021

In the smart community, many smart devices often offload computation tasks that use related data to edge servers. In this case, unnecessary data transmissions will occur, resulting in waste of energy resources and increased latency. Therefore, we consider adding a shareable cache to the edge server, allowing different computing tasks to share the original data file of computation task, and further reducing the energy consumption and latency. In this paper, we propose a computation offloading mechanism based on edge server shareable cache. We first propose a four-tier architecture. Subsequently, a resource constraint optimization model combining communication, computing, and caching is established. Then, we design a multi-factor-based edge server sharable cache management and update mechanism (MFBM), and propose a two-scenario computation offloading mechanism (TSCOM). Finally, simulation results show that the mechanism proposed in this paper is effective.

Cited by 0