A bridging model for multi-core computing
LG Valiant - Journal of Computer and System Sciences, 2011 - Elsevier
Writing software for one parallel system is a feasible though arduous task. Reusing the
substantial intellectual effort so expended for programming a second system has proved …
substantial intellectual effort so expended for programming a second system has proved …
Combined approach of array processing and independent component analysis for blind separation of acoustic signals
Two array signal processing techniques are combined with independent component
analysis (ICA) to enhance the performance of blind separation of acoustic signals in a …
analysis (ICA) to enhance the performance of blind separation of acoustic signals in a …
Oblivious algorithms for multicores and networks of processors
We address the design of algorithms for multicores that are oblivious to machine
parameters. We propose HM, a multicore model consisting of a parallel shared-memory …
parameters. We propose HM, a multicore model consisting of a parallel shared-memory …
Обзор моделей параллельных вычислений
НА Ежова, ЛБ Соколинский - Вестник Южно-Уральского …, 2019 - cyberleninka.ru
Цель данного обзора дать максимально полное представление о достижениях и
современном состоянии дел в разработке аналитических моделей параллельных …
современном состоянии дел в разработке аналитических моделей параллельных …
BSF: A parallel computation model for scalability estimation of iterative numerical algorithms on cluster computing systems
LB Sokolinsky - Journal of Parallel and Distributed Computing, 2021 - Elsevier
This paper examines a novel parallel computation model called bulk synchronous farm
(BSF) that focuses on estimating the scalability of compute-intensive iterative algorithms …
(BSF) that focuses on estimating the scalability of compute-intensive iterative algorithms …
[KİTAP][B] Handbook of parallel computing: models, algorithms and applications
S Rajasekaran, J Reif - 2007 - books.google.com
The ability of parallel computing to process large data sets and handle time-consuming
operations has resulted in unprecedented advances in biological and scientific computing …
operations has resulted in unprecedented advances in biological and scientific computing …
[KİTAP][B] Algorithms for memory hierarchies: advanced lectures
Algorithms that have to process large data sets have to take into account that the cost of
memory access depends on where the data is stored. Traditional algorithm design is based …
memory access depends on where the data is stored. Traditional algorithm design is based …
Topology-aware Parallel Joins
X Hu, P Koutris - Proceedings of the ACM on Management of Data, 2024 - dl.acm.org
We study the design and analysis of parallel join algorithms in a topology-aware
computational model. In this model, the network is modeled as a directed graph, where each …
computational model. In this model, the network is modeled as a directed graph, where each …
Bulk-synchronous pseudo-streaming algorithms for many-core accelerators
The bulk-synchronous parallel (BSP) model provides a framework for writing parallel
programs with predictable performance. In this paper we extend the BSP model to support …
programs with predictable performance. In this paper we extend the BSP model to support …
Performance modeling of heterogeneous systems
JC Meyer, AC Elster - 2010 IEEE International Symposium on …, 2010 - ieeexplore.ieee.org
Predicting how well applications may run on modern systems is becoming increasingly
challenging. It is no longer sufficient to look at number of floating point operations and …
challenging. It is no longer sufficient to look at number of floating point operations and …