Actas de las

XX Jornadas de Paralelismo

A Coruña, 16,17 y 18 de septiembre de 2009

Organiza:
Grupo de Arquitectura de Computadores
Universidade da Coruña
EDITORES:

Ramón Doallo Biempica

Manuel Arenaz Silva
Patricia González Gómez

ACTAS DE LAS XX JORNADAS DE PARALELISMO

Reservados todos los derechos. Ni la totalidad ni parte de esta publicación puede

reproducirse o transmitirse por ningún procedimiento electrónico o mecánico,
incluyendo fotocopia, grabación magnética o cualquier almacenamiento de
información y sistema de recuperación, sin el permiso previo y por escrito de las
personas titulares del copyright.

Derechos reservados !2009 respecto a la primera edición en español por los

autores.
Derechos reservados !2009 Servizo de Publicacións, Universidade da Coruña.

ISBN: 84-9749-346-8

Depósito legal: C 2318-2009

Edita: Servizo de Publicacións, Universidade da Coruña

http://www.udc.es/publicaciones c/e: publica@udc.es

Imprime: Macrom. Tel. 981 135 577

http://www.macrom.es c/e: macrom@macrom.es
XX JORNADAS DE PARALELISMO

Comité de coordinación

Ramón Beivide Palacio (UC)

Jesús Carretero Pérez (UCIII)
José Duato Marín (UPV)
Inmaculada García Fernández (UAL)
Antonio Garrido del Solo (UCLM)
Emilio López Zapata (UMA)
Emilio Luque Fadón (UAB)
Pedro de Miguel Anasagasti (UPM)
Alberto Prieto Espinosa (UGR)
Francisco José Quiles Flor (UCLM)
Ana Ripoll Aracil (UAB)
Francisco Tirado Fernández (UCM)
Mateo Valero Cortés (UPC)
Victor Viñals Yúfera (UZ)

Comité Organizador (UDC)

Ramón Doallo Biempica

Patricia González Gómez
Manuel Arenaz Silva
Margarita Amor López
Diego Andrade Canosa
Iván Díaz Álvarez
Basilio B. Fraguela Rodríguez
Gonzalo Iglesias Aguiño
Guillermo López Taboada
María J. Martín Santamaría
Emilio Padrón González
Xoán C. Pardo Martínez
Gabriel Rodríguez Álvarez
José R. Sanjurjo Amado
Juan Touriño Domínguez
Entidades Patrocinadoras

Vicerreitorado de Investigación. Universidade da Coruña

Ministerio de Ciencia e Innovación. Gobierno de España
Consellería de Educación e Ordenación Universitaria. Xunta de Galicia
Concello da Coruña
Red Gallega de Computación de Altas Prestaciones
Red Mathematica Consulting & Computing de Galicia
HP España
Bull España

Entidades Colaboradoras

Facultade de Informática. Universidade da Coruña

Oficina de Cursos e Congresos. Universidade da Coruña
Turismo Coruña
Turgalicia

Entidades Organizadoras

Grupo de Arquitectura de Computadores. Universidade da Coruña

Sociedad de Arquitectura y Tecnología de Computadores (SARTECO)
 Presentación

Quisiéramos aprovechar estas lı́neas para daros la bienvenida a las XX Jornadas

de Paralelismo, que tienen lugar en A Coruña entre los dı́as 16 y 18 de septiembre de
2009. La celebración de este evento supone una vez más, y ya van veinte, el encuentro
de numerosos investigadores para intercambiar experiencias y presentar ponencias que
reflejan su trabajo en el ámbito de la arquitectura de sistemas de computadores.

El número de asistentes a las Jornadas de Paralelismo ha ido creciendo con cada nue-
va edición. En este año se han recibido 119 artı́culos, y el número de participantes con el
que contamos asciende a más de 170. Finalmente el programa ha quedado estructurado
en más de 20 horas de trabajo, repartidas en 24 sesiones que cubren los temas siguien-
tes: tecnologı́as grid y plataformas distribuidas; aplicaciones; redes y comunicaciones;
arquitecturas, algoritmos y aplicaciones sobre aceleradores hardware; arquitecturas de
procesador, multiprocesadores y chips multinúcleo; algoritmos y técnicas de programa-
ción paralelas; compilación para sistemas de altas prestaciones; docencia en Arquitectura
y Tecnologı́a de Computadores (ATC); y evaluación de prestaciones.

Contamos en esta edición con dos conferencias plenarias, impartidas por los profe-
sores Mark Baker, de la Universidad de Reading (Reino Unido), sobre Cloud Computing
y sus servicios, y Enrique Quintana-Ortı́, de la Universitat Jaume I, sobre técnicas su-
perescalares en la construcción de bibliotecas numéricas para procesadores multinúcleo
y GPUs. Además tendremos la oportunidad de asistir a dos sesiones técnicas imparti-
das por HP España y Bull España, y a la asamblea de la Sociedad de Arquitectura y
Tecnologı́a de Computadores (SARTECO).

El programa de las Jornadas incluye también dos mesas redondas sobre asuntos que
actualmente están provocando un intenso debate entre la comunidad universitaria. La
primera de ellas trata sobre cómo trasladar las fichas del Grado y Master en Informáti-
ca a los nuevos planes de estudio. La segunda mesa redonda abordará el tema de la
transferencia de conocimiento universidad-empresa.

No queremos acabar esta presentación sin mostrar nuestro agradecimiento a todos

los organismos y entidades, públicos y privados, que han colaborado en el desarrollo de
estas Jornadas, en concreto, a la Universidade da Coruña, al Concello de A Coruña, a
la Xunta de Galicia, al Ministerio de Ciencia e Innovación, a la Red Gallega de Compu-
tación de Altas Prestaciones, a la Red Mathematica Consulting & Computing de Galicia,
a las compañı́as HP y Bull, y finalmente a todos los miembros del Grupo de Arquitectura
de Computadores de la UDC que han brindado su apoyo para la organización de este
congreso.

Finalmente, queremos agradecer vuestro interés y participación en estas XX Jorna-

das de Paralelismo, que esperamos cumplan con vuestras expectativas.

Comité Organizador de las

XX Jornadas de Paralelismo
A Coruña, 16-18 de Septiembre de 2009
 Índice

Algoritmos y técnicas de programación paralelas

Una Biblioteca Numérica Paralela para UPC

J. González-Domı́nguez, M.J. Martı́n, G.L. Taboada, J. Touriño, R. Doallo
y A. Gómez . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
Concurrencia-paralelismo Auto-gestionada por Procesos Multihebrados en
Sistemas Multicore
J.F. Sanjuan-Estrada, L.G. Casado, J.A. Martı́nez, M. Soler e I. Garcı́a . . . . . 7
Modelado y Autooptimización en Esquemas Paralelos de Backtracking
M. Quesada y D. Giménez . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
Algunas Consideraciones sobre las Estructuras Árbol en OpenMP
C. León, G.M. Valladares y J.M. Rodrı́guez . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
Parallelization of the Quadratic Assignment Problem on the Cell
J.A. Pascual, J.A. Lozano y J.M. Alonso . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
Precondicionadores Paralelos para Sistemas Suavemente no Lineales
H. Migallón, V. Migallón y J. Penadés . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
Modelado Paralelo de Circuitos Integrados Desarrollados con SystemC para
una Red de Datos PLC
V. Galiano, M. Martı́nez, H. Migallón y D. Pérez-Caparrós . . . . . . . . . . . . . . . . . . 39
Métodos Paralelos para Decodificación de Señales en Sistemas Inalámbricos
MIMO
R.A. Trujillo, A.M. Vidal y V.M. Garcı́a . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
Evaluación de Propuestas Master-slave para la Reconstrucción 3D en To-
mografı́a Electrónica
M.L. da Silva, J. Roca-Piera y J.J. Fernández . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51
Hiperheurı́sticas Paralelas Multi-objetivo. Aplicación a las Funciones R
C. León, G. Miranda, F.J. Morales y C. Segura . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57
Paralelización de Magpack: Propiedades Magnéticas de Sistemas Anisótro-
pos de Alta Nuclearidad
E. Ramos, J.E. Román, S. Cardona, J.M. Clemente-Juan y E. Coronado . . . . 63

Aplicaciones

Resolución del Problema Reporting Cells mediante Computación Clúster y

un Equipo Paralelo de Algoritmos Evolutivos
D.L. González-Álvarez, A. Rubio-Largo, M.A. Vega-Rodrı́guez, S. Almeida-
Luz, J.A. Gómez-Pulido y J.M. Sánchez-Pérez . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69

ix
Ultra-fast Tomographic Reconstruction with a Highly Optimized Back-
projection Algorithm
J.I. Agulleiro, E.M. Garzón, I. Garcı́a y J.J. Fernández . . . . . . . . . . . . . . . . . . . . . . 75
Alternativas de Optimización Multiobjetivo Paralela en la Predicción de
Estructuras de Proteı́nas
J.C. Calvo, J. Ortega y M. Anguita . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
Aplicación de Estadı́sticos para el Análisis y el Estudio de la Estimación y
Compensación de Movimiento en MPEG-2
A.J. Dı́az-Honrubia, G. Fernández-Escribano y P. Cuenca . . . . . . . . . . . . . . . . . . . 87
La Necesidad de Mejoras en Predicción y Computación para el Modelo
MM5
H. Ihshaish, A. Sairouni, A. Cortés y M.A. Senar . . . . . . . . . . . . . . . . . . . . . . . . . . . 93
Entorno de Desarrollo de Heurı́sticas Distribuidas Utilizando OSGi
P. Garcı́a-Sánchez, P.A. Castillo, J. González, J.J. Merelo y A.A. Escámez . . . . 99
Enhanced Non-embedded Lower Tree Wavelet Encoder
O. López, M. Martı́nez-Rach, P. Piñol, M.P. Malumbres y J. Oliver . . . . . . . . . 105
Resolución del Problema del Lı́der-seguidor mediante Algoritmos Paralelos
J.L. Redondo, A.G. Arrondo, I. Garcı́a y P.M. Ortigosa . . . . . . . . . . . . . . . . . . . . . 111
A Partitioning Method Based on Convex Hulls for Crowd Simulations
G. Vigueras, M. Lozano, J. M. Orduña y F. Grimaldo . . . . . . . . . . . . . . . . . . . . . . . 117
PySParNLCG: Interfaz-librerı́a del Método del Gradiente Conjugado no
Lineal Paralelo para Sistemas Dispersos
H. Migallón, V. Migallón y J. Penadés . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 123
Using Evolutionary Intelligent Systems to Enhance Forest Fire Spread Pre-
diction
K. Wendt, A. Cortés y T. Margalef . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129
Resolución del Problema de la Planificación de Frecuencias en Redes GSM
Utilizando GRASP y Computación Grid
J.M. Chaves-González, R. Hernando-Carnicero, M.A. Vega-Rodrı́guez, J.A.
Gómez-Pulido y J.M. Sánchez-Pérez . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 135
MapReduce Implementation of High Resolution Irradiation Model
S. Tabik, L.F. Romero, O. Plata y G. Bandera . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141
Solving Half Billion Unknowns with High Scalability Multipole Method
J.C. Mouriño, A. Gómez, J.M. Taboada, L. Landesa, F. Obelleiro y J.L.
Rodrı́guez . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 147

Arquitecturas de procesador, multiprocesadores y chips multinúcleo

Soporte Multicast y Broadcast para una Red Detallada de Interconexión en

GEMS
J. Camacho y J. Flich . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153

x
Mejorando el Rendimiento SMT: Algoritmo Genético para la Configuración
de Cachés Reconfigurables
J. Dı́az, J.I. Hidalgo, F. Fernández, O. Garnica y S. López . . . . . . . . . . . . . . . . . . 159
A Cache Filtering Mechanism for Hardware Transactional Memory Sys-
tems Decoupled from Caches
L. Orosa, J.D. Bruguera y E. Antelo . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 165
Implementación de un Predictor de Último Uso con Decaimiento
J. Alastruey, T. Monreal, V. Viñals y M. Valero . . . . . . . . . . . . . . . . . . . . . . . . . . . . 171
A Novel Transactional Book-keeping Scheme for Tiled CMPs
R. Titos-Gil, M.E. Acacio y J.M. Garcı́a . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 177
On the Feasibility of Fat-tree Topologies for Network-on-chip
F. Gilabert, D. Ludovici, S. Medardoni, C. Gómez, M.E. Gómez, P. López,
G.N. Gaydadjiev y D. Bertozzi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 183
A Workload-Aware ROB Sharing Strategy for Multithreaded Processors
R. Ubal, J. Sahuquillo, S. Petit y P. López . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 189
Energy-Efficient Power Budget Matching
J.M. Cebrián , J.L. Aragón, J.M. Garcı́a, P. Petoumenos y S. Kaxiras . . . . . . . 195
Limiting the Storage Requirements for Preventing Starvation in Token
Coherence
B. Cuesta, A. Robles y J. Duato . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201
An Efficient Memory Disambiguation Hardware in an x86 Architecture
R. Apolloni, D. Chaver, F. Castro, L. Piñuel, M. Prieto y F. Tirado . . . . . . . . . 207
RUFT: Reduced Unidirectional Fat–tree
C. Gómez, F. Gilabert, M.E. Gómez, P. López, y J. Duato . . . . . . . . . . . . . . . . . . 213
Achieving Directory Scalability and Lessening Network Traffic in Many-
core CMPs
A. Ros, M.E. Acacio y J.M. Garcı́a . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 219
Phit Reduction Techniques to Deal with Process Variability in NoC Links
C. Hernández, F. Silla, V. Santonja y J. Duato . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 225
Logic Tree-Based Broadcast Support for CMPs
S. Rodrigo, J. Flich y J. Duato . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 231
Needs of CQoS for Future, Many-core CMPs to Support Server Consolida-
tion and Cloud Computing
J. Merino, L.G. Menezo y V. Puente . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 237
Performance Analysis of Non-Uniform Cache Architecture Policies for
Chip-Multiprocessors Using the Parsec v2.0 Benchmark Suite
J. Lira, C. Molina y A. González . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 241
Diseño de Signaturas Explotando Localidad en Memoria Transaccional
R. Quislant, E. Gutiérrez, O. Plata y E.L. Zapata . . . . . . . . . . . . . . . . . . . . . . . . . . . 247

xi
Arquitecturas del subsistema de memoria y almacenamiento secundario

Caché con Reequilibrio de Conjuntos

D. Rolán, B.B. Fraguela y R. Doallo . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 253
Ahorro Energético en un Sistema de Almacenamiento Hı́brido Compuesto
por un Disco Duro y Varias Memorias Flash
L. Prada, J.D. Garcı́a, J. Carretero y F. Garcia . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 259
Memoria Dinámica en Caches de Datos de Primer Nivel sin Necesidad de
Refresco
A. Valero, V. Lorente, J. Sahuquillo, S. Petit, P. López y J. Duato. . . . . . . . . . . 265
Nanotubos de Carbono para Conexiones en Cachés: Arquitecturas más
allá del CMOS
J. Ortiz, D. Suárez, V. Viñals y M. Villarroya-Gaudó . . . . . . . . . . . . . . . . . . . . . . . 271

Arquitecturas, algoritmos y aplicaciones sobre aceleradores hardware

Implementation and Evaluation of Collective Primitives for Dual Cell-based

Blades
E. Gaona, J.F. Peinador y M.E. Acacio . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 277
Highly Parallel Image Processing on a Massively Parallel Processor Array
R.R. Osorio, C. Dı́az-Resco y J.D. Bruguera . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 283
Analysis of P Systems Simulation on CUDA
G.D. Guerrero, J.M. Cecilia, J.M. Garcı́a, M.A. Martı́nez-del-Amor, I.
Pérez-Hurtado y M.J. Pérez-Jiménez . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289
Metodologı́a para la Generación y Evaluación Automática de Hardware Es-
pecı́fico
C. González, D. Jiménez-González, X. Martorell, C. Álvarez y G.N. Gay-
dadjiev . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 295
Implementación en FPGA de la Transformada Generalizada de Hough
S.R. Geninatti, J.I. Benavides, M. Hernández, N. Guil y J. Gómez . . . . . . . . . . 301
Análisis de la Capacidad Stream Management de CUDA para Procesamien-
to de Vı́deo
J. Gómez-Luna, J.M. González-Linares, J.I. Benavides y N. Guil . . . . . . . . . . . . 307
Acelerando el Producto Matriz Dispersa Vector en GPUs
F. Vázquez, E.M. Garzón, J.A. Martı́nez y J.J. Fernández . . . . . . . . . . . . . . . . . . 313
Implementación de una Memoria Caché Reconfigurable, sobre FPGA’s, en
VHDL y HANDEL C
A.D. Santana, L. D. Tapia, E. Herruzo, J.I. Benavides . . . . . . . . . . . . . . . . . . . . . . 319
Using Hybrid CPU-GPU Platforms to Accelerate the Computation of the
Matrix Sign Function
A. Remón y E.S. Quintana-Ortı́ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 323
Simulación de Aguas Poco Profundas en una GPU mediante Brook+
J. Lobeiras, M. Amor, M. Arenaz, B.B. Fraguela, J.A. Garcı́a y M.J. Castro . . . . 327

xii
Programación de Alto Rendimiento en el Procesador Cell: Aplicación a
Simulación de Fluı́dos
C.H. González, B.B. Fraguela, D. Andrade, J.A. Garcı́a y M.J. Castro . . . . . . 333
Paralelización de la Estimación de Movimiento para Tamaño de Bloque
Variable Utilizando Aritmética OLA
J. Olivares . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 339
Evaluation of the Cell Broadband Engine Running Continuous Estimation
of Distribution Algorithms
C. Pérez-Miguel, J. Miguel-Alonso y A. Mendiburu . . . . . . . . . . . . . . . . . . . . . . . . . 343
Proyección de Algoritmos de Resolución de Sistemas Tridiagonales en la
Tarjeta Gráfica
J. Lamas-Rodrı́guez, M. Bóo, D.B. Heras y F. Argüello . . . . . . . . . . . . . . . . . . . . . 349

Compilación para sistemas de altas prestaciones

Paralelización Especulativa de la Triangulación de Delaunay

A. Garcı́a-Yágüez, D.R. Llanos, D. Orden y B. Palop . . . . . . . . . . . . . . . . . . . . . . . 355
Generación Automática de Código Hı́brido (MPI+OpenMP) con llc
R. Reyes, A.J. Dorta, F. Almeida y F. de Sande . . . . . . . . . . . . . . . . . . . . . . . . . . . . 361

Computación de altas prestaciones sobre arquitecturas paralelas heterogéneas

Análisis de prestaciones de clusters de FPGA frente a clusters de compu-

tadores en aplicaciones de computación evolutiva
J.A. Gómez-Pulido , M.A. Vega-Rodrı́guez y J.M. Sánchez-Pérez . . . . . . . . . . . . 367
BP-TCoffee: A Balanced Guide Tree Heuristic for improving Parallel T-
Coffee Performance
M. Orobitg, F. Guirado, A. Montañola y F. Cores . . . . . . . . . . . . . . . . . . . . . . . . . . 373
Planificación en Multicore Asimétricos con Repertorio Común de Instruc-
ciones
J.C. Sáez, H. Vegas, M. Prieto y A. Fedorova . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 379
ADITHE: An Approach to Optimise Iterative Computation on Heteroge-
neous Multiprocessors
G. Ortega, J. A. Martı́nez, E.M. Garzón, A. Plaza e I. Garcı́a . . . . . . . . . . . . . . . 385

Docencia en ATC

Entorno Virtual de Aprendizaje y Autoevaluación de Lógica Proposicional

y Combinacional
F. Guirado, C. Ansótegui, F. Cores, J.L. Lérida, C. Roig, F. Giné y F.
Solsona . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 391

xiii
Montaje de un Laboratorio de Desarrollo de Software Empotrado Usando
sólo Herramientas Open Source
J. González, J.M. Palomares y P. Garcı́a-Sánchez . . . . . . . . . . . . . . . . . . . . . . . . . . . 397
Forge: A Multi-purpose Platform for Measuring Energy and Temperature
in Commodity PCs
S. Gutiérrez, O. Benedı́, D. Suárez, J.M. Marı́n y V. Viñals . . . . . . . . . . . . . . . . . 403
Un módulo para la Gestión de Prácticas de Tecnologı́a de Computadores
en Moodle
J. Ramos, S. Romero, M.A. Trenas, F. Corbera y E. Gutiérrez . . . . . . . . . . . . . . 409

Evaluación de prestaciones

Thread Allocation Issues for Irregular Codes in the Finisterrae System

J.A. Lorenzo, F.F. Rivera, D.B. Heras, J.C. Cabaleiro, T.F. Pena, J.C.
Pichel y D.E. Singh . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 415
Simulating Server Consolidation
A. Garcı́a-Guirado, R. Fernández-Pascual y J.M. Garcı́a . . . . . . . . . . . . . . . . . . . . 421
Administración Eficiente de Recursos de Cómputo Paralelo en un Entorno
Heterogéneo
R. Muresano, D. Rexachs y E. Luque . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 427
Ubuntu Server de 32 bits v.s. 64 bits
A. Tenorio y L. Tomás . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 433
El Criterio de Información de Akaike en la Obtención de Modelos Estadı́sti-
cos de Rendimiento
D.R. Martı́nez, J.L. Albı́n, J.C. Cabaleiro, T.F. Pena, F.F. Rivera y V.
Blanco . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 439

Redes y comunicaciones

Futuros Avances en la Transcodificación de Vı́deo DVC

A. Corrales-Garcia , J.L. Martı́nez y F.J. Quiles . . . . . . . . . . . . . . . . . . . . . . . . . . . . 445
SEM: An Improved Congestion Management Mechanism for MINs
J.L. Ferrer, E. Baydal, A. Robles, P. López y J. Duato . . . . . . . . . . . . . . . . . . . . . . 451
MRR: Multicast Rotary Router
J. Abad, V. Puente y J.A. Gregorio . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 457
Automating the Modeling and Simulation Life Cycle of Mobile Ad hoc Net-
works
P.P. Garrido, M.P. Malumbres, J. Llor, E. Torres y C.T. Calafate . . . . . . . . . . . 463
Planificación de una Red Sensorial para la Monitorización de Viñedos
M.L. Santamarı́a y S. Galmés . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 469

xiv
Análisis de Opciones de Externalización de Interfaces de Red con Modelos
HDL
W.M. Haider, J. Ortega, A.F. Dı́az y A. Ortiz . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 475
Sistema Integrado de Simulación de NoCs.
F. Triviño, F. J. Andújar, A. Ros, J.L. Sánchez y F.J. Alfaro . . . . . . . . . . . . . . . . 481
Multipath Fault-Tolerant Routing Policies for High-Speed Interconnection
Networks
G. Zarza, D. Lugones, D. Franco y E. Luque . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 487
Interconexión de Sistemas Basados en HyperTransport
J.A. Villar, F.J. Alfaro, J.L. Sánchez, J. Duato . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 493
Reducing User-Perceived Latencies and Web Server Load by Prevalidating
Web Objects
J. Domènech, J.A. Gil, J. Sahuquillo y A. Pont . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 499
FBICM: Control de Congestión Eficiente y Escalable en Redes de Interco-
nexión con Encaminamiento Distribuido Determinista
J. Escudero-Sahuquillo, P.J. Garcı́a, F.J. Quiles, J. Flich y J. Duato . . . . . . . . . 505
Biblioteca de Primitivas Colectivas en Paso de Mensajes para Java en Sis-
temas Multi-core
S. Ramos, G.L. Taboada, J. Touriño y R. Doallo . . . . . . . . . . . . . . . . . . . . . . . . . . . . 511
Biblioteca de Operaciones Colectivas para el Lenguaje de Programación Pa-
ralela UPC
J. Andión, G.L. Taboada, J. Touriño y R. Doallo . . . . . . . . . . . . . . . . . . . . . . . . . . . 517
Evaluation of Traffic Exposure in Anonymous Routing Protocols for MA-
NETs
M. Nácher, C.T. Calafate, J.C. Cano y P. Manzoni . . . . . . . . . . . . . . . . . . . . . . . . . . 523
Cross-Layer Evaluation of a VANET-based Content Delivery Framework
J. Márquez, C.T. Calafate, J.C. Cano y P. Manzoni . . . . . . . . . . . . . . . . . . . . . . . . . 529
The Watchdog: a Black-hole Intrusion Tolerance Implementation for Ad-
hoc Networks
J. Hortelano, J.C. Ruiz y P. Manzoni . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 535
Evaluating Warning Dissemination in VANETs
F.J. Martı́nez, J.C. Cano, C.T. Calafate y P. Manzoni . . . . . . . . . . . . . . . . . . . . . . 541
A Multi-objective Genetic Approach for Concurrent Mapping and Routing
in Networks-on-Chip
R. Tornero, V. Sterrantino, M. Palesi y J.M. Orduña . . . . . . . . . . . . . . . . . . . . . . . . 547
Hardware Study of the SCFQ-CA and DRR-CA Egress Link Schedulers
J.M. Claver, R. Martı́nez, F.J. Alfaro y J.L. Sánchez . . . . . . . . . . . . . . . . . . . . . . . . 553
Experimenting with the IEEE 802.11e Technology in a Real Testbed
A. Torres, C.T. Calafate, J.C. Cano y P. Manzoni . . . . . . . . . . . . . . . . . . . . . . . . . . . 559
Analyzing the Behavior of Acoustic Link Models in Underwater Wireless
Sensor Networks
J. Llor, E. Torres, P. Garrido y M.P. Malumbres . . . . . . . . . . . . . . . . . . . . . . . . . . . . 565

xv
Thin trees: Cost-Effective Tree-like Networks
J. Navaridas, J. Miguel-Alonso y W. Denzel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 571
Evaluación en Servidores Web de una Interfaz de Red Distribuida
A. Ortiz, J. Ortega, A.F. Dı́az y A. Prieto . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 577
Esquemas Dinámicos de Distribución de Claves en Redes Peer-to-peer Mul-
timedia
J.A.M. Naranjo, J.A. López-Ramos y L.G Casado . . . . . . . . . . . . . . . . . . . . . . . . . . . 583
Upper Bound of Web Page Latency Saving in an Experimental Prefetching
System
B. de la Ossa, J. Sahuquillo, A. Pont y J.Gil . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 587

Tecnologı́as grid y plataformas distribuidas

Evaluación de Prestaciones de Meta-Planificadores de Grid Conscientes de

la Red
A. Caminero, O. Rana, B. Caminero y C. Carrión . . . . . . . . . . . . . . . . . . . . . . . . . . . 593
GloBeM: Un Modelo Global del Grid
J. Montes, A. Sánchez y M.S. Pérez . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 599
Adaptive Task Scheduling for Multi-job MapReduce Environments
J. Polo, D. de Nadal, D. Carrera, Y. Becerra, V. Beltrán, J. Torres y E.
Ayguadé . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 605
Web Services Based Scheduling in OpenCF
A. Santos, F. Almeida, V. Blanco y J.C. Castillo . . . . . . . . . . . . . . . . . . . . . . . . . . . . 611
Un Sistema Eficiente para Recuperación de Vı́deo en Entornos Grid
P. Toharia, A. Sánchez, O.D. Robles y J.L. Bosque . . . . . . . . . . . . . . . . . . . . . . . . . . 617
The Impact of Fault Tolerance Configuration on Different Applications
L. Fialho, G. Santos, A. Duarte, D. Rechaxs y E. Luque . . . . . . . . . . . . . . . . . . . . 623
Arquitectura de E/S Paralela de Alta Prestaciones para Sistemas Blue Ge-
ne
J.G. Blas, F. Isaila y J. Carretero . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 629
Accelerating Computing through Virtualized Remote GPUs
J. Duato, A.J. Peña, F. Silla, F.D. Igual, R. Mayo y E.S. Quintana-Ortı́ . . . . . 635
Addressing the Use of Cloud Computing for Web Hosting Providers
J. Oriol-Fitó y J. Guitart . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 641
Adaptación de un Simulador de Nanodispositivos para la Infraestructura
Grid del FORMIGA
R. Valı́n, A. Garcı́a-Loureiro, C. Fernández, D. Cordero, C. Fernández y J.
López . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 647
Towards High-Level SLAs with Heterogeneous Workloads: Job Resource Re-
quirements Prediction for Deadline Schedulers
G. Reig, J. Alonso y J. Guitart . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 653

xvi
Replicación de Datos en PVFS2 para Conseguir Tolerancia a Fallos
E. Nieto-Tovar, R. Hernández-Palacios, H.E. Camacho-Cruz, A.F. Dı́az-
Garcı́a, M. Anguita-López y J. Ortega-Lopera . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 659
Implementación Grid de Algoritmo Scatter Search. Aplicación a la Opti-
mización de Dispositivos de Fusión Nuclear
A. Gómez-Iglesias, M.A. Vega-Rodrı́guez, F. Castejón, J.M. Sánchez-Pérez,
M. Cárdenas-Montes y E. Morales-Ramos . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 665
Elastic Management of Tasks in Virtualized Environments
I. Goiri, J. Guitart y J. Torres . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 671
Planificación Avanzada en GridWay
L.T. Bolı́var, C. Carrión y M.B. Caminero . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 677
Expanding a Node Memory Beyond the Node Limits
H. Montaner, F. Silla y J. Duato . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 683
Modelo de Asignación de Tareas en Entornos Multicluster Heterogéneos y
no Dedicados
H. Blanco, J.L. Lérida, F. Guirado y A.I. Usié . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 689
A Non-Additive Negotiation Model for Utility Computing Markets
M. Macı́as y J. Guitart . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 695
Mejora del Servicio de Información de GT4 a través del Common Infor-
mation Model
G. Fernández, I. Dı́az, P. González, M. J. Martı́n y J. Touriño . . . . . . . . . . . . . . 701

