By Topic

Distributed P2P computing within Triana: a galaxy visualization test case

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
I. Taylor ; Dept. of Comput. Sci., Cardiff Univ., UK ; M. Shields ; I. Wang

We discuss here a parallel implementation of the visualisation of data from a galaxy formation simulation within the Triana problem-solving environment. The visualisation is a test case for our prototype Triana Grid software using a decentralized peer-to-peer approach. The Triana distributed environment is middleware independent and designed in such a way as to make it easily extensible by users of the system. This novel approach is usable both within a peer-to-peer framework, using JXTA, and within service oriented architectures, such as OGSA, by the use of a Grid application toolkit (GAT) interface. Furthermore, Triana has a pluggable architecture that allows the middleware independent representations of distributed task-graphs to be written in several popular formats. This facilitates the use of the mechanism within other disparate systems. Galaxy-formation simulation codes generate data that represent a series of particles in three dimensions and their associate properties as snapshots in time. An important aspect of these types of calculation is the visualization of time sequence data. The user of the code would like to visualize this data as an animation in two dimensions with the ability to vary the point of view, project that particular two dimensional slice and re-run the animation. The recalculation of the projection can be computed in parallel resulting in a considerable speedup.

Published in:

Parallel and Distributed Processing Symposium, 2003. Proceedings. International

Date of Conference:

22-26 April 2003