9:24:21beachIn most copying collectors, promotion is a result of surviving a nursery collection, but then there is a certain probability that newly allocated objects will be promoted, even though it is very likely that they will die young.
9:25:27Shinmerabeach: I don't see how you can do an array size increase with just a CAS. What about the case where one thread is in the process of copying the array to increase its size, but then another comes in and sets an element in the old array?
9:26:07beachShinmera: I can't correct incorrect programming. All I can do is to make it thread sae.
9:27:33ShinmeraThere are techniques for lock-free adjustable vectors. Part of that is needed for a lock-free hash table that I was working on implementing at one point (before I got distracted)
9:28:12beachYes, I recall reading about lock-free hash tables.
16:04:16shka_Shinmera: how did you wanted to implement lockless hashtable?
16:07:56beachshka_: Are you asking which one of the existing published strategies he is planning to use?