Enhancement #540
Updated by S. Wrede over 12 years ago
Scope comparison proved to be still expensive, when profiling RSB in some examples. Strategy for implementation:
# Per-participant caching of Scope objects and referencing of this Scope object via shared pointers, e.g., in notifications. This is necessary as otherwise Event notifications that are kept longer than the lifetime of a participant
A suggestion would contain invalid references. The expectation is that after this change the caching operation will eventually be effective.
# Interning across differerent participants in the same process.
A further performance improvement could be to replace the stringbuffer construction cash a hash value of the Scope string with scope, which then can be used for a strcpy variant. more efficient 'less than' operation.
# Per-participant caching of Scope objects and referencing of this Scope object via shared pointers, e.g., in notifications. This is necessary as otherwise Event notifications that are kept longer than the lifetime of a participant
A suggestion would contain invalid references. The expectation is that after this change the caching operation will eventually be effective.
# Interning across differerent participants in the same process.
A further performance improvement could be to replace the stringbuffer construction cash a hash value of the Scope string with scope, which then can be used for a strcpy variant. more efficient 'less than' operation.