| |
Records |
Links |
|
Author |
Cristina L. Abad; Yi Lu; Roy H. Campbell |
|
| |
Title |
DARE: Adaptive Data Replication for Efficient Cluster Scheduling |
Type |
Conference Article |
| |
Year |
2011 |
Publication |
IEEE International Conference on Cluster Computing, 2011 |
Abbreviated Journal |
|
|
| |
Volume |
|
Issue |
|
Pages |
159 - 168 |
|
| |
Keywords  |
MapReduce, replication, scheduling, locality |
|
| |
Abstract |
Placing data as close as possible to computation is a common practice of data intensive systems, commonly referred to as the data locality problem. By analyzing existing production systems, we confirm the benefit of data locality and find that data have different popularity and varying correlation of accesses. We propose DARE, a distributed adaptive data replication algorithm that aids the scheduler to achieve better data locality. DARE solves two problems, how many replicas to allocate for each file and where to place them, using probabilistic sampling and a competitive aging algorithm independently at each node. It takes advantage of existing remote data accesses in the system and incurs no extra network usage. Using two mixed workload traces from Facebook, we show that DARE improves data locality by more than 7 times with the FIFO scheduler in Hadoop and achieves more than 85% data locality for the FAIR scheduler with delay scheduling. Turnaround time and job slowdown are reduced by 19% and 25%, respectively. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
English |
Summary Language |
English |
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
|
Approved |
yes |
|
| |
Call Number |
cidis @ cidis @ |
Serial |
21 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Ortiz J.; Londono J.; Novillo F.; Ampuno A.; Chávez M. |
|
| |
Title |
Determinación de Invariantes en Grandes Centros de Datos basados en Topología Fat-Tree |
Type |
Journal Article |
| |
Year |
2015 |
Publication |
Revista Politécnica |
Abbreviated Journal |
|
|
| |
Volume |
Vol. 35 |
Issue |
|
Pages |
pp. 91-96 |
|
| |
Keywords |
Invariantes de red, topologías, Fat-tree, simulación, emulación |
|
| |
Abstract |
Durante los últimos años ha existido un fuerte incremento en el acceso a internet, causando que los centros de datos ( DC) deban adaptar dinámicamente su infraestructura de red de cara a enfrentar posibles problemas de congestión, la cual no siempre se da de forma oportuna. Ante esto, nuevas topologías de red se han propuesto en los últimos años, como una forma de brindar mejores condiciones para el manejo de tráfico interno, sin embargo es común que para el estudio de estas mejoras, se necesite recrear el comportamiento de un verdadero DC en modelos de simulación/emulación. Por lo tanto se vuelve esencial validar dichos modelos, de cara a obtener resultados coherentes con la realidad. Esta validación es posible por medio de la identificación de ciertas propiedades que se deducen a partir de las variables y los parámetros que describen la red, y que se mantienen en las topologías de los DC para diversos escenarios y/o configuraciones. Estas propiedades, conocidas como invariantes, son una expresión del funcionamiento de la red en ambientes reales, como por ejemplo la ruta más larga entre dos nodos o el número de enlaces mínimo que deben fallar antes de una pérdida de conectividad en alguno de los nodos de la red. En el presente trabajo se realiza la identificación, formulación y comprobación de dos invariantes para la topología Fat-Tree, utilizando como software emulador a mininet. Las conclusiones muestran resultados concordantes entre lo analítico y lo práctico. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
Escuela Politécnica Nacional |
Place of Publication |
|
Editor |
|
|
| |
Language |
Español |
Summary Language |
Español |
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
|
Approved |
no |
|
| |
Call Number |
cidis @ cidis @ |
Serial |
32 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
P. Ricaurte; C. Chilán; C. A. Aguilera-Carrasco; B. X. Vintimilla; Angel D. Sappa |
|
| |
Title |
Performance Evaluation of Feature Point Descriptors in the Infrared Domain |
Type |
Conference Article |
| |
Year |
2014 |
Publication |
Computer Vision Theory and Applications (VISAPP), 2014 International Conference on, Lisbon, Portugal, 2013 |
Abbreviated Journal |
|
|
| |
Volume |
1 |
Issue |
|
Pages |
545 -550 |
|
| |
Keywords |
Infrared Imaging, Feature Point Descriptors |
|
| |
Abstract |
This paper presents a comparative evaluation of classical feature point descriptors when they are used in the long-wave infrared spectral band. Robustness to changes in rotation, scaling, blur, and additive noise are evaluated using a state of the art framework. Statistical results using an outdoor image data set are presented together with a discussion about the differences with respect to the results obtained when images from the visible spectrum are considered. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
IEEE |
Place of Publication |
|
Editor |
|
|
| |
Language |
English |
Summary Language |
English |
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
2014 International Conference on Computer Vision Theory and Applications (VISAPP) |
|
| |
Notes |
|
Approved |
no |
|
| |
Call Number |
cidis @ cidis @ |
Serial |
26 |
|
| Permanent link to this record |
| |
|
| |
|
Author |
Miguel Oliveira; Vítor Santos; Angel D. Sappa; Paulo Dias; A. Paulo Moreira |
|
| |
Title |
Incremental Scenario Representations for Autonomous Driving using Geometric Polygonal Primitives |
Type |
Journal Article |
| |
Year |
2016 |
Publication |
Robotics and Autonomous Systems Journal |
Abbreviated Journal |
|
|
| |
Volume |
Vol. 83 |
Issue |
|
Pages |
pp. 312-325 |
|
| |
Keywords |
Incremental scene reconstructionPoint cloudsAutonomous vehiclesPolygonal primitives |
|
| |
Abstract |
When an autonomous vehicle is traveling through some scenario it receives a continuous stream of sensor data. This sensor data arrives in an asynchronous fashion and often contains overlapping or redundant information. Thus, it is not trivial how a representation of the environment observed by the vehicle can be created and updated over time. This paper presents a novel methodology to compute an incremental 3D representation of a scenario from 3D range measurements. We propose to use macro scale polygonal primitives to model the scenario. This means that the representation of the scene is given as a list of large scale polygons that describe the geometric structure of the environment. Furthermore, we propose mechanisms designed to update the geometric polygonal primitives over time whenever fresh sensor data is collected. Results show that the approach is capable of producing accurate descriptions of the scene, and that it is computationally very efficient when compared to other reconstruction techniques. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
English |
Summary Language |
English |
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
|
Approved |
no |
|
| |
Call Number |
cidis @ cidis @ |
Serial |
49 |
|
| Permanent link to this record |
