On 2001.12.03, Andrew Piskorski <[EMAIL PROTECTED]> wrote: [ ... description of sharing data between threads snipped ... ] > > At any given time, I'll probably never have more than 10,000 or so > requests outstanding (probably less). Maximum throughput of requests > is rather harder to guess at, but I figure it's probably around 1-10 > per second max, probably closer to 1 than 10. > [...] > > So the question becomes, which in-memory AOLserver structures are most > appropriate for this task?
Store your data in NSV arrays. If you're asking for actual implementation examples in code, then provide a more detailed spec. for what you're trying to accomplish, and perhaps folks may contribute some code examples. Instead of storing data in ns_sets and using nsv arrays to track them, just store the data itself in nsv arrays. Once you get it working, if you need to make it work faster, then start thinking about ways you could improve on the simple design ... -- Dossy -- Dossy Shiobara mail: [EMAIL PROTECTED] Panoptic Computer Network web: http://www.panoptic.com/ "He realized the fastest way to change is to laugh at your own folly -- then you can let go and quickly move on." (p. 70)
