The Library
FISHSPEAR - A PRIORITY QUEUE ALGORITHM
Tools
Tools
Tools
UNSPECIFIED. (1994) FISHSPEAR - A PRIORITY QUEUE ALGORITHM. JOURNAL OF THE ACM, 41 (1). pp. 3-30. ISSN 0004-5411
Full text not available from this repository.Abstract
The Fishspear priority queue algorithm is presented and analyzed. Fishspear is comparable to the usual heap algorithm in its worst-case running time, and its relative performance is much better in many common situations. Fishspear also differs from the heap method in that it can be implemented efficiently using sequential storage such as stacks or tapes, making it potentially attractive for implementation of very large queues on paged memory systems.
| Item Type: | Journal Article |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software |
| Journal or Publication Title: | JOURNAL OF THE ACM |
| Publisher: | ASSOC COMPUTING MACHINERY |
| ISSN: | 0004-5411 |
| Date: | January 1994 |
| Volume: | 41 |
| Number: | 1 |
| Number of Pages: | 28 |
| Page Range: | pp. 3-30 |
| Publication Status: | Published |
| URI: | http://wrap.warwick.ac.uk/id/eprint/20339 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
