Achieving good performance for dictionary machines; a scalable distributed data balancing technique

We address the problem of how to process utility commands in database applications while the system remains operational and the data remains available for concurrent accesses. In particular, we focus on the online reorganization of a dictionary, a database reduced to its simplest instance, showing its implementation on a multicomputer. As is the case with implementations of dynamic structures on distributed memory architectures, a crucial load balancing problem has to be solved. We propose an elegant solution and prove that it solves this problem. Experimental results are shown and analyzed