Identifying and breaking necessary constraints to web-based metacomputing
conference contribution
posted on 2017-12-06, 00:00authored byWei LiWei Li, Wai Keung Pun, M Zhang
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.
Funding
Category 1 - Australian Competitive Grants (this includes ARC, NHMRC)
History
Parent Title
COMPSAC 2004, Proceedings of the 28th Annual International Computer Software and Applications Conference.
Start Page
474
End Page
479
Number of Pages
6
Start Date
2004-01-01
ISBN-10
0769522092
Location
Hong Kong, Hong Kong
Publisher
Institute of Electrical and Electronics Engineers
Place of Publication
Los Alamitos, CA USA
Peer Reviewed
Yes
Open Access
No
External Author Affiliations
Faculty of Informatics and Communication; University of Wollongong;