13 papers · ranked by Valyu relevance
Willem Jan Palenstijn, Jeroen Bédorf, Jan Sijbers, K. Joost Batenburg
'K. Joost Batenburg'] While iterative reconstruction algorithms for tomography have several advantages compared to standard backprojection methods, the adoption of such algorithms in large-scale imaging facilities is still limited, one of the key obstacles being their high computational load. Although GPU-enabled…
Michael A. Anuta, Daniel W. Lozier, Peter R. Turner
This paper is a blueprint for the use of a massively parallel SIMD computer architecture for the simulation of various forms of computer arithmetic. The particular system used is a DEC/MasPar MP-1 with 4096 processors in a square array. This architecture has many advantages for such simulations due largely to the…
Xabier Insausti, Jesús Gutiérrez-Gutiérrez, Marta Zárraga-Rodríguez, Pedro M. Crespo
'Pedro M. Crespo'] In a network, a distributed consensus algorithm is fully characterized by its weighting matrix. Although there exist numerical methods for obtaining the optimal weighting matrix, we have not found an in-network implementation of any of these methods that works for all network topologies. In this…
Juan Ignacio Guerrero, Antonio Martín, Antonio Parejo, Diego Francisco Larios + 3 more
Currently, in many data landscapes, the information is distributed across various sources and presented in diverse formats. This fragmentation can pose a significant challenge to the efficient application of analytical methods. In this sense, distributed data mining is mainly based on clustering or classification…
Derya Malak, Mohammad Reza Deylam Salehi, Berksan Serbetci, Petros Elia + 2 more
'Petros Elia' 'Chintha Tellambura' 'Jun Chen'] The work here studies the communication cost for a multi-server multi-task distributed computation framework, as well as for a broad class of functions and data statistics. Considering the framework where a user seeks the computation of multiple complex (conceivably…
Alexander Magyari, Yuhua Chen, Angel Diéguez
Fully Homomorphic Encryption (FHE) allows a client to share their data with an external server without ever exposing their data. FHE serves as a potential solution for data breaches and the marketing of users’ private data. Unfortunately, FHE is much slower than conventional asymmetric cryptography, where data are…
Liang Zhao
The Internet of Things (IoT) has evolved significantly with advances in gathering data that can be extracted to provide knowledge and facilitate decision-making processes. Currently, IoT data analytics encountered challenges such as growing data volumes collected by IoT devices and fast response requirements for…
Ponnuswamy Sadayappan, Bradford L. Chamberlain, Guido Juckeland, Hatem Ltaief + 15 more
'Hatem Ltaief' 'Richard L. Graham' 'Lion Levi' 'Devendar Burredy' 'Gil Bloch' 'Gilad Shainer' 'David Cho' 'George Elias' 'Daniel Klein' 'Joshua Ladd' 'Ophir Maor' 'Ami Marelli' 'Valentin Petrov' 'Evyatar Romlet' 'Yong Qin' 'Ido Zemah'] This paper describes the new hardware-based streaming-aggregation capability added…
Ping Zhang, Wenjun Li, Hua Sun, Francesco Pappalardo
Secure aggregation is an essential component of modern distributed applications and data mining platforms. Aggregated statistical results are typically adopted in constructing a data cube for data analysis at multiple abstraction levels in data warehouse platforms. Generating different types of statistical results…
Soumyadip Ghosh, Jiacai Lu, Vijay Gupta, Gretar Tryggvason + 1 more
'Mohamed Kamel Riahi'] Numerical solution of partial differential equations on parallel computers using domain decomposition usually requires synchronization and communication among the processors. These operations often have a significant overhead in terms of time and energy. In this paper, we propose…
Denis Hünich, Andreas Knüpfer, Daniele D’Agostino
The Partitioned Global Address Space (PGAS) library DASH provides C++ container classes for distributed N-dimensional structured grids. This article presents enhancements on top of the DASH library to support stencil operations and halo areas to conveniently and efficiently parallelize structured grids. The…
Martin Werner
This paper provides an abstract analysis of parallel processing strategies for spatial and spatio-temporal data. It isolates aspects such as data locality and computational locality as well as redundancy and locally sequential access as central elements of parallel algorithm design for spatial data. Furthermore, the…
Dawn Michaelson, Dominik Schreiber, Marijn J. H. Heule, Benjamin Kiesl-Reiter + 1 more
'Benjamin Kiesl-Reiter' 'Michael W. Whalen'] Distributed clause-sharing SAT solvers can solve challenging problems hundreds of times faster than sequential SAT solvers by sharing derived information among multiple sequential solvers. Unlike sequential solvers, however, distributed solvers have not been able to produce…