1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario registrado en Universia


Opción 1: Descargar recurso

Detalles del recurso

Descripción

The ever-growing amount of data requires highly scalable storage solutions. The most flexible approach is to use storage pools that can be expanded and scaled down by adding or removing storage devices. To make this approach usable, it is necessary to provide a solution to locate data items in such a dynamic environment. This paper presents and evaluates the Random Slicing strategy, which incorporates lessons learned from table-based, rule-based, and pseudo-randomized hashing strategies and is able to provide a simple and efficient strategy that scales up to handle exascale data. Random Slicing keeps a small table with information about previous storage system insert and remove operations, drastically reducing the required amount of randomness while delivering a perfect load distribution.

Pertenece a

UPCommons - E-prints UPC Universitat Politècnica de Catalunya   

Autor(es)

Miranda Bueno, Alberto -  Effert, S. -  Kang, Y. -  Miller, E.L. -  Brinkmann, A. -  Cortés Rosselló, Antonio - 

Id.: 55226406

Idioma: inglés  - 

Versión: 1.0

Estado: Final

Tipo:  10 p. - 

Palabras claveÀrees temàtiques de la UPC -  Informàtica -  Intel·ligència artificial -  Sistemes experts - 

Tipo de recurso: Conference report  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

: Open Access

Formatos:  10 p. - 

Requerimientos técnicos:  Browser: Any - 

Relación: [References] http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6152745

Fecha de contribución: 05-may-2013

Contacto:

Localización:
* Miranda, A. [et al.]. Reliable and randomized data distribution strategies for large scale storage systems. A: International Conference on High Performance Computing. "18th International Conference on High Performance Computing, HiPC 2011". 2011, p. 1-10.
* 978-145771951-6
* 10.1109/HiPC.2011.615274

Otros recursos del mismo autor(es)

  1. Smooth Imitation Learning for Online Sequence Prediction We study the problem of smooth imitation learning for online sequence prediction, where the goal is ...
  2. Characterization of transient noise in Advanced LIGO relevant to gravitational wave signal GW150914 On 14 September 2015, a gravitational wave signal from a coalescing black hole binary system was obs...
  3. Intravoxel incoherent motion diffusion-weighted imaging for monitoring chemotherapeutic efficacy in gastric cancer AIM: To assess intravoxel incoherent motion diffusion-weighted imaging (IVIM-DWI) for monitoring ear...
  4. Degradation of pMOSFETs due to hot electron induced punchthrough Abstract This paper proposes a method which can separate the parasitic effect from the drain current...
  5. High-pressure processing of milk alleviates atopic dermatitis in DNCB-induced Balb/c mice International audience

Otros recursos de la misma colección

  1. A local constitutive model for the discrete element method: application to geomaterials and concrete This paper presents a local constitutive model for modelling the linear and non linear behavior of s...
  2. Increasing yield of nanocrystalline cellulose preparation process by a cellulase pretreatment In this work the introduction of a cellulase treatment prior to NCC isolation was assessed. NCC was ...
  3. FUTUR. Portal for the scientific output of researchers at the Universitat Politècnica de Catalunya Postprint (author’s final draft)
  4. Les llàgrimes de Santa Eulàlia Award-winning
  5. A meshless finite point method for three dimensional analysis of compressible flow problems involving moving boundaries and adaptivity A finite point method for solving compressible flow problems involving moving boundaries and adaptiv...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.