Algorithms for Grey-Weighted Distance Computations

05/08/2019
by   Magnus Gedda, et al.
0

With the increasing size of datasets and demand for real time response for interactive applications, improving runtime for algorithms with excessive computational requirements has become increasingly important. Many different algorithms combining efficient priority queues with various helper structures have been proposed for computing grey-weighted distance transforms. Here we compare the performance of popular competitive algorithms in different scenarios to form practical guidelines easy to adopt. The label-setting category of algorithms is shown to be the best choice for all scenarios. The hierarchical heap with a pointer array to keep track of nodes on the heap is shown to be the best choice as priority queue. However, if memory is a critical issue, then the best choice is the Dial priority queue for integer valued costs and the Untidy priority queue for real valued costs.

READ FULL TEXT

page 3

page 8

page 13

research
06/20/2018

A Faster External Memory Priority Queue with DecreaseKeys

A priority queue is a fundamental data structure that maintains a dynami...
research
09/26/2016

An Infinite Dimensional Model for A Single Server Priority Queue

We consider a Markovian single server queue in which customers are preem...
research
04/26/2019

Construction of Subexponential-Size Optical Priority Queues with Switches and Fiber Delay Lines

All-optical switching has been considered as a natural choice to keep pa...
research
01/17/2020

On Scheduler Side-Channels in Dynamic-Priority Real-Time Systems

While the existence of scheduler side-channels has been demonstrated rec...
research
09/01/2019

Improving the Effective Utilization of Supercomputer Resources by Adding Low-Priority Containerized Jobs

We propose an approach to utilize idle computational resources of superc...
research
09/02/2021

Multi-Queues Can Be State-of-the-Art Priority Schedulers

Designing and implementing efficient parallel priority schedulers is an ...
research
07/10/2018

Competitive Parallelism: Getting Your Priorities Right

Multi-threaded programs have traditionally fallen into one of two domain...

Please sign up or login with your details

Forgot password? Click here to reset