Search Results - "Mongelli, H"
-
1
Performance results of running parallel applications on the InteGrade
Published in Concurrency and computation (10-03-2010)“…The InteGrade middleware intends to exploit the idle time of computing resources in computer laboratories. In this work we investigate the performance of…”
Get full text
Journal Article -
2
A range minima parallel algorithm for coarse grained multicomputers
Published in Lecture notes in computer science (28-10-2006)“…Given an array of n real numbers A=(a1, a2, ..., an), define MIN(i, j) = min {ai, ..., aj}. The range minima problem consists of preprocessing array A such…”
Get full text
Book Chapter Conference Proceeding -
3
A Survey on Solutions for Planted Motif Search Challenging Instances
Published in Sistemas de Informação (Macaé) (01-12-2020)“…In the gene expression process, a transcription factor molecule will bind to a short substring in the promoter region of a gene in order to start the…”
Get full text
Journal Article -
4
Ant Colony System Based Solutions to the Quadratic Assignment Problem on GPGPU
Published in 2012 41st International Conference on Parallel Processing Workshops (01-09-2012)“…The NP-hard Quadratic Assignment Problem (QAP) was proposed in 1957. Until this date, it remains one of the hardest problems to solve in any reasonable amount…”
Get full text
Conference Proceeding -
5
Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components
Published in 2010 International Conference on High Performance Computing & Simulation (01-06-2010)“…Dehne et al. present a BSP/CGM algorithm for computing a spanning tree and the connected components of a graph, that requires O(log p) communication rounds,…”
Get full text
Conference Proceeding