Systems and methods for multiresolution priority queues
Abstract
A system for storing and extracting elements according to their priority takes into account not only the priorities of the elements but also three additional parameters, namely, a priority resolution pΔ and two priority limits pmin and pmax. By allowing an ordering error if the difference in the priorities of elements are within the priority resolution, an improvement in performance is achieved.
- Inventors:
- Issue Date:
- Research Org.:
- Reservoir Labs, Inc., New York, NY (United States)
- Sponsoring Org.:
- USDOE
- OSTI Identifier:
- 2221984
- Patent Number(s):
- 11704153
- Application Number:
- 17/355,339
- Assignee:
- Reservoir Labs, Inc. (New York, NY)
- Patent Classifications (CPCs):
-
G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING
- DOE Contract Number:
- SC0017184
- Resource Type:
- Patent
- Resource Relation:
- Patent File Date: 06/23/2021
- Country of Publication:
- United States
- Language:
- English
Citation Formats
Ros-Giralt, Jordi. Systems and methods for multiresolution priority queues. United States: N. p., 2023.
Web.
Ros-Giralt, Jordi. Systems and methods for multiresolution priority queues. United States.
Ros-Giralt, Jordi. Tue .
"Systems and methods for multiresolution priority queues". United States. https://www.osti.gov/servlets/purl/2221984.
@article{osti_2221984,
title = {Systems and methods for multiresolution priority queues},
author = {Ros-Giralt, Jordi},
abstractNote = {A system for storing and extracting elements according to their priority takes into account not only the priorities of the elements but also three additional parameters, namely, a priority resolution pΔ and two priority limits pmin and pmax. By allowing an ordering error if the difference in the priorities of elements are within the priority resolution, an improvement in performance is achieved.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2023},
month = {7}
}
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.
Works referenced in this record:
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
journal, October 1988
- Brown, R.
- Communications of the ACM, Vol. 31, Issue 10
An improved data stream summary: the count-min sketch and its applications
journal, April 2005
- Cormode, Graham; Muthukrishnan, S.
- Journal of Algorithms, Vol. 55, Issue 1
High-performance many-core networking: design and implementation
conference, January 2015
- Ros-Giralt, Jordi; Commike, Alan; Honey, Dan
- Proceedings of the Second Workshop on Innovating the Network for Data-Intensive Science - INDIS '15
A minimum spanning tree algorithm with inverse-Ackermann type complexity
journal, November 2000
- Chazelle, Bernard
- Journal of the ACM, Vol. 47, Issue 6
Fibonacci heaps and their uses in improved network optimization algorithms
journal, July 1987
- Fredman, Michael L.; Tarjan, Robert Endre
- Journal of the ACM, Vol. 34, Issue 3
Lockless hash tables with low false negatives
conference, September 2014
- Ros-Giralt, J.; Commike, A.; Rotsted, R.
- 2014 IEEE High Performance Extreme Computing Conference (HPEC)
Vortex: Enabling Cooperative Selective Wormholing for Network Security Systems
book, January 2007
- Lange, John R.; Dinda, Peter A.; Bustamante, Fabián E.
- Recent Advances in Intrusion Detection
Systems and methods for multiresolution priority queues
patent, August 2021
- Ros-Giralt, Jordi
- US Patent Document 11,106,493
Bro: a system for detecting network intruders in real-time
journal, December 1999
- Paxson, Vern
- Computer Networks, Vol. 31, Issue 23-24
Space/time trade-offs in hash coding with allowable errors
journal, July 1970
- Bloom, Burton H.
- Communications of the ACM, Vol. 13, Issue 7, p. 422-426
A note on two problems in connexion with graphs
journal, December 1959
- Dijkstra, E. W.
- Numerische Mathematik, Vol. 1, Issue 1