Learn More
A new approach is proposed for the design of perfect hash functions. The algorithms developed can be effectively applied to key sets of large size. The basic ideas employed in the construction are rehash and segmentation. Analytic results are given which are applicable when problem sizes are small. Extensive experiments have been performed to test the(More)
Generally, tasks in a distributed system, such as two-phase commitment in database system, the location of a replicated file, and a landing task controlled by a flight path finding system, must reach an agreement. This type of unanimity problems is called the agreement problem and one of the most fundamental problems in the field of distributed environment.(More)
  • 1