Distributed computing using Java: A comparison of two server designs

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.sysarc.2006.02.001 Byline: Boris Roussev (a), Jie Wu (b) Keywords: Networking; Distributed computing; Client-server; Concurrent programming; Java Abstract: This paper proposes a new concurrent data structure, called parallel hash table, for synchronizing the access of multiple threads to resources stored in a shared buffer. We prove theoretically the complexity of the operations and the upper limit on the thread conflict probability of the parallel hash table. To empirically evaluate the proposed concurrent data structure, we compare the performance of a TCP multi-threaded parallel hash table-based server to a conventional TCP multi-threaded shared buffer-based server implemented in Java. The experimental results on a network of 36 workstations running Windows NT, demonstrate that the parallel hash table-based server outperforms the conventional multi-threaded server. Author Affiliation: (a) Information Systems Department, University of the Virgin Islands, Box 10,000, Kingshill, VI 00850, US Virgin Islands (b) Computer Science and Engineering Department, Florida Atlantic University, Boca Raton, Fl 33431, USA Article History: Received 27 January 2003; Revised 15 February 2006; Accepted 16 February 2006