Comparing priority queues with support for priority updates at arbitrary indexes
The research software URDME makes use of a priority queue that has support for updating the priority of enqueued elements at arbitrary indexes. To achieve this URDME currently relies on a Binary Heap. In this thesis, we consider and evaluate other priority queues, with an awareness of spatial locali...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Uppsala universitet, Institutionen för informationsteknologi
2021
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-458357 |