Parallel two-stage reduction to Hessenberg-triangular form

01/19/2023
by   Thijs Steel, et al.
0

We present a two-stage algorithm for the parallel reduction of a pencil to Hessenberg-triangular form. Traditionally, two-stage Hessenberg-triangular reduction algorithms achieve high performance in the first stage, but struggle to achieve high performance in the second stage. Our algorithm extends techniques described by Karlsson et al. to also achieve high performance in the second stage. Experiments in a shared memory environment demonstrate that the algorithm can outperform state-of-the-art implementations.

READ FULL TEXT

page 9

page 11

research
01/11/2022

A PTAS for parallel two-stage flowshops under makespan constraint

As a hybrid of the Parallel Two-stage Flowshop problem and the Multiple ...
research
03/11/2020

Constellation: A High Performance Geo-Distributed Middlebox Framework

Middleboxes are increasingly deployed across geographically distributed ...
research
03/28/2022

HUNIS: High-Performance Unsupervised Nuclei Instance Segmentation

A high-performance unsupervised nuclei instance segmentation (HUNIS) met...
research
06/27/2020

High Performance Evaluation of Helmholtz Potentials usingthe Multi-Level Fast Multipole Algorithm

Evaluation of pair potentials is critical in a number of areas of physic...
research
06/27/2020

High Performance Evaluation of Helmholtz Potentials using the Multi-Level Fast Multipole Algorithm

Evaluation of pair potentials is critical in a number of areas of physic...
research
02/20/2023

SegMobaTree: The Segmented Multilayer Online Balanced Tree for high-performance IPv6 Lookup in the Edge Network

With the development of IPv6 and edge computing, the edge network should...
research
07/13/2016

Fitting a Simplicial Complex using a Variation of k-means

We give a simple and effective two stage algorithm for approximating a p...

Please sign up or login with your details

Forgot password? Click here to reset