katang Posted April 2, 2017 Report Posted April 2, 2017 Is there a searchable FIFO implementation around? I mean: my Producers send their product to the FIFO of the Consumer when they like. The Consumer, however, might have a preference: may want to consume products of certain Producers first, independently of their position in the FIFO. Quote
AmeyaVS Posted April 2, 2017 Report Posted April 2, 2017 Hello @katang, It would be better if you would provide more details on what you are trying to achieve some diagrams or sample code. Regards, Ameya Vikram Singh Quote
katang Posted April 2, 2017 Author Report Posted April 2, 2017 6 minutes ago, AmeyaVS said: Hello @katang, It would be better if you would provide more details on what you are trying to achieve some diagrams or sample code. Regards, Ameya Vikram Singh Do you mean something like http://csg.csail.mit.edu/6.175/archive/2014/tutorials/T05-ProgrammingSMIPS.pdf? starting with slide #21 Quote
AmeyaVS Posted April 2, 2017 Report Posted April 2, 2017 Hello @katang, I have just taken cursory look into it, I think you are confusing the sc_fifo implementation which is just a communication abstraction for use in SystemC. What I think you are looking at is a module based communication model. Have a look here for hierarchical channels: https://www.doulos.com/knowhow/systemc/tutorial/hierarchical_channels/ Let me know if this helps you. Regards, Ameya Vikram Singh Quote
katang Posted April 2, 2017 Author Report Posted April 2, 2017 Hello AmeyaVS, maybe you are right that if I replace FIFO with LIFO in the hierarchical channels, than I will be closer to the solution, but searching with a key the actual contents of a FIFO, and taking out the found element out-of-order, still remains my task., and that was I was looking for. Quote
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.
Note: Your post will require moderator approval before it will be visible.