xvii
463
Automating the Modeling and Simulation
Life Cycle of Mobile Ad hoc Networks
P. Pablo Garrido, Manuel P. Malumbres, Jesus Llor, Esteban Torres1 ,
and Carlos T. Calafate2
Resumen— The use of simulation has grown in the
networking field, specially for Mobile Ad hoc Net-
works (MANETs). Simulation plays a very important
role when evaluating routing protocols. However, the
validity of published simulation results has been ques-
tioned by several authors. One of the main reasons
exposed in the research literature is related to topol-
ogy modeling, since the specific scenarios chosen have
a great impact on simulation results. Most simula-
tion studies usually pick a few randomly generated
simulation scenarios leading to a lack of credibility of
such works. Several works have been carried out re-
cently in which the authors define a set of metrics and
propose several recommendations for properly choos-
ing the simulation scenarios. However, it is almost
impossible to follow those recommendations without
the support of specific tools, specially when network
nodes are mobile. In this paper, a simulation frame-
work is presented supporting both topology model-
ing and the simulation automation based on the OP-
NET Modeler simulator. The proposed set of tools
is helpful at constructing rigorous MANET scenarios,
as well as at performing other necessary tasks such
as running simulations, extracting the selected data
from the simulation results, and generating graphs
and reports. These tools have been ported to the
most common platforms, and can be executed either
sequentially or in parallel on a Condor cluster.
Palabras clave— Modeling, Simulation Life Cycle,
Automation, OPNET Modeler, Condor
I. Introduction
M OBILE Ad hoc Networks (MANETs) are com-
posed by a group of wireless stations that com-
municate with each other to form a network. This
kind of networks does not require any sort of infras-
tructure. Instead, a source node can communicate
with a destination node directly (if both are within
the communication range) or through a set of inter-
mediate nodes that forward any incoming packet to
the next neighbor in the established path (multihop).
Implementing a real MANET scenario is costly
and both resource and time consuming. On the
other hand, these networks are mathematically in-
tractable [1]. So, most published research works
about MANETs use simulation tools [2], but the reli-
ability of such simulation studies has been questioned
[3], [4], [5].
Modeling appropriate scenarios and realistic mo-
bility patterns is an important task when simulating
MANETs, since small differences in the scenario’s
topology have a large impact on routing algorithms,
as stated in [6] and [7]. However, the scenarios are
1 Dpto. Fı́sica y Arquitectura Computadores, Univ.
Miguel Hernández, e-mail: {pgarrido, mels, jllor,
esteban.torres}@umh.es.
2 Dpto. Informática de Sistemas, Univ. Politécnica Valencia,
e-mail: calafate@disca.upv.es.
A Coruña, 16-18 de septiembre de 2009
usually randomly generated in much of the research
works without any kind of validation, leading to a
lack of accuracy. So, a way to characterize and vali-
date simulation scenarios prior to evaluating routing
protocols is required. This problem has been widely
addressed in the literature [2], [7], [8], [9], [10], [11].
For example, two metrics are used in [8] for con-
structing valid MANET scenarios in order to evalu-
ate routing protocols: (1) average shortest path hop
count, and (2) average network partitioning. Some
metrics are defined in [10] in order to quantify the
partitioning degree too.
However, putting into practice the suggestions
given in such works is quite complicated without the
help of adequate software tools. According to [2],
some of the most commonly used simulator tools for
modeling wireless networks are ns-2 [12], GloMoSim,
and OPNET Modeler [13]. However, the OPNET
Modeler simulator is not as extended as ns-2, and
such kind of tools is not available. Thus, in this pa-
per we present a simulation framework that is able
to meet these research goals.
The remainder of the paper is organized as fol-
lows. Firstly, an overview of the developed simula-
tion framework is presented in section II. In Sec-
tion III, the modeling of MANET scenarios and the
methodology for running a set of simulations are de-
scribed. Section IV describes how to process the re-
sulting data from the simulations in order to generate
graphs and reports that make easier the analysis of
such data. Finally, conclusions are drawn in Section
V, along with references to future work.
II. Framework overview
This paper presents a set of tools developed specif-
ically for the OPNET Modeler simulator in order to
automate, not only the modeling, but also all the
phases involved with the simulation cycle. The spe-
cific purpose of each one is briefly described on the
following:
• simul topogen: this is a topology generator that
follows some of the recommendations proposed
in the literature in order to build appropriate
MANET scenarios.
• simul simul : used for running one or several sim-
ulation sets, specifying, for example, different
random number seeds or a list of values for some
parameter.
• simul data: used for extracting data from all
the binary files obtained as result of running the
simulation sets. This program invokes another
XX Jornadas de Paralelismo
program called, ov2txt, which extracts data from
the result file (.ov) for each individual simulation
and saves it to a text file.
• simul graphs: used for generating graphs from
the extracted data.
• simul reports: used for building a report for each
programmed simulation set.
All these tools are command-line programs and
were developed using the C programming language.
This has allowed to migrate them easily to several
platforms such as MS-Windows, UNIX-like systems
(e.g. Linux), or MacOS X. However, running some of
these programs will be only possible if the OPNET
Modeler has been ported to that specific platform.
Currently, it is available for MS-Windows and Linux
(since v11.5). For example, the simul topogen tool
needs the External Model Access (EMA) package
from OPNET in order to building MANET scenar-
ios, and the simul simul tool invokes the op runsim
program to run each simulation from the command
line. The same applies to the simul data program
because the program ov2txt is invoked, requiring the
EMA package too.
On the other hand, the remainder tools do not
need the OPNET Modeler simulator, and so they can
be executed on a different platform if necessary. In
particular, simul graphs can be executed on any plat-
form in which either the R package [14] or gnuplot
[15] are available. About the simul reports tool, this
only needs a LATEX[16] distribution, which is avail-
able in many platforms.
Finally, all the developed tools are able to work
both sequentially and in parallel when a cluster sys-
tem is available (e.g. Condor [17]). This is achieved
easily by specifying a simple option from command-
line, drastically reducing the time spent in each step
of the whole process.
III. Modeling and Simulation
A. Modeling MANET scenarios
Network simulators typically receive a scenario as
input, which, in the particular case of MANETs, de-
scribes the mobility pattern of a group of nodes.
Both the OPNET Modeler simulator and the pro-
posed simul topogen utility allow the user to ran-
domly set the initial node placement within a specific
area, as well as setting a mobility profile.
With regard to the mobility pattern of nodes, sev-
eral mobility models have been proposed [18], but
only a few are available in OPNET Modeler. With
OPNET Modeler it is possible to use either a cen-
tralized or a decentralized approach when modeling
the mobility pattern. In the centralized approach,
a common mobility profile is used for all the nodes,
and a ’Mobility Config’ object is needed. This ob-
ject holds the random mobility parameters for the
Random Waypoint mobility model (RWM), namely,
the area of the movement, the speed, and the pause
time. This is the most common mobility model
for MANETs [8], [19]. The random path followed
464
by each mobile node is recorded in an ASCII text
file (with a .trj extension) by running a simulation.
If more flexibility is required, the decentralized ap-
proach is more adequate, allowing to define a distinct
profile for each node.
When executing one simulation, one random num-
ber seed must be specified. Thus, to ensure the sta-
tistical validity of the obtained results, it is necessary
to repeat the experiment with distinct random seeds.
However, changing the seed affects the trajectory fol-
lowed by the mobile nodes. In order to use the same
trajectory independently of the random number seed
used, the generated trajectory file for each node us-
ing the centralized approach should be assigned to
the corresponding mobile node using the ’trajectory’
attribute. OPNET Modeler offers an option to do
this assignment.
Although, all the aforementioned options within
OPNET Modeler are useful, when it is necessary to
generate a great number of MANET scenarios, doing
it manually can be a tedious task and prone to error.
Our simul topogen tool does all those steps automat-
ically for a specified list of seed values, generating a
distinct scenario and trajectories for each one. An-
other drawback of manually doing these tasks within
the OPNET Modeler environment is that there is no
way of knowing if the scenarios generated are valid
for conducting a rigorous research, specially in the
presence of mobility. The position of nodes is a crit-
ical factor because one or more of them could be
isolated. This is specially true in the case of static
scenarios where the position of nodes provokes net-
work partitioning. For example, if some nodes are
isolated, they will not be able to communicate with
each other during all the simulation time nor receive
broadcast messages. In an dynamic scenario, this
problem can also occur at any time due to the mo-
bility of the nodes, but it is usually temporary.
Due to these issues, some researchers have pro-
posed some recommendations when choosing the sce-
narios for simulation. For example, as stated in [8],
in order to rigorously test a MANET routing proto-
col, the scenario should meet two standards: (1) the
average shortest-path hop count needs to be large,
and (2) only a small amount of network partitioning
should exist. Therefore, the proposed simul topogen
tool takes into account such recommendations and
checks the validity of any generated scenario.
The simul topogen tool computes the average
shortest-path hop count and several metrics defined
in [8] and [10] in order to determine the network par-
tition degree for each scenario generated. In short,
the four metrics considered in simul topogen are de-
fined as follows:
• Average shortest-path hop count (AHC): the
smallest number of hops along any path between
each pair of nodes, taking into account the trans-
mission range. The minimum value is 1, indi-
cating that every pair of nodes are direct neigh-
bours. Although the average number of hops is
more commonly used when evaluating the per-
465 A Coruña, 16-18 de septiembre de 2009

formance of a protocol, this metric is more con- Scenario seed=00001 − Nodos (50): 0..49
venient to check for the validity of the generated

0
m 10 2
46 17 9 21 33 0
scenarios because it is not protocol dependent. 14 24
19 16 27
29
43 30

100
• Average Network Partitioning (ANP): the pro- 44
20 5 1
portion of node pairs with no communication 42
28 8
47
15
40

200
34 7
18 32
path available. The optimum value for this met- 26 37 35 12
39
ric is 0%, indicating that there is no partitioning 36 22

300
38 45 6
25 13 4
23
degree and so all the nodes are able to commu- 3 31
11 49
48

400
41
nicate with each other. m

• Average Number of Groups (ANG): the number 0 500 1000 1500

of partitions that exist in the network. If this Scenario seed=00001 − Nodos (50): 0..49
value is 1, all nodes are in the same group, that

0
m
is, there is no isolated node.
Average Partition Size (APS): the average num-

100
•
27 43 36
ber of nodes in each partition. The greater the 22
44 10
17
7262
45 32
20
34

200
37
size of a partition, the higher connectivity and 40
35 14 47
48
12 3
38
lower partitioning degree of the network. If this 31
11
21
91928 8

300
13
16 4142 30
value is exactly the number of nodes, all of them 49
1 5 15 3925
33 0
are in the same group. On the other hand, if this 24 2923

400
18 4
m
6
46
value is 1, each node is isolated from the others.
0 500 1000 1500

All these metrics are computed not only in the

initial state, but also during the simulation time,
being defined as the average value. Finally, the
best scenarios are chosen in order to meet these
two standards. The essential characteristics of the
simul topogen tool are shown by means of the fol-
lowing example:
simul_topogen -p myproject -m mynetwork
-seeds 1 50 1
-nodes MOB node*
-area 0 0 1900 400 0 0
-mobility 5 0 0 0 1
-checkpartition 250
-duration 300
-select 10 ANP ASC n
-export rh ..\trajectories
In this case, the template scenario to be tested is
read from the ’mynetwork’ model within the OPNET
Modeler project ’myproject’. The values following
the -seed argument are the seeds to be used, that
is, the number of scenarios to be tested: from 1 to
50 by increments of 1 (50 seeds). Then, the net-
work nodes to be randomly placed are specified; they
can be either mobile nodes (MOB) or fixed ones (FIX),
and those which name starts with ’node’. The spec-
ified nodes will be placed in a rectangular flat area
sized 1900x400 meters. A 3D volume can be set too
specifying the altitude range in the last two values
of the -area parameter. Then, the RWM mobility
model parameters are specified with the -mobility
option in this order: speed, pause time, start time,
stop time, and frequency. In order to check the net-
work partitioning degree, the communication range
is specified in the -checkpartition argument (250
m.). The simulation time (-duration) is set to 300
s. Then, with the -select option, the scenarios to
be choosen are specified; in this case, they will be
sorted by one of the evaluated metrics (ANP) in as-
cending order, and only the top 10 scenarios out of
50 generated will be selected, discarding those sce-
Fig. 1. Snapshot during a simulation (top) and trajectories
followed by nodes (bottom)
narios which present more than one partition at the
initial state.
Finally, the trajectories followed by each node can
be exported to a single ASCII file readable either
by the R package or by MS-Excel. The destination
path for this file can be specified too. In addition,
the simul topogen utility is able to generate a set of
graphical files showing the position of the nodes at
any time and for each of the selected scenarios, that
is, all the snapshots along the simulation time. Fur-
thermore, the trajectories followed by all the nodes
or a group of them can be exported to graphical files
too, by post-processing the trajectory file generated
previously. So, the user can choose any of the graphs
generated for including them into a report or research
paper outside of OPNET Modeler simulator (see Fig-
ure 1). However, OPNET Modeler includes an ani-
mation viewer that can be used to visualize the move-
ment of the nodes during the simulation. All these
facilities could be very useful in order to implement
and verify a new mobility model, in a similar way
than the iNSpect [20] utility does.
Depending on the simulation study to be con-
ducted, the researcher could need to choose the best
or worst scenarios. This can be done by simply spec-
ifying any of the computed metrics and the order of
sorting (ASC or DESC) in the -select option.
B. Running simulations
Within the OPNET Modeler GUI, when the
user runs a simulation, the op runsim program is
launched in the background. This program can also
be executed from the command-line too by the user,
specifying the appropriate arguments. However, this
should be done for every simulation within the whole
simulation set, that is, varying the random number
seed, the scenario, traffic load, etc.
XX Jornadas de Paralelismo
In order to automate this manual process, and to
avoid human errors, the program simul simul has
been developed. The purpose of this tool is to run
a set of simulations outside the OPNET Modeler
environment in an unattended manner, either se-
quentially or concurrently. The program receives an
ASCII text file as input, including the different pa-
rameters for the simulations to run, and these are
launched by invoking the op runsim program with
the appropriate arguments each time. The usage of
this program is the following:
simul_simul -f simuls.txt
[-cluster 20] [-distributed]
The input file ’simuls.txt’, which is specified
through the -f option, is a tab-delimited file, and so
it can be edited within the MS-Excel application for
convenience. Each line corresponds to an indepen-
dent simulation set, and each column to the argu-
ments to the distinct simulations within the simula-
tion set. Columns include mainly a list of random
number seeds, and several lists of comma-separated
values, which will be the varying arguments between
simulations. Usually only one of these arguments is
the varying value, being the value shown at the ab-
scissas axis in the graphs (e.g. traffic load).
Optionally, if a Condor cluster system [17] is avail-
able, the simulation set could be run concurrently
specifying the option -cluster along with the maxi-
mum number of simultaneous simulations, which has
to be less or equal than the number of the cluster
processors available. However, since each simulation
needs the appropriate license, this value is limited by
the number of OPNET licenses available too. The
user only needs to specify the -cluster option, and
the program automatically generates the necessary
submit job files to launch all the simulations. That
is, the user does not need any knowledge about the
Condor system.
This should not be confused with the Simulation
Partitioning concept [21], in which a single simula-
tion is distributed onto a number of different ma-
chines in order to achieve a greater simulation scale
than on a single machine. In fact, the OPNET Mod-
eler has a preference that can be enabled or disabled
to specify whether each simulation should be run se-
quentially or in parallel on several processors. By
default, this preference is disabled; to enable the par-
allel preference from the simul simul tool, the option
-distributed should be specified in the command
line.
IV. Result processing
A. Extracting data
All the statistics resulting from the OPNET Mod-
eler simulations are stored in a single output vector
file (file type suffix .ov). This is a binary file that
must be converted to a text file in order to be im-
ported and processed by external software like the R
package, gnuplot, or MS-Excel, for example, in order
to graphically present the data (see Section IV-B).
466
OPNET Modeler allows the user to export the col-
lected statistics in three different ways:
1. Executing the ’Export Data to Spreadsheet’ op-
eration after showing a specific statistic within
the Results Browser. By using a graph template
several statistics can be exported at once; how-
ever this process takes a long time when dealing
with a great number of simulations.
2. Using the op cvov.exe and op cvos.exe util-
ities available within OPNET Modeler since
v14.0. Unfortunately, these are not available for
previous versions.
3. By means of a self-designed C program which
uses the External Model Access (EMA) pack-
age. This is the most convenient option because
the process has been customized in order to be
totally unattended, and it is available for any
OPNET Modeler version.
Two different tools were developed for this pur-
pose: (1) ov2txt, which uses the EMA package and
exports several specified statistics from the output
vector file (.ov) to a single ASCII text file, and (2)
simul data, which invokes to ov2txt for each simula-
tion in a simulation set. Although all this functional-
ity could have been implemented in a single program,
doing it in this way allows to parallelize the process
using a cluster, as it will be explained later.
The use of the simul data program is very sim-
ple, since it receives exactly the same input file than
simul simul (see Section III-B). For example:
simul_data -f simuls.txt -x @stats.txt
[-cluster 96]
This program interprets the simulations set de-
fined in the input file ’simuls.txt’ and then iterates
building the appropriate arguments for ov2txt invo-
cation for each simulation. As it can be seen from
the example, in addition to the input file it is nec-
essary to specify the statistics to be extracted with
the -x option. Although it is possible to give a list of
numbers, the most convenient way is to specify a file
name which contains the names of the selected statis-
tics, as appear within the OPNET Modeler environ-
ment. For example, the file ’stats.txt’ contains the
following:
time (sec.)
Wireless LAN.Throughput (bits/sec)
Wireless LAN.Delay (sec)
AODV.Number of Hops per Route
Finally, this program can do its task in parallel if
the -cluster option is specified. In this case, each
invocation to ov2txt will be a process, and the max-
imum number of simultaneous processes will be lim-
ited by the number of processors available and by the
value specified in the command-line. Again, it is not
necessary for the user to know anything about how
to launch jobs in Condor, as this program generates
all the necessary job files and submits them.
467 A Coruña, 16-18 de septiembre de 2009

1e+02
1e+01
AC_VO (Voice)
AC_VI (Video)
AC_BE (BestEffort)
AC_BK (Background)
56
82 77.8 68.7 58.3 42 21
46.6
24.2
30.2 editing and recompiling the software.
37.7 18.8
43.1
25.1
31.5 17.7
As the previous programs, simul graphs can be ex-
1e+00

1e+01
19.2 13.3 26.8
16.7
14.7
ecuted in parallel in a Condor system by specifying
Throughput per AC (Mbit/s)
8.3
5

Bandwidth share (%)

6.9

2.4 the -cluster option, drastically reducing the time

1e−01

1e+00
2

spent in this process. In this case, each invocation

1.1
1.2
0.9

0.5

to a R or gnuplot script file will become a process in

1e−02

1e−01
0.3

AC_VO (Voice)
the Condor system.
0 AC_VI (Video)
1e−03

AC_BE (BestEffort)

1e−02
AC_BK (Background)

1 2 3 4 5 6
Number of hops from source to destination
Fig. 2. Examples of graphs generated by simul graphs
B. Generating graphs
The simul graphs tool focuses on generating
graphs from the data extracted previously. All the
exported data for any individual simulation within a
simulation set are taken into account. The usage of
simul graphs is very similar to the previous ones:
simul_graphs -f simuls.txt graphs.txt
[-ci 90] [-gnuplot] [-cluster 96]
Again, ’simuls.txt’ is the simulation file ex-
plained before, and ’graphs.txt’ is the graphs file,
which is another text file describing each graph to be
generated. If the -ci option is specified, confidence
intervals will be computed and shown in the plots
using the confidence level specified (90, 95, 99, . . . ).
The format of the graphs file is very similar to
the simulations one because it is an ASCII text tab-
delimited file. So, both can be edited as a spread-
sheet for convenience. The most relevant data in-
cluded in the graphs file are: title and subtitle, the x
and y axis titles, the column number for the abscissa
values within the data files, the column numbers for
any of the data series to be plotted and the corre-
sponding serial names to be included in the legend.
Additionally, the limits of the graph, the position of
the legend, and the kind of graph to be generated.
Currently, only two graph types are supported: lines
and stacked bars (see Figure 2).
The graphs are generated by means of some pre-
defined and parameterized R scripts [14], thus the
user does not need to know the R language to ob-
tain the graphs. However, the user can modify the R
scripts in order to custom the output if needed. Each
graph is generated in two graphic formats, namely,
Encapsulated PostScript (EPS) [22] and Portable
Network Graphics (PNG) [23]. The EPS graph files
are vectorial format and it is the recommended for-
mat to be included when writing a research paper,
whereas the PNG graphs are recommended to be in-
cluded in MS-Power Point presentations.
On the other hand, if -gnuplot is specified, gnu-
plot [15] script files will be generated and executed.
In this case, the same graphs will be generated again,
but with a distinct appearance. The formats gener-
ated are: EPS, PNG, or Scalable Vector Graphics
(SVG) [24]. We are planning to include more dis-
tinct outputs (e.g., Matlab or xgraph). In this way
the user can choose the desired graphics package, and
modify the automatically generated scripts without
7 8 1 2 3 4 5 6 7 8
Number of hops from source to destination C. Generating reports
Finally, the last program presented allows to put
all the graphs and the summarized data used for each
graph together in a single document. That way, the
user can analyze the results in both a visual and in
a numerical way more easily. The program in charge
of doing this task is simul reports, whose usage is the
following:
simul_reports -f simuls.txt graphs.txt
[-outputprofile {pdf|dvi|dvi-ps|dvi-ps-pdf}]
where ’simuls.txt’ is the same simulation file
used in all the previous steps, and ’graphs.txt’
the same graphs file used for simul graphs.
The result of this program is a single document per
simulation set, generated using the LATEX document
preparation system [16]. Firstly, the simul reports
builds a source file (with a .tex extension) on the fly.
Then, depending on the output profile specified with
the -outputprofile option, the source file is com-
piled into one of the following formats: Portable Doc-
ument Format (PDF, by default), Device Indepen-
dent format (DVI), Postscript (PS) or PDF through
Postscript. There exist viewers for all of these file
formats for the most common platforms. The graph-
ical format included in the final document (e.g. PNG
or EPS) depends on the output profile chosen, but
all of them must have been generated previously by
simul graphs. Finally, if the user knows the LATEX
language, the source file generated can be modified
or included in his/her own documents.
V. Conclusions and future works
Although simulation is the most common tech-
nique used for testing MANET routing protocols,
it is necessary to validate the scenarios generated.
Some recommendations and metrics have been pro-
posed in the literature in order to characterize simu-
lation scenarios. However, putting such suggestions
into practice is very difficult without the support of
adequate software tools. The framework presented in
this paper is very effective and useful when simulat-
ing MANET experiments using the OPNET Modeler
simulator.
The first of the simulation tools is a topology gen-
erator which considers some of the metrics suggested.
The best scenarios (or the worst ones) of a set of ran-
domly generated scenarios can be chosen, depending
on one of the metrics evaluated. More metrics could
be easily added if needed. In addition, it also plots
the selected scenarios, including both the initial state
and the trajectories followed by each mobile node.
XX Jornadas de Paralelismo
The remainder tools aim at simplifying the simu-
lation process and the subsequent analysis of results.
They provide utilities for automating tasks such as
running simulations, extracting relevant data, gen-
erating graphs, and building reports including both
the data and graphs previously generated. All these
tasks can be done outside the graphical interface of
OPNET Modeler, in batch mode on the most com-
mon platforms.
About the usability of these tools, although all of
them are used from command-line and there is no
graphical interface, they are very easy to use, as their
syntax is very similar. Moreover, the tools support
the use of clusters of workstations for parallel pro-
cessing, improving dramatically their running times.
Finally, the user does not need to know anything
about the R package, gnuplot, LATEX, nor the Condor
system. Thus, this framework has a weak learning
curve.
As future work, it could be interesting to be able
to export the topology and trajectory files generated
(.trj files) by simul topogen to other simulators like
ns-2. This would allow to compare the simulation
results against other simulators, further validating
the obtained results.
The set of tools can be downloaded from the Gat-
com web site (http://atc.umh.es/gatcom/), although
they are still under active development.
Acknowledgments
This work was partially supported by the Minis-
terio de Educación y Ciencia, Spain, under Grant
DPI2007-66796-C03-03. The authors also would like
to acknowledge OPNET Technologies, Inc. for pro-
viding an educational OPNET Modeler license.
Referencias
[1] L. Felipe Perrone, Yougu Yuan, and David M. Nicol,
“Modeling and simulation best practices for wireless ad
hoc networks,” in Proceedings of the 35th Winter Simu-
lation Conference (WSC), 2003, pp. 685–693.
[2] Stuart Kurkowski, Tracy Camp, and Michael Colagrosso,
“Manet simulation studies: the incredibles,” SIGMO-
BILE Mob. Comput. Commun. Rev., vol. 9, no. 4, pp.
50–61, 2005.
[3] David Cavin, Yoav Sasson, and Andre Schiper, “On the
accuracy of MANET simulators,” in 2nd ACM int. work-
shop on Principles of Mobile Computing (POMC), 2002,
pp. 38–43.
[4] K. Pawlikowski, H. D. J. Jeong, and J. S. R. Lee, “On
credibility of simulation studies of telecommunication
networks,” IEEE Communications Magazine, vol. 40,
no. 1, pp. 132–139, 2002.
[5] Todd Andel and Alec Yasinsac, “On the credibility of
manet simulations,” Computer, vol. 39, no. 7, pp. 48–54,
July 2006.
[6] G. Amoussou, B.L. Agba, Z. Dziong, M. Kadoch, and
F. Gagnon, “Performances analysis of mobile ad hoc
routing protocols under realistic mobility and power
models,” in OPNETWORK 2006, Washington D.C,
USA, 2006.
[7] M.B. Doar, “A better model for generating test net-
works,” Global Telecommunications Conference, 1996.
GLOBECOM ’96. ’Communications: The Key to Global
Prosperity, pp. 86–93, Nov 1996.
[8] Stuart Kurkowski, Tracy Camp, and William Navidi,
“Two standards for rigorous manet routing protocol eval-
uation,” in Mobile Adhoc and Sensor Systems (MASS),
2006 IEEE International Conference on, Oct. 2006, pp.
256–266.
468
[9] S. Kurkowski, W. Navidi, and T. Camp, “Discovering
variables that affect manet protocol performance,” in
Global Telecommunications Conference, 2007. GLOBE-
COM ’07. IEEE, 26-30 Nov. 2007, pp. 1237–1242.
[10] J. Hahner, D. Dudkowski, P.J. Marron, and K. Rother-
mel, “Quantifying network partitioning in mobile ad hoc
networks,” in Mobile Data Management, 2007 Interna-
tional Conference on, 1-1 May 2007, pp. 174–181.
[11] H. Haddadi, M. Rio, G. Iannaccone, A. Moore, and
R. Mortier, “Network topologies: inference, modeling,
and generation,” Communications Surveys & Tutorials,
IEEE, vol. 10, no. 2, pp. 48–69, Quarter 2008.
[12] “The Network Simulator – ns-2,”
http://www.isi.edu/nsnam/ns/.
[13] Opnet Technologies Inc., “OPNET Modeler,”
http://www.opnet.com/.
[14] R Development Core Team, R: A Language and En-
vironment for Statistical Computing, R Foundation for
Statistical Computing, Vienna, Austria, 2006, ISBN 3-
900051-07-0.
[15] Jeff Racine, “gnuplot 4.0: a portable interactive plotting
utility,” Journal of Applied Econometrics, vol. 21, no. 1,
pp. 133–141, 2006.
[16] Leslie Lamport, LaTeX User’s Guide and Document Ref-
erence Manual, Addison-Wesley Publishing Company,
Reading, Massachusetts, 1986.
[17] Condor, “Condor project,”
http://www.cs.wisc.edu/condor/.
[18] T. Camp, J. Boleng, and V. Davies, “A survey of mobility
models for ad hoc network research,” Wireless Commu-
nications & Mobile Computing (WCMC): Special issue
on Mobile Ad Hoc Networking: Research, Trends and
Applications, vol. 2, no. 5, pp. 483–502, 2002.
[19] J. Yoon, M. Liu, and B. Noble, “Random waypoint con-
sidered harmful,” in IEEE INFOCOM Conference, 2003.
[20] S. Kurkowski, T. Camp, N. Mushell, and M. Colagrosso,
“A visualization and analysis tool for ns-2 wireless sim-
ulations: inspect,” in Modeling, Analysis, and Sim-
ulation of Computer and Telecommunication Systems,
2005. 13th IEEE International Symposium on, 27-29
Sept. 2005, pp. 503–506.
[21] Donghua Xu and Mostafa Ammar, “Benchmap:
Benchmark-based, hardware and model-aware partition-
ing for parallel and distributed network simulation,” in
MASCOTS ’04: Proceedings of the The IEEE Com-
puter Society’s 12th Annual International Symposium on
Modeling, Analysis, and Simulation of Computer and
Telecommunications Systems, Washington, DC, USA,
2004, pp. 455–463, IEEE Computer Society.
[22] Peter Vollenweider, Encapsulated PostScript: applica-
tion guide for the Macintosh and PCs, Prentice Hall
International (UK) Ltd., Hertfordshire, UK, UK, 1990.
[23] T. Boutell, “Png (portable network graphics) specifica-
tion version 1.0,” Tech. Rep., United States, 1997.
[24] Andrew Watt, SVG Unleashed, Pearson Education, 2002.
[25] K.I. Calvert, M.B. Doar, and E.W. Zegura, “Modeling
internet topology,” Communications Magazine, IEEE,
vol. 35, no. 6, pp. 160–163, Jun 1997.