אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב
חן קאס שריר (הרצאה סמינריונית למגיסטר)
יום שלישי, 26.09.2023, 14:00
Determining the size of a concurrent data structure correctly and efficiently in the presence of concurrent modifications has turned out to be a surprisingly difficult task, one that has been absent from both research and practical applications until recently. In this work, we study three methodologies for concurrently computing a linearizable size, with the aim of improving performance. In our first approach, we employ the handshake methodology used by on-the-fly garbage collectors. In the second we use efficient locking mechanisms, while in the final methodology we use an an optimistic approach. Our study reveals that there is no one-size-fits-all solution for all scenarios. Consequently, we offer recommendations tailored to possible scenarios, guiding the selection of the most suitable method.