Walter Bauer is one of the censhare AG founders and is a passionate software designer and engineer with a bee in his bonnet about performance optimization and refactoring.
In the last post
I introduced a data structure and algorithm to implement a concurrent memory efficient long set and long-to-long map. The long set can be regarded as some kind of compressed bitset. This post focuses on adding the classic bitset operations for union (or), intersection (and) and difference (and-not).
Persistent data structures got a boost because using locks for synchronizing access to data proved to be error prone and cumbersome. We are not talking about database persistence here, but instead about immutable data structures that provide a type of copy-on-write semantics to allow for concurrent reads while performing concurrent data updates (see http://en.wikipedia.org/wiki/Persistent_data_structure
and http://de.wikipedia.org/wiki/Copy-On-Write
).
In client-server applications there's often the need to transfer files between both parties. This blog shows how to implement a file transfer using remote capable input and output streams and how to improve the performance in WAN scenarios where network connections even with good bandwidth still suffer from high latency.
This website uses cookies and third party tracking tools to provide technical functionality, improve the user experience and help us optimizing the website for our users.
Find out more in our Privacy Policy