Open Access

Downloads

Download data is not yet available.

Abstract

Solving problems that require time constraints in widely distributed heterogeneous environments such as the Grid is a challenge. We address this challenge by providing: a parallelization scheme to express the conceptual parallelism; POP-C++-a requirement-driven parallel object toolkit; and an object-oriented framework that implements the skeleton of the parallelization scheme using POP-C++. The framework allows users to automatically instantiate a suitable grain of parallelism based on the availability of heterogeneous resources so that the time constraint is satisfied. Users only need to describe their own problem by deriving new "problem" classes in each decomposition and implementing the way the problem is solved. An emulated heterogeneous environment has been built up with 130 machines of Linux/Pentium 4 and Solaris/Sparc. Tests measuring the real computing time compared to the required time have been implemented using our framework and run on the emulated heterogeneous environment. The results show the ability of the framework to exploit high performance with different level of parallelism to guarantee the time constraints.



Author's Affiliation
Article Details

Issue: Vol 10 No 13 (2007)
Page No.: 42-51
Published: Dec 31, 2007
Section: Article
DOI: https://doi.org/10.32508/stdj.v10i13.2863

 Copyright Info

Creative Commons License

Copyright: The Authors. This is an open access article distributed under the terms of the Creative Commons Attribution License CC-BY 4.0., which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

 How to Cite
Anh, N. (2007). SOLVING TIME CONSTRAINED PROBLEMS ON THE GRID. Science and Technology Development Journal, 10(13), 42-51. https://doi.org/https://doi.org/10.32508/stdj.v10i13.2863

 Cited by



Article level Metrics by Paperbuzz/Impactstory
Article level Metrics by Altmetrics

 Article Statistics
HTML = 887 times
Download PDF   = 360 times
Total   = 360 times

Most read articles by the same author(s)