Detalles del recurso
Pertenece a:
UPCommons - E-prints UPC Universitat Politècnica de Catalunya
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.
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
