See this document in CiteSeerX!

A Comparative Performance Analysis Of Real-Time Priority Queues (2001)  (Make Corrections)  
Nikhil Mhatre



  Home/Search   Context   Related

 
View or download:
fsu.edu/research/report...TR011201.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  fsu.edu/research/reports/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: (Update)


Active bibliography (related documents):   More   All
0.6:   An Empirical Comparison of Priority Queue Algorithms - Marín   (Correct)
0.5:   Improving Pointer-Based Codes Through Cache-Conscious Data.. - Chilimbi, Larus, Hill (1998)   (Correct)
0.4:   On The Pending Event Set And Binary Tournaments - Marín   (Correct)

Similar documents based on text:   More   All
0.2:   Distributed File Access With Web-Services - Kulkarni   (Correct)
0.1:   *T: A Multithreaded Massively Parallel Architecture - Nikhil, Papadopoulos, Arvind (1992)   (Correct)
0.1:   Code Division Multiple Access wireless network planning.. - Tran-Gia, Jain, Leibnitz (1998)   (Correct)

BibTeX entry:   (Update)

@misc{ mhatre-comparative,
  author = "Nikhil Mhatre",
  title = "A Comparative Performance Analysis Of Real-Time Priority Queues",
  url = "citeseer.ist.psu.edu/mhatre01comparative.html" }
Citations (may not include all citations):
192   Self-adjusting Binary Search Trees (context) - Sleator, Tarjan - 1985  ACM   DBLP
71   A Data Structure for Manipulating Priority Queues (context) - Vuillemin - 1978  ACM   DBLP
65   Sorting and Searching (context) - Knuth - 1973
63   An Algorithm for the Organization of Information (context) - Adel'son-Velskii, Landis - 1962
62   An Empirical Comparison of Priority-Queue and Event-Set Impl.. (context) - Jones - 1986  ACM   DBLP
30   Self-Adjusting Heaps (context) - Sleator, Tarjan - 1986  DBLP
27   Implementation and Analysis of Binomial Queue Algorithms (context) - Brown - 1978  DBLP
18   Introducing Real-Time Linux (context) - Barabanov, Yodaiken - 1997  ACM
16   Analysis of Future Event Set Algorithms for Discrete Event S.. (context) - McCormack, Sargent - 1981  ACM   DBLP
12   Fishspear: A Priority Queue Algorithm (context) - Fischer, Paterson - 1984  ACM   DBLP
10   Lazy Queue: An Efficient Implementation of the Pending-event.. (context) - Ronngren, Riboe et al. - 1991  ACM
6   Description and Analysis of an Efficient Priority Queue Repr.. (context) - Francon, Vienot et al. - 1978  DBLP
6   Analysis of an Algorithm for Priority Queue Administration (context) - Jonassen, Dahl - 1975
3   An empirical evaluation of priority queue algorithms for rea.. (context) - Maheshwari - 1990
2   Organization and Maintainence of Large Ordered Indices (context) - Bayer, McCreight - 1972
1   Englewood Cliffs (context) - Decker - 1989
1   Data Structures and C Programs (context) - Van Wyck - 1988
http://www.gnat.com

Documents on the same site (http://www.cs.fsu.edu/research/reports/):   More
Bounding Worst-Case Data Cache Performance - White (1996)   (Correct)
The Weakest Precondition Protocol Analysis Environment - Yasinsac, Runy   (Correct)
The Computational Measure Of Uniformity - Li   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC