A Java framework for massively distributed symbolic computing

We present a framework for implementing massively distributed applications in symbolic computing. Using this framework, computations with massive resource requirements can be distributed and processed in parallel on a network of workstations or on a large scale network such as the Internet. For each...

Full description

Saved in:
Bibliographic Details
Published in:Mathematics and computers in simulation 1999-08, Vol.49 (3), p.151-160
Main Author: Bernardin, Laurent
Format: Article
Language:English
Subjects:
Java
Massively distributed applications
Symbolic computing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a framework for implementing massively distributed applications in symbolic computing. Using this framework, computations with massive resource requirements can be distributed and processed in parallel on a network of workstations or on a large scale network such as the Internet. For each concrete application only minimal code is needed to complement the generic framework in order to enable large scale distributed processing of the application. Our framework introduces a “divide and be conquered” model for massively distributed computations. We compare this model to a more traditional one, in a symbolic computing setting. We stress the major problems and propose solutions for some of them.
ISSN:0378-4754
1872-7166
DOI:10.1016/S0378-4754(99)00048-8