𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Java for high-performance network-based computing: a survey

✍ Scribed by M. Lobosco; C. Amorim; O. Loques


Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
284 KB
Volume
14
Category
Article
ISSN
1532-0626

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Editorial: Java for high-performance net
✍ Fox, Geoffrey πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 21 KB πŸ‘ 2 views

## 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:

High-performance Java codes for computat
✍ Christopher J. Riley; Siddhartha Chatterjee; Rupak Biswas πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 460 KB

## Abstract The computational science community is reluctant to write large‐scale computationally‐intensive applications in Java due to concerns over Java's poor performance, despite the claimed software engineering advantages of its object‐oriented features. Naive Java implementations of numerical

DARP: Java-based data analysis and rapid
✍ Akarsu, Erol; Fox, Geoffrey; Haupt, Tomasz πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 161 KB πŸ‘ 2 views

The integration of a compiled and interpreted HPF gives us an opportunity to design a powerful application development environment targeted for high performance parallel and distributed systems. This Web based system follows a three-tier model. The Java front-end holds proxy objects which can be man

A benchmark suite for high performance J
✍ Bull, J. M. ;Smith, L. A. ;Westhead, M. D. ;Henty, D. S. ;Davey, R. A. πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 267 KB πŸ‘ 1 views
Performance issues for frontal schemes o
✍ K. A. Cliffe; I. S. Duff; J. A. Scott πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 150 KB πŸ‘ 2 views

We consider the implementation of a frontal code for the solution of large sparse unsymmetric linear systems on a high-performance computer where data must be in the cache before arithmetic operations can be performed on it. In particular, we show how we can modify the frontal solution algorithm to