JHeaps: An open-source library of priority queues

Several new heap variants have been introduced in the last two decades. The main research motivation is to match the in-practice performance of pairing heaps while at the same time providing the strong theoretical guarantees of the original fibonacci heap. We present the interface and design of the...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autor principal:	Dimitrios Michail
Formato:	article
Lenguaje:	EN
Publicado:	Elsevier 2021
Materias:	Heap Priority queue Data structures Computer software QA76.75-76.765
Acceso en línea:	https://doaj.org/article/cb851f1a23734edcb36775a237ff8d1d
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:cb851f1a23734edcb36775a237ff8d1d
record_format	dspace
spelling	oai:doaj.org-article:cb851f1a23734edcb36775a237ff8d1d2021-11-14T04:34:24ZJHeaps: An open-source library of priority queues2352-711010.1016/j.softx.2021.100869https://doaj.org/article/cb851f1a23734edcb36775a237ff8d1d2021-12-01T00:00:00Zhttp://www.sciencedirect.com/science/article/pii/S2352711021001370https://doaj.org/toc/2352-7110Several new heap variants have been introduced in the last two decades. The main research motivation is to match the in-practice performance of pairing heaps while at the same time providing the strong theoretical guarantees of the original fibonacci heap. We present the interface and design of the JHeaps library, a production-ready open-source library of heaps which targets the Java Virtual Machine. The library contains a large number of state-of-the-art implementations of heap variants and properly designed interfaces which allow users to easily interchange and experiment with the performance of different heaps in their applications. Moreover, using the GraalVM for its ahead-of-time compilation together with well-known methodologies such as trace-based simulation, we perform the first large scale experimental study of heaps in a managed environment.Dimitrios MichailElsevierarticleHeapPriority queueData structuresComputer softwareQA76.75-76.765ENSoftwareX, Vol 16, Iss , Pp 100869- (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	Heap Priority queue Data structures Computer software QA76.75-76.765
spellingShingle	Heap Priority queue Data structures Computer software QA76.75-76.765 Dimitrios Michail JHeaps: An open-source library of priority queues
description	Several new heap variants have been introduced in the last two decades. The main research motivation is to match the in-practice performance of pairing heaps while at the same time providing the strong theoretical guarantees of the original fibonacci heap. We present the interface and design of the JHeaps library, a production-ready open-source library of heaps which targets the Java Virtual Machine. The library contains a large number of state-of-the-art implementations of heap variants and properly designed interfaces which allow users to easily interchange and experiment with the performance of different heaps in their applications. Moreover, using the GraalVM for its ahead-of-time compilation together with well-known methodologies such as trace-based simulation, we perform the first large scale experimental study of heaps in a managed environment.
format	article
author	Dimitrios Michail
author_facet	Dimitrios Michail
author_sort	Dimitrios Michail
title	JHeaps: An open-source library of priority queues
title_short	JHeaps: An open-source library of priority queues
title_full	JHeaps: An open-source library of priority queues
title_fullStr	JHeaps: An open-source library of priority queues
title_full_unstemmed	JHeaps: An open-source library of priority queues
title_sort	jheaps: an open-source library of priority queues
publisher	Elsevier
publishDate	2021
url	https://doaj.org/article/cb851f1a23734edcb36775a237ff8d1d
work_keys_str_mv	AT dimitriosmichail jheapsanopensourcelibraryofpriorityqueues
_version_	1718429985764540416

JHeaps: An open-source library of priority queues

Ejemplares similares