Listar Grupo de Arquitectura de Computadores (GAC) por título
Mostrando ítems 11-30 de 243
-
A Microprogrammed Approach for Implementing Statecharts
(Institute of Electrical and Electronics Engineers, 2019-10-21)[Abstract] Statechart diagrams allow specifying complex systems in which there may be several states active at the same time and a large number of events and transitions to evaluate. Statecharts have been found useful in ... -
A middleware architecture for distributed systems management
(Academic Press, 2004-06)[Abstract] This paper presents a middleware solution for global management of any kind of distributed system, such as networks of PCs/workstations, clusters or server farms. Our approach lies in an object-oriented software ... -
A multi-GPU shallow-water simulation with transport of contaminants
(Wiley, 2012)[Abstract] This work presents cost-effective multi-graphics processing unit (GPU) parallel implementations of a finite-volume numerical scheme for solving pollutant transport problems in bidimensional domains. The fluid ... -
A New Spatial Criteria Method to Delimit Rural Settlements towards Boundaries Equity: Land Use Optimization for Decision Making in Galicia, NW Spain
(MDPI, 2022)[Abstract] Rural settlements (RS) are a reality of rural areas. They consist of cluster of buildings and ways of life mainly associated with activities related to agriculture. As economic policies applied in rural development ... -
A new thread-level speculative automatic parallelization model and library based on duplicate code execution
(Springer Nature, 2024-03-11)Loop-efficient automatic parallelization has become increasingly relevant due to the growing number of cores in current processors and the programming effort needed to parallelize codes in these systems efficiently. However, ... -
A Novel Compiler Support for Automatic Parallelization on Multicore Systems
(Elsevier, 2013-09)[Abstract] The widespread use of multicore processors is not a consequence of significant advances in parallel programming. In contrast, multicore processors arise due to the complexity of building power-efficient, ... -
A parallel metaheuristic for large mixed-integer dynamic optimization problems, with applications in computational biology
(Public Library of Science, 2017)[Abstract] Background: We consider a general class of global optimization problems dealing with nonlinear dynamic models. Although this class is relevant to many areas of science and engineering, here we are interested ... -
A Parallel Skeleton for Divide-and-conquer Unbalanced and Deep Problems
(Springer Nature, 2021)[Abstract] The Divide-and-conquer (D&C) pattern appears in a large number of problems and is highly suitable to exploit parallelism. This has led to much research on its easy and efficient application both in shared and ... -
A pipeline architecture for feature-based unsupervised clustering using multivariate time series from HPC jobs
(Elsevier B.V., 2023-05)[Abstract]: Time series are key across industrial and research areas for their ability to model behaviour across time, making them ideal for a wide range of use cases such as event monitoring, trend prediction or anomaly ... -
A population-based iterated greedy algorithm for the delimitation and zoning of rural settlements
(Pergamon Press, 2013)[Abstract] In this paper we present a Population-Based Iterated Greedy (PBIG) algorithm for delimiting and zoning rural settlements. Each cadastral plots is allocated to a category (traditional–historical, common or none) ... -
A Portable and Adaptable Fault Tolerance Solution for Heterogeneous Applications
(Academic Press, 2017-06)[Abstract] Heterogeneous systems have increased their popularity in recent years due to the high performance and reduced energy consumption capabilities provided by using devices such as GPUs or Xeon Phi accelerators. This ... -
A PVM Based Library for Sparse Matrix Factorizations
(Springer, 1998)[Abstract] We present 3LM, a C Linked List Management Library for parallel sparse factorizations on a PVM environment which takes into account the fill-in, an important drawback of sparse computations. It is restricted to ... -
A SIMD Algorithm for the Detection of Epistatic Interactions of Any Order
(Elsevier, 2022)[Abstract] Epistasis is a phenomenon in which a phenotype outcome is determined by the interaction of genetic variation at two or more loci and it cannot be attributed to the additive combination of effects corresponding ... -
A simulated annealing algorithm for zoning in planning using parallel computing
(Pergamon Press, 2016)[Abstract] There is an increasing demand for tools that support land use planning processes, particularly the design of zoning maps, which is one of the most complex tasks in the field. In this task, different land use ... -
A Software Cache Autotuning Strategy for Dataflow Computing with UPC++ DepSpawn
(Wiley, 2021)[Abstract] Dataflow computing allows to start computations as soon as all their dependencies are satisfied. This is particularly useful in applications with irregular or complex patterns of dependencies which would otherwise ... -
Accelerating binary biclustering on platforms with CUDA-enabled GPUs
(Elsevier Ltd, 2018)[Abstract]: Data mining is nowadays essential in many scientific fields to extract valuable information from large input datasets and transform it into an understandable structure. For instance, biclustering techniques are ... -
Accelerating the HyperLogLog Cardinality Estimation Algorithm
(Hindawi, 2017)[Abstract] In recent years, vast amounts of data of different kinds, from pictures and videos from our cameras to software logs from sensor networks and Internet routers operating day and night, are being generated. This ... -
Accelerating the quality control of genetic sequences through stream processing
(Association for Computing Machinery, 2023)[Abstract]: Quality control of DNA sequences is an important data preprocessing step in many genomic analyses. However, all existing parallel tools for this purpose are based on a batch processing model, needing to have ... -
Acceleration of a Feature Selection Algorithm Using High Performance Computing
(MDPI AG, 2020-09-01)[Abstract] Feature selection is a subfield of data analysis that is on reducing the dimensionality of datasets, so that subsequent analyses over them can be performed in affordable execution times while keeping the same ... -
Affine Modeling of Program Traces
(Institute of Electrical and Electronics Engineers, 2019-02-01)[Abstract] A formal, high-level representation of programs is typically needed for static and dynamic analyses performed by compilers. However, the source code of target applications is not always available in an analyzable ...
