Pattern for One-Entry-Multiple-Workers Problem

Hi,

I am looking for a pattern to solve the following problem within JavaSpaces:

- A Manager M writes Xi to the space.
- Each participating Worker Wj reads Xi and produces Xij.
- Each Wj should read a specific Xi only once.
- Xi is written to the space, but never taken/removed.

Where:
- i and j are arbitrary numbers.
- Xij is the result of an entry Xi processed by Worker Wj.
- the number of produced Xi and participating Wj is not known.
- the number of produced Xij is i x j.

As far as I understood, a read on the space returns an arbitrary,
matching entry, which (in worst case) always is the same entry. Is the
above problem solvable within JavaSpaces at all? Or would one need
JavaSpace05 to walk through all available matching entries and provide a
signature/marking/logging-mechanism to check for unprocessed entries?

Any help, suggestion, and reference is welcome.

Thanks,
Stefan

===========================================================================
To unsubscribe, send email to [email protected] and include in the body
of the message "signoff JAVASPACES-USERS".  For general help, send email to
[email protected] and include in the body of the message "help".

To view past JAVASPACES-USERS postings, please see:
http://archives.java.sun.com/archives/javaspaces-users.html

JDC members can download the JavaSpaces(tm) Technology from:
http://developer.java.sun.com/developer/products/jini/