A Fault-Tolerance Framework for Jaca-Based Distributed Computing System
碩士 === 大同大學 === 資訊工程研究所 === 89 === With advances in widespread networking, public WWW environment, and platform-independent Java bytecode, millions of Java-capable computers can be connected for sharing computing ability now. These heterogeneous supercomputers, workstations, personal comp...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2001
|
Online Access: | http://ndltd.ncl.edu.tw/handle/45561815753397525942 |
id |
ndltd-TW-089TTU00392020 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-089TTU003920202015-10-13T12:14:42Z http://ndltd.ncl.edu.tw/handle/45561815753397525942 A Fault-Tolerance Framework for Jaca-Based Distributed Computing System 以爪哇為基礎之分散式計算系統上的容錯架構 Chih-Lan Yang 楊志郎 碩士 大同大學 資訊工程研究所 89 With advances in widespread networking, public WWW environment, and platform-independent Java bytecode, millions of Java-capable computers can be connected for sharing computing ability now. These heterogeneous supercomputers, workstations, personal computers, and laptops, can be merged as a pool of distributed Java virtual machines and exploit their large number of computing cycles for CPU-intensive applications. In order to provide a robust distributed environment, a Fault-Tolerance Framework for Java-Based Distributed Computing System (FJDCS) has been proposed in this thesis. The most important advantage of our system is providing an enhanced and configurable fault-tolerance mechanism to all of legacy Java applications. In the very unreliable networking environment like public computing pool, the RMI mechanism still lacks a robust fault-tolerance mechanism to ensure that every computation can be completed in an iteration. We extended the RMI API and combined the replication mechanism that can be categorized to active replication mechanism to build our FJDCS API. Programmers can just extend our API directly and do not need to modify their legacy applications to get our robust fault-tolerance mechanism. In most cases, an application is completed by many cooperated tasks. In the proposed system, we replicate every task by two or more instances and dispatch them to the different computing nodes concurrently. When one of the computing nodes that process the instances of the same task has completed its operation, this task is completed. In the very unreliable network, we can configure the number of clones for one task to ensure that at least one computing node can complete this task. Liang-Teh Lee 李良德 2001 學位論文 ; thesis 33 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 大同大學 === 資訊工程研究所 === 89 === With advances in widespread networking, public WWW environment, and platform-independent Java bytecode, millions of Java-capable computers can be connected for sharing computing ability now. These heterogeneous supercomputers, workstations, personal computers, and laptops, can be merged as a pool of distributed Java virtual machines and exploit their large number of computing cycles for CPU-intensive applications. In order to provide a robust distributed environment, a Fault-Tolerance Framework for Java-Based Distributed Computing System (FJDCS) has been proposed in this thesis. The most important advantage of our system is providing an enhanced and configurable fault-tolerance mechanism to all of legacy Java applications. In the very unreliable networking environment like public computing pool, the RMI mechanism still lacks a robust fault-tolerance mechanism to ensure that every computation can be completed in an iteration. We extended the RMI API and combined the replication mechanism that can be categorized to active replication mechanism to build our FJDCS API. Programmers can just extend our API directly and do not need to modify their legacy applications to get our robust fault-tolerance mechanism. In most cases, an application is completed by many cooperated tasks. In the proposed system, we replicate every task by two or more instances and dispatch them to the different computing nodes concurrently. When one of the computing nodes that process the instances of the same task has completed its operation, this task is completed. In the very unreliable network, we can configure the number of clones for one task to ensure that at least one computing node can complete this task.
|
author2 |
Liang-Teh Lee |
author_facet |
Liang-Teh Lee Chih-Lan Yang 楊志郎 |
author |
Chih-Lan Yang 楊志郎 |
spellingShingle |
Chih-Lan Yang 楊志郎 A Fault-Tolerance Framework for Jaca-Based Distributed Computing System |
author_sort |
Chih-Lan Yang |
title |
A Fault-Tolerance Framework for Jaca-Based Distributed Computing System |
title_short |
A Fault-Tolerance Framework for Jaca-Based Distributed Computing System |
title_full |
A Fault-Tolerance Framework for Jaca-Based Distributed Computing System |
title_fullStr |
A Fault-Tolerance Framework for Jaca-Based Distributed Computing System |
title_full_unstemmed |
A Fault-Tolerance Framework for Jaca-Based Distributed Computing System |
title_sort |
fault-tolerance framework for jaca-based distributed computing system |
publishDate |
2001 |
url |
http://ndltd.ncl.edu.tw/handle/45561815753397525942 |
work_keys_str_mv |
AT chihlanyang afaulttoleranceframeworkforjacabaseddistributedcomputingsystem AT yángzhìláng afaulttoleranceframeworkforjacabaseddistributedcomputingsystem AT chihlanyang yǐzhǎowawèijīchǔzhīfēnsànshìjìsuànxìtǒngshàngderóngcuòjiàgòu AT yángzhìláng yǐzhǎowawèijīchǔzhīfēnsànshìjìsuànxìtǒngshàngderóngcuòjiàgòu AT chihlanyang faulttoleranceframeworkforjacabaseddistributedcomputingsystem AT yángzhìláng faulttoleranceframeworkforjacabaseddistributedcomputingsystem |
_version_ |
1716855272466546688 |