Name
Abstract | ||
|---|---|---|
A Transactional Agent (TA) is a mobile agent to manipulate objects with some type of commitment condition. For example, a transactional agent commits only if at least one object could be successfully manipulated in the at-least-one condition. Computers may stop by fault while networks are assumed to be reliable. In the Client-Server (CS) model, servers can be fault-tolerant according to traditional replication and checkpointing technologies. However, an application program cannot be performed if a client computer is faulty. An application program can be performed on another operational computer even if a computer is faulty in the transactional agent model. There are kinds of faulty computers for a transactional agent, current, destination, and sibling computers where a transactional agent now exist, will move, and has visited, respectively. We discuss how the transactional agent can be tolerant of the types of computer faults. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1504/IJWMC.2010.033059 | IJWMC |
Keywords | Field | DocType |
client computer,at-least-one condition,computer fault,sibling computer,transactional agent model,operational computer,mobile agent,faulty computer,application program,transactional agent,fault tolerance,distributed databases,distributed systems,multi agent systems | Client,Computer science,Mobile agent,Server,Computer network,Multi-agent system,Transactional memory,Fault tolerance,Distributed database,Transactional leadership,Distributed computing | Journal |
Volume | Issue | Citations |
4 | 2 | 11 |
PageRank | References | Authors |
0.66 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Youhei Tanaka | 1 | 40 | 6.23 |
| Tomoya Enokido | 2 | 1990 | 240.21 |
| Makoto Takizawa | 3 | 3180 | 440.50 |