Computational models for web- and grid-based computation

Abstract

Two models of web- and grid-based computing are proposed. Both models are underpinned by the notion of computing with "approximate" data values. The models utilise an asynchronous form of communication which blocks neither sender nor receiver. The idea of computing with approximate data is illustrated using a number of examples including a client server web computation and a partial eigensystem co-algorithm. The results of some preliminary experiments showing the feasibility of the approach for computing partial eigensolutions are presented. © Springer-Verlag 2003.