On Mon, 12 Jun 2017 13:53:23 -0400, Tony Harminc wrote: > >> Name-token services does something related. I understand it performs >> no costly locking during searches, but tests a flag after a search to >> detect that the data structure has been modified in-progress, and >> re-drive the search, with less expected cost than locking for every search. >> >I've been waiting for IBM to convert this to use Transactional Execution. >Well for all I know perhaps they have. > What performance cost does TE incur (there must be some)? It's possible that the existing cleverly recherché design, optimized for searches rather than updates is better. If it ain't broke ...
Of course, the update process is so designed that an unserialized search never risks following an invalid pointer nor falling into an endless loop. -- gil ---------------------------------------------------------------------- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
