## Java for High-performance Network Computing This is the proceedings of the third of a set of workshops studying the use of Java in large scale computations. The previous meetings were at Syracuse (December, 1996 -see Concurrency:
An infrastructure for network computing with Java applets
โ Scribed by Baratloo, Arash; Karaul, Mehmet; Karl, Holger; Kedem, Zvi M.
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 131 KB
- Volume
- 10
- Category
- Article
- ISSN
- 1040-3108
No coin nor oath required. For personal study only.
โฆ Synopsis
Java, in combination with Web browsers' abilities to load and execute untrusted Java applets in a secure fashion, has made computing over the Web a possibility. Now the challenge is to fully utilize this potential, given the limitations imposed by browsers. This paper presents KnittingFactory, an infrastructure to facilitate Web-based computing, which addresses this challenge. It supports building distributed applications, specifically those consisting of Java applets executing in browsers. It is composed of: (i) a distributed name service to assist users in locating other participants of a distributed computation via standard browsers; (ii) an embedded class server to eliminate the need for external HTTP servers for serving applet code; and (iii) a technique for direct applet-to-applet communication.
In this paper, we describe the design and implementation of KnittingFactory and demonstrate its benefits by applying it to three distinct areas of Web-based computing. First, we apply our distributed name service to a client/server architecture to enable RMI clients to locate servers on unknown hosts. Second, we use the embedded class server to extend the capability of Charlotte, a parallel computing environment. Finally, we build a collaborative application using our direct applet-to-applet communication technique which does not require a forwarding agent.
๐ SIMILAR VOLUMES
Project Bayanihan seeks to develop the idea of volunteer computing, which allows people to very easily pool together their computers' processing power and co-operate in solving parallel problems. While the idea of volunteer computing offers many exciting new prospects in global supercomputing and co
The developments in compressed digital video technology are paving the way for video-based services. Provision of such services requires a broadband communications network, which should extend into the customers' premises up to the terminals. This indicates a growing need for a customer premises net
Given a tree network with n vertices where each edge has an operational probability, we are interested in finding a vertex on the tree whose expected number of reachable vertices is maximum. This problem was studied in Networks 27 (1996) 219-237, where an O(n 3 ) time algorithm and an O(n 2 ) time a