[DP-03] Improve efficiency of message matching #43

Open
edsko opened this Issue Oct 15, 2012 · 3 comments

Comments

Projects
None yet
3 participants
Owner

edsko commented Oct 15, 2012

[Imported from JIRA. Reported by Edsko de Vries @edsko) as DP-3 on 2012-10-15 09:20:36]

In particular, storing messages by type could be very beneficial.

Owner

hyperthunk commented Jan 7, 2013

So would we store the accepted mailbox as Map Fingerprint (StrictList a) or some such? Is Map the right data structure for this or donee want a strict version?

Owner

edsko commented Jan 7, 2013

You have to be very careful here: you still need to guarantee ordering. If a process does a receiveWait for type A or type B then we need to make sure that if a message of either type exists they are delivered in the order that they were received.

Owner

hyperthunk commented Jan 7, 2013

You have to be very careful here: you still need to guarantee ordering.

Yes of course, I was jumping ahead without thinking there. I suspect then, some kind of custom data structure that maintains the priority property but supports searching/inserting by key. Ralf Hinze et al present a Priority Search Queue which IIRC was used (or adapted) in the GHC IO manager, so perhaps we can take some inspiration from there. The primary difference is that we want to select by a range of keys and then order by priority.

qnikst changed the title from Improve efficiency of message matching to [DP-03] Improve efficiency of message matching Jun 18, 2015

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment