That sounds cool
What about storing the tree in a Berkeley DB? Serialize each object with Storable, then load a DB wrapper into each thread and use Berkeley DB concurrent data store feature. Maybe a materialized path, like SNMP, for the data store keys each representing a device? Maybe a record to record the path to a change as events come in? Or a thread queue for each event?
Just a thought.
In reply to Re: Multithreaded (or similar) access to a complex data structure
by Sigil
in thread Multithreaded (or similar) access to a complex data structure
by FloydATC
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |