Forecasting of solar photovoltaic system power generation using wavelet decomposition and bias-compensated random forest

PH Chiang, SPV Chiluvuri, S Dey… - 2017 Ninth Annual …, 2017 - ieeexplore.ieee.org
The use of solar photovoltaic (PV) power is a promising solution to reduce grid power
consumption and carbon dioxide emissions. However, the benefit of utilizing solar PV power …

Analysis-driven engineering of comparison-based sorting algorithms on GPUs

B Karsin, V Weichert, H Casanova, J Iacono… - Proceedings of the …, 2018 - dl.acm.org
We study the relationship between memory accesses, bank conflicts, thread multiplicity (also
known as over-subscription) and instruction-level parallelism in comparison-based sorting …

An improved abstract gpu model with data transfer

TC Carroll, PWH Wong - 2017 46th International Conference on …, 2017 - ieeexplore.ieee.org
GPUs are commonly used as coprocessors to accelerate a compute-intensive task, thanks to
their massively parallel architecture. There is study into different abstract parallel models …

A novel computational model for GPUs with applications to efficient algorithms

A Koike, K Sadakane - International Journal of Networking and …, 2015 - jstage.jst.go.jp
We propose a novel computational model for GPUs. Known parallel computational models
such as the PRAM model are not appropriate for evaluating GPU-based algorithms. Our …

Efficient batched predecessor search in shared memory on GPUs

B Karsin, H Casanova… - 2015 IEEE 22nd …, 2015 - ieeexplore.ieee.org
Many-core Graphics Processing Units (GPUs) are being used for general-purpose
computing. However, due to architectural features, for many problems it is challenging to …

Engineering worst-case inputs for pairwise merge sort on GPUs

K Berney, N Sitchinava - 2020 IEEE International Parallel and …, 2020 - ieeexplore.ieee.org
Currently, the fastest comparison-based sorting implementation on GPUs is implemented
using a parallel pairwise merge sort algorithm (Thrust library). To achieve fast runtimes, the …

Parallel Cache-Efficient Algorithms on GPUs

KM Berney - 2023 - search.proquest.com
Abstract Graphics Processing Units (GPUs) have emerged as a highly attractive architecture
for general-purpose computing due to their numerous programmable cores, low-latency …

A novel computational model for GPUs with application to I/O optimal sorting algorithms

A Koike, K Sadakane - 2014 IEEE International Parallel & …, 2014 - ieeexplore.ieee.org
We propose a novel computational model for GPU. Known parallel computational models
such as the PRAM model are not appropriate for evaluating GPU algorithms. Our model …

An efficient multiway mergesort for GPU architectures

H Casanova, J Iacono, B Karsin, N Sitchinava… - arXiv preprint arXiv …, 2017 - arxiv.org
Sorting is a primitive operation that is a building block for countless algorithms. As such, it is
important to design sorting algorithms that approach peak performance on a range of …

Pairwise sequence alignment with gaps with GPU

TC Carroll, JT Ojiaku, PWH Wong - 2015 IEEE International …, 2015 - ieeexplore.ieee.org
In this paper we consider the pair-wise sequence alignment problem with gaps, which is
motivated by the re-sequencing problem that requires to assemble short reads sequences …