Priority queues for computer simulations

Details Priority queues for computer simulations Priority queues for computer simulations

1997-04-23

1998-12-15

Kulik, Paul V.

Boots, shoes, and leggings

395553, 364578, G06F 1516

Patent

active

058505385

ABSTRACT:
The present invention is embodied in new priority queue data structures for event list management of computer simulations, and includes a new priority queue data structure and an improved event horizon applied to priority queue data structures. The new priority queue data structure is a Qheap and is made out of linked lists for robust, fast, reliable, and stable event list management and uses a temporary unsorted list to store all items until one of the items is needed. Then the list is sorted, next, the highest priority item is removed, and then the rest of the list is inserted in the Qheap. Also, an event horizon is applied to binary tree and splay tree priority queue data structures to form the improved event horizon for event management.

REFERENCES:
patent: 4901260 (1990-02-01), Lubachevsky
patent: 5247650 (1993-09-01), Judd et al.
patent: 5701439 (1997-12-01), James et al.
patent: 5794005 (1998-08-01), Steinman
patent: 5801938 (1998-09-01), Kalantery

Affiliated with

Also associated with

Rating

Priority queues for computer simulations does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Priority queues for computer simulations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Priority queues for computer simulations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1464438