Concurrent Data Structures

JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.

If requesting a lock is very expensive, how would you implement a linked list set

Coarse Grained Synchronization

Fine Grained Synchronization

Optimistic Synchronization

Lazy Synchronization

Lock Free Synchronization

What properties do (good) hash functions have? List as many as you can!

Map variable sized items to constant sized hashes

Are fast to compute

Non-uniformly distribute their input items

Collisons are rare

How would you implement a hash map supporting inserting multiple values per key?

Implement a list within each bucket

Implement a search tree within each bucket

Implement another level of hash table within each bucket

Any another search data structure would also do

Which of the implementations for a list-based set is FIFO fair?

Coarse Grained Synchronization

Fine Grained Synchronization

Optimistic Synchronization

Lazy Synchronization

Lock-free Synchronization

Submit

Clear form

This content is neither created nor endorsed by Google. Report Abuse - Terms of Service - Privacy Policy