Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A recursive and fast construction of an  n  elements priority queue from exponentially smaller hardware priority queues and size  n  RAM is presented. All priority queue implementations to date either require  O  (log  n ) instructions per operation or exponential (with key size) space or expensive special hardware whose cost and latency dramatically increases with the priority queue size. Hence constructing a priority queue (PQ) from considerably smaller hardware priority queues (which are also much faster) while maintaining the  O (1) steps per PQ operation is critical. Here  present such an acceleration technique called the Por Priority Queue (PPQ) technique. Specifically, an  n  elements PPQ is constructed from 2 k -1 primitive priority queues of size  k √ n  ( k =2,3,...) and a RAM of size  n , where the throughput of the construct beats that of a single, size  n  primitive hardware priority queue. For example an  n  elements PQ can be constructed from either three √ n  or five 3√ n  primitive H/W priority queues.   Applying our technique to a TCAM based priority queue, results in TCAM-PPQ, a scalable perfect line rate fair queuing of millions of concurrent connections at speeds of 100 Gbps. This demonstrates the benefits of our scheme when used with hardware TCAM,  expect similar results with systolic arrays, shift-registers and similar technologies.   As a by product of our technique  present an  O ( n ) time sorting algorithm in a system equipped with a  O ( w √ n ) entries TCAM, where here  n  is the number of items, and w is the maximum number of bits required to represent an item, improving on a previous result that used an Ω( n ) entries TCAM. Finally,  provide a lor bound on the time complexity of sorting  n  elements with TCAM of size  O ( n ) that matches our TCAM based sorting algorithm.
['Yehuda Afek', 'Anat Bremler-Barr', 'Liron Schiff']
I am writing a research paper on a idea Recursive design of hardware priority queues
[{"from": "human", "value": "I am writing a research paper on a idea Recursive design of hardware priority queues"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A recursive and fast construction of an  n  elements priority queue from exponentially smaller hardware priority queues and size  n  RAM is presented. All priority queue implementations to date either require  O  (log  n ) instructions per operation or exponential (with key size) space or expensive special hardware whose cost and latency dramatically increases with the priority queue size. Hence constructing a priority queue (PQ) from considerably smaller hardware priority queues (which are also much faster) while maintaining the  O (1) steps per PQ operation is critical. Here  present such an acceleration technique called the Por Priority Queue (PPQ) technique. Specifically, an  n  elements PPQ is constructed from 2 k -1 primitive priority queues of size  k \u221a n  ( k =2,3,...) and a RAM of size  n , where the throughput of the construct beats that of a single, size  n  primitive hardware priority queue. For example an  n  elements PQ can be constructed from either three \u221a n  or five 3\u221a n  primitive H/W priority queues.   Applying our technique to a TCAM based priority queue, results in TCAM-PPQ, a scalable perfect line rate fair queuing of millions of concurrent connections at speeds of 100 Gbps. This demonstrates the benefits of our scheme when used with hardware TCAM,  expect similar results with systolic arrays, shift-registers and similar technologies.   As a by product of our technique  present an  O ( n ) time sorting algorithm in a system equipped with a  O ( w \u221a n ) entries TCAM, where here  n  is the number of items, and w is the maximum number of bits required to represent an item, improving on a previous result that used an \u03a9( n ) entries TCAM. Finally,  provide a lor bound on the time complexity of sorting  n  elements with TCAM of size  O ( n ) that matches our TCAM based sorting algorithm."}]