ResIn: A Combination of Result Caching and Index Pruning for High-performance Web Search Engines

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (28)

Large-Scale Graph Processing on FPGAs with Caches for Thousands of Simultaneous Misses

Paolo Ienne, Mikhail Asiatici

Efficient large-scale graph processing is crucial to many disciplines. Yet, while graph algorithms naturally expose massive parallelism opportunities, their performance is limited by the memory system because of irregular memory accesses. State-of-the-art ...

IEEE COMPUTER SOC2021

Rethinking Software Runtimes for Disaggregated Memory

Ivan Puddu, Sanidhya Kashyap

Disaggregated memory can address resource provisioning inefficiencies in current datacenters. Multiple software runtimes for disaggregated memory have been proposed in an attempt to make disaggregated memory practical. These systems rely on the virtual mem ...

ASSOC COMPUTING MACHINERY2021

Impact of a companion and of chromospheric emission on the shape of chromosome maps for globular clusters

Carmela Lardo

Context. Globular clusters (GCs) host multiple populations of stars that are well-separated in a photometric diagram - the chromosome map - built from specific Hubble Space Telescope (HST) filters. Stars from different populations feature at various locati ...

EDP SCIENCES S A2020

A Hybrid Cache HW/SW Stack for Optimizing Neural Network Runtime, Power and Endurance

David Atienza Alonso, William Andrew Simon, Marina Zapater Sancho, Alexandre Sébastien Julien Levisse

Hybrid caches consisting of both SRAM and emerging Non-Volatile Random Access Memory (eNVRAM) bitcells increase cache capacity and reduce power consumption by taking advantage of eNVRAM's small area footprint and low leakage energy. However, they also inhe ...

2020

Successive Refinement to Caching for Dynamic Content

Michael Christoph Gastpar, Pinar Sen

To reduce the network load during peak hours, servers deliver partial data to users during the off-peak time of the network before the actual requests are known, which is known as caching. This paper studies a single user caching problem in which the file ...

IEEE2019

Relaxed Wyner's Common Information

Michael Christoph Gastpar, Erixhen Sula

In the problem of coded caching for media delivery, two separate coding opportunities have been identified. The first opportunity is a multi-user advantage and crucially hinges on a public broadcast link in the delivery phase. This has been explored in a p ...

IEEE2019

An Improved Analysis of Local Search for Max-Sum Diversification

Rico Zenklusen, Friedrich Eisenbrand, Alfonso Bolívar Cevallos Manzano

We present new techniques to analyze natural local search algorithms for several variants of the max-sum diversification problem which, in its most basic form, is as follows: given an n-point set X subset of R-d and an integer k, select k points in X so th ...

INFORMS2019

Tracing the formation of the Milky Way through ultra metal-poor stars

Pascale Jablonka, Nicolas Lawrence Etienne Longeard

We use Gaia DR2 astrometric and photometric data, published radial velocities and MESA models to infer distances, orbits, surface gravities, and effective temperatures for all ultra metal-poor stars ([Fe/H] < -4.0 dex) available in the literature. Assuming ...

OXFORD UNIV PRESS2019

Page 2 sur 2