Abstract: Parallel computation has been an essential component of scientic computing for decades.Traditionally,when one thinks of parallelization,one often envisions fine-grained parallelization.Recently,however,there is an increasing demand for efficient mecha-nisms of carrying out computations which exhibit coarse-grained parallelism.Examples of this class of problems include throughput computations,where numerous similar but independent tasks are performed to solve a large problem,or any solution which relies on ensemble averages,where a simulation is run under a variety of initial conditions which are then combined to form the result.This paper presents a framework for these types of computations.The framework in this paper utilized the JXTA open peer-to-peer com-munication protocols,which allow for the dynamic aspect of the grid through peer discovery,in addition to the scalability aspect through the use of peer groups.
Publication Year: 2008
Publication Date: 2008-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot