No / Grid computing is a computational concept based on an infrastructure that integrates and collaborates the use of high end computers, networks, databases and scientific instruments owned and managed by several organisations. It involves large amounts of data and computing which require secure and reliable resource sharing across organisational domains. Despite its high computing performance orientation, communication delays between grid computing nodes is a big hurdle due to geographical separation in a realistic grid computing environment. Communication schemes such as broadcasting, multicasting and routing should, therefore, take communication delay into consideration. Such communication schemes in a grid computing environment pose a great challenge due to the arbitrary nature of its topology. In this context, a heuristic algorithm for multicast communication is proposed for grid computing networks with finite capacity and bursty background traffic. The scheme facilitates inter-node communication for grid computing networks and it is applicable to a single-port mode of message passing communication. The scheme utilises a queue-by-queue decomposition algorithm for arbitrary open queueing network models, based on the principle of maximum entropy, in conjunction with an information theoretic decomposition criterion and graph theoretic concepts. Evidence based on empirical studies indicates the suitability of the scheme for achieving an optimal multicast communication cost, subject to system decomposition constraints.
| Identifer | oai:union.ndltd.org:BRADFORD/oai:bradscholars.brad.ac.uk:10454/3144 |
| Date | January 2003 |
| Creators | Kouvatsos, Demetres D., Mkwawa, I.M. |
| Source Sets | Bradford Scholars |
| Language | English |
| Detected Language | English |
| Type | Article, No full-text available in the repository |
Page generated in 0.0024 seconds