Buscar
Mostrando ítems 1-10 de 88
Efficient high-precision integer multiplication on the GPU
(SAGE Journals, 2022-03)
[Abstract]: The multiplication of large integers, which has many applications in computer science, is an operation that can be expressed as a polynomial multiplication followed by a carry normalization. This work develops ...
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 ...
Automated and accurate cache behavior analysis for codes with irregular access patterns
(John Wiley & Sons Ltd., 2007-04-03)
[Abstract] The memory hierarchy plays an essential role in the performance of current computers, so good analysis tools that help in predicting and understanding its behavior are required. Analytical modeling is the ideal ...
Towards Low-Latency Model-Oriented Distributed Systems Management
(Springer, 2007)
[Abstract] Windows and Unix systems have been traditionally very different with regard to configuration storage and management. In this paper we have adapted our CIM-based model-driven management framework, AdCIM, to ...
Ontological Con guration Management for Wireless Mesh Routers
(Springer, 2009)
[Abstract] Wireless mesh networks (WMNs) are a category of wireless networks that are self-organized, robust and which offer more flexible client coverage with less equipment requirements than wired networks. In WMNs, mesh ...
Program Behavior Characterization Through Advanced Kernel Recognition
(Springer, 2007)
[Abstract] Understanding program behavior is at the foundation of program optimization. Techniques for automatic recognition of program constructs (from now on, computational kernels) characterize the behavior of program ...
Implementing Parallel Differential Evolution on Spark
(Springer, 2016-04-02)
[Abstract] Metaheuristics are gaining increased attention as an efficient way of solving hard global optimization problems. Differential Evolution (DE) is one of the most popular algorithms in that class. However, its ...
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 ...
HPF-2 Support for Dynamic Sparse Computations
(Springer, 1998)
[Abstract] There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and involve row and column operations ...
Characterization of message-passing overhead on the AP3000 multicomputer
(IEEE, 2001-09)
[Abstract] The performance of the communication primitives of parallel computers is critical for the overall system performance. The characterization of the communication overhead is very important to estimate the global ...