1 Hit in 1.2 sec

Performance Measurement of Dynamic Structure DEVS for Large-Scale Cellular Space Models

Yi Sun, Xiaolin Hu
2009 Simulation (San Diego, Calif.)  
Lazy queue [36] is a multi-list data structure that divides the events into several parts and keep only a small portion of the near future events sorted. The far future events are unsorted.  ...  Another priority queue called twol-amalgamated priority queue [49] uses three efficient Henriksen's queue, skew heap, and splay tree, to achieve efficient operations.  ...  In [43] a calendar queue was introduced to hold references to the head and tail of event list.  ... 
doi:10.1177/0037549709102762 fatcat:oatiugzezjaqjfjg5diqhqiezi