by Lau Wai Kwong. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 99-102). / Abstract --- p.ii / Acknowledgements --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Limitations of the Mobile Computing Environments --- p.2 / Chapter 1.2 --- Applications of Transaction Replication in Mobile Environments --- p.5 / Chapter 1.3 --- Motivation for Transaction Replication in Mobile Environments --- p.5 / Chapter 1.4 --- Major Simulation Results --- p.6 / Chapter 1.5 --- Roadmap to the Thesis --- p.7 / Chapter 2 --- Previous and Related Research --- p.8 / Chapter 2.1 --- File Systems --- p.8 / Chapter 2.1.1 --- Management of Replicated Files --- p.8 / Chapter 2.1.2 --- Disconnected Operations --- p.10 / Chapter 2.2 --- Database Management --- p.12 / Chapter 2.2.1 --- Data Replication Schemes --- p.12 / Chapter 2.2.2 --- Cache Invalidation and Query Processing --- p.15 / Chapter 2.2.3 --- Transaction Management in Mobile Environments --- p.17 / Chapter 3 --- System Model and Assumptions --- p.21 / Chapter 3.1 --- System Architecture --- p.21 / Chapter 3.2 --- Transaction and Data Model --- p.23 / Chapter 3.3 --- One-copy Serializability --- p.25 / Chapter 3.4 --- Assumptions --- p.27 / Chapter 4 --- Transaction Replication in a Mobile Environment --- p.29 / Chapter 4.1 --- Read-only Public Transactions --- p.30 / Chapter 4.1.1 --- Data Broadcasting --- p.31 / Chapter 4.1.2 --- Cache Update --- p.33 / Chapter 4.1.3 --- Cache Miss --- p.36 / Chapter 4.1.4 --- Execution of Read-only Public Transactions --- p.37 / Chapter 4.2 --- R/W Public Transactions --- p.39 / Chapter 4.3 --- Correctness Argument --- p.41 / Chapter 4.3.1 --- Correctness Proof --- p.43 / Chapter 4.4 --- Extension to Support Partition Failures --- p.47 / Chapter 5 --- Design and Implementation of the Simulation --- p.49 / Chapter 5.1 --- CSIM Language --- p.49 / Chapter 5.2 --- Simulation Components --- p.50 / Chapter 5.2.1 --- Fixed Network --- p.50 / Chapter 5.2.2 --- Mobile Host --- p.50 / Chapter 5.2.3 --- Wireless Channel --- p.51 / Chapter 5.2.4 --- Database and Transactions --- p.52 / Chapter 5.3 --- A Lock-based Scheme --- p.53 / Chapter 5.4 --- Graphing ...........、 --- p.54 / Chapter 6 --- Results and Analysis --- p.55 / Chapter 6.1 --- Results Dissection --- p.55 / Chapter 6.2 --- Performance of the Scheme --- p.56 / Chapter 6.2.1 --- Parameters Setting --- p.56 / Chapter 6.2.2 --- Experiments and Results --- p.59 / Chapter 6.3 --- Comparison with the Lock-based Scheme --- p.78 / Chapter 6.3.1 --- Parameters Setting --- p.79 / Chapter 6.3.2 --- Experiments and Results --- p.80 / Chapter 7 --- Conclusions and Future Work --- p.93 / Chapter 7.1 --- Conclusions --- p.93 / Chapter 7.2 --- Future Work --- p.94 / Chapter A --- Implementation Details --- p.96 / Bibliography --- p.99

Bibliography: p. 281-289. Electronic publication; Full text available in PDF format; abstract in HTML format. Electronic reproduction.[Australia] :Australian Digital Theses Program,2001.

Thesis (Ph. D.)--School of Computing and Engineering. University of Missouri--Kansas City, 2006. / "A dissertation in computer science and informatics and telecommunications and computer networking." Advisor: Vijay Kumar. Typescript. Vita. Title from "catalog record" of the print edition Description based on contents viewed Nov. 9, 2007. Includes bibliographical references (leaves 152-157). Online version of the print edition.

Thesis (Ph.D.) -- University of Adelaide, Dept. of Computer Science, 1999. / Bibliography: p. 281-289. Also available electronically.

Thesis (Ph.D.) -- University of Adelaide, Dept. of Computer Science, 1999. / Bibliography: p. 281-289. Also available in print form.

Thesis (M.Phil.)--City University of Hong Kong, 2005. / "Submitted to Department of Computer Science in partial fulfillment of the requirements for the degree of Master of Philosophy" Includes bibliographical references (leaves 98-102)

Thesis (Ph.D.)--University of Melbourne, Dept. of Computer Science and Software Engineering, 2009. / Typescript. Includes bibliographical references (p. 179-198)

by Ching-Ting, Ng. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 79-82). / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Background --- p.5 / Chapter 2.1 --- Protocols tackling site failure --- p.5 / Chapter 2.2 --- Protocols tackling Partition Failure --- p.6 / Chapter 2.2.1 --- Primary site --- p.6 / Chapter 2.2.2 --- Quorum Consensus Protocol --- p.7 / Chapter 2.2.3 --- Missing Writes --- p.10 / Chapter 2.2.4 --- Virtual Partition Protocol --- p.11 / Chapter 2.3 --- Protocols to enhance the Performance of Updating --- p.11 / Chapter 2.3.1 --- Independent Updates and Incremental Agreement in Replicated Databases --- p.12 / Chapter 2.3.2 --- A Transaction Replication Scheme for a Replicated Database with Node Autonomy --- p.13 / Chapter 3 --- Transaction Replication Scheme --- p.17 / Chapter 3.1 --- A TRS for a Replicated Database with Node Autonomy --- p.17 / Chapter 3.1.1 --- Example --- p.17 / Chapter 3.1.2 --- Problem --- p.18 / Chapter 3.1.3 --- Network Model --- p.18 / Chapter 3.1.4 --- Transaction and Data Model --- p.19 / Chapter 3.1.5 --- Histories and One-Copy Serializability --- p.20 / Chapter 3.1.6 --- Transaction Broadcasting Scheme --- p.21 / Chapter 3.1.7 --- Local Transactions --- p.22 / Chapter 3.1.8 --- Public Transactions --- p.23 / Chapter 3.1.9 --- A Conservative Timestamping Algorithm --- p.24 / Chapter 3.1.10 --- Decentralized Two-Phase Commit --- p.25 / Chapter 3.1.11 --- Partition Failures --- p.27 / Chapter 4 --- Simulation Model --- p.29 / Chapter 4.1 --- Simulation Model --- p.29 / Chapter 4.1.1 --- Model Design --- p.29 / Chapter 4.2 --- Implement at ion --- p.37 / Chapter 4.2.1 --- Simulation --- p.37 / Chapter 4.2.2 --- Simulation Language --- p.37 / Chapter 5 --- Performance Results and Analysis --- p.39 / Chapter 5.1 --- Simulation Results and Data Analysis --- p.39 / Chapter 5.1.1 --- Experiment 1 : Variation of TRS Period --- p.44 / Chapter 5.1.2 --- Experiment 2 : Variation of Clock Synchronization --- p.47 / Chapter 5.1.3 --- Experiment 3 : Variation of Ratio of Local to Public Transaction --- p.49 / Chapter 5.1.4 --- Experiment 4 : Variation of Number of Operations --- p.51 / Chapter 5.1.5 --- Experiment 5 : Variation of Message Transmit Delay --- p.55 / Chapter 5.1.6 --- Experiment 6 : Variation of the Interarrival Time of Transactions --- p.58 / Chapter 5.1.7 --- Experiment 7 : Variation of Operation CPU cost --- p.61 / Chapter 5.1.8 --- Experiment 8 : Variation of Disk I/O time --- p.64 / Chapter 5.1.9 --- Experiment 9 : Variation of Cache Hit Ratio --- p.66 / Chapter 5.1.10 --- Experiment 10 : Variation of Number of Data Access --- p.68 / Chapter 5.1.11 --- Experiment 11 : Variation of Read Operation Ratio --- p.70 / Chapter 5.1.12 --- Experiment 12 : Variation of One Site Failed --- p.72 / Chapter 5.1.13 --- Experiment 13 : Variation of Sites Available --- p.74 / Chapter 6 --- Conclusion --- p.77 / Bibliography --- p.79 / Chapter A --- Implementation --- p.83 / Chapter A.1 --- Assumptions of System Model --- p.83 / Chapter A.1.1 --- Program Description --- p.83 / Chapter A.1.2 --- TRS System --- p.85 / Chapter A. 1.3 --- Common Functional Modules for Majority Quorum and Tree Quo- rum Protocol --- p.88 / Chapter A.1.4 --- Majority Quorum Consensus Protocol --- p.90 / Chapter A. 1.5 --- Tree Quorum Protocol --- p.91

Advances in wireless networking technology have engendered a new paradigm of computing, called mobile computing; in which users carrying portable devices have access to a shared infrastructure independent of their physical location. Mobile computing has matured rapidly as a field of computer science. In environments of mobile computing, the mobility and disconnection of portable computing devices introduce many new challenging problems that have never been encountered in conventional computer networks. New research issues combine different areas of computer science: networking, operating systems, data and knowledge management, and databases. This thesis studies data and knowledge transaction in mobile environments. To study transaction processing at the fundamental and theoretical level in mobile environments, a range of classical notions and protocols of transaction processing are rechecked and redefined in this thesis, and form the foundation for studying transaction processing in mobile environments. A criterion for mobile serial history is given and two new concurrency theorems are proved in mobile environments. In addition to data transaction, this thesis explores knowledge transaction in mobile environments. To study knowledge transaction in mobile environments this thesis presents and formalizes a knowledge transaction language and model for use in mobile computing environments. The thesis further formalizes a framework/model for a mobile logic programming multi-agent system which can be used to study knowledge transaction in multi-agent systems in mobile environments and is a very early effort towards a formal study of knowledge base and intelligent agents in mobile environments. This work provides a foundation for the formal specification and development of real-world mobile software systems, in the same way as traditional software systems have developed. / Doctor of Philosophy (PhD) (Science)

Batch processing is a means of improving the efficiency of transaction processing systems. Despite the maturity of this field, there is no rigorous theory that can assist in the design of batch systems. This thesis proposes such a theory, and shows that it is practical to use it to automate system design. This has important consequences; the main impediment to the wider use of batch systems is the high cost of their development and intenance. The theory is developed twice: informally, in a way that can be used by a systems analyst, and formally, as a result of which a computer program has been developed to prove the feasibility of automated design. Two important concepts are identified, which can aid in the decomposition of any system: 'separability', and 'independence'. Separability is the property that allows processes to be joined together by pipelines or similar topologies. Independence is the property that allows elements of a large set to be accessed and updated independently of one another. Traditional batch processing technology exploits independence when it uses sequential access in preference to random access. It is shown how the same property allows parallel access, resulting in speed gains limited only by the number of processors. This is a useful development that should assist in the design of very high throughput transaction processing systems. Systems are specified procedurally by describing an ideal system, which generates output and updates its internal state immediately following each input event. The derived systems have the same external behaviour as the ideal system except that their outputs and internal states lag those of the ideal system arbitrarily. Indeed, their state variables may have different delays, and the systems as whole may never be in consistent state. A 'state dependency graph' is derived from a static analysis of a specification. The reduced graph of its strongly-connected components defines a canonical process network from which all possible implementations of the system can be derived by composition. From these it is possible to choose the one that minimises any imposed cost function. Although, in general, choosing the optimum design proves to be an NP-complete problem, it is shown that heuristics can find it quickly in practical cases. / Thesis (Ph.D.)--Mathematical and Computer Sciences (Department of Computer Science), 1999.