Systolic priority queue The systolic binary tree data structure, described at the end of Section 8.2 and depicted in Fig. 8.3, can perform insert, extractmin, extractmax, and extractmed operations at...


Systolic priority queue


The systolic binary tree data structure, described at the end of Section 8.2 and depicted in Fig. 8.3, can perform insert, extractmin, extractmax, and extractmed operations at the rate of one per clock cycle.


 a. Describe the insertion algorithm in detail.


b. Describe algorithms for the three extract operations in detail. Make sure that extractmin and extractmax lead to equal elements being output in FIFO order.


c. Describe a simplified version of the data structure, and its associated algorithms, if we only need to extract the smallest or largest value (median extraction is not needed).


d. A simple priority queue only needs the insert and extractmin operations. Can we further simplify the data structure and algorithms of part (c) in this case?



Jan 01, 2022
SOLUTION.PDF

Get Answer To This Question

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here