Identifying and Breaking Necessary Constraints to Web-Based Metacomputing

  • Authors:
  • Wei Li;W. K. Daniel Pun;Minjie Zhang

  • Affiliations:
  • Central Queensland University;Central Queensland University;University of Wollongong

  • Venue:
  • COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Metacomputing aims at using the computing power of computers linked by networks for various applications, which used to be tackled by dedicated supercomputers a few years ago. Web-based metacomputing offers a cheap and efficient solution for parallel and distributed computing by exploiting idle cycles from the Internet. Research literatures have been published to report the state of the art of metacomputing by addressing the developed prototypes 驴 architecture, support methodologies and technologies, programming APIs, example benchmarks and experimental performances. This paper tries to answer the question: why the metacomputing system is undesirable in performance, applicability and reliability. In this paper, the systemýs components are modelled as three roles: Client, Worker and Manager. Their performances are individually investigated in terms of the Theory of Constraint: Objectives, Requirements, Prerequisites, Conflicts and Injections for identifying core problems and exploring efficient solutions. The main contribution of this paper is to be a very first literature as conceptual guidelines for design and optimisation of metacomputing systems.