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

No description available.

We have developed a new cluster parallel graphics architecture that improves upon prior cluster parallel graphics systems for high performance supergraphics – the Vortex deferred sort-last parallel graphics architecture based on global Zspace paradigm. The new architecture bypasses limitations of screen-space based parallelization paradigms, solves known Z-space parallelization inefficiencies and problems. Vortex addresses the lack of global Z buffer awareness between GPUs and prevents artifacts in globally order-dependent blending on multiple GPUs. The new paradigm allows for full 1-1 process-GPU coupling with minimal interprocess and inter-GPU communications. This allows for maximal input bandwidth, maximal GPU utilization levels, near optimal load balances, and improved efficiency when scaled to larger configurations. The Vortex architecture introduces the new deferred sort-blend approach for preventing visual artefacts in globally order-dependent fragment blends. All blend fragments are buffered in an external sort-blend subsystem until the end of rendering, when they are Z-culled, sorted and blended into the final frame. The new approach allows for efficient automatic order-independent blending and results in frames without any global blending artifacts The new architecture gives us the ability to fully harness the processing power of state of art GPUs, and at the same time it offers a much easier parallelization paradigm to programmers, compared to existing screen-space CPGS parallelization paradigms. / Doctor of Philosophy (PhD)

Thesis (D. Engr.)--Technische Universität München. / At head of title: Deutsche Geodätische Kommission bei der Bayerischend Akademie der Wissenschaften.

Thesis (M.S. in Information Technology Management and M.S. in Computer Science)--Naval Postgraduate School, March 2004. / Thesis advisor(s): Burt Lundy. Includes bibliographical references (p. 99-100). Also available online.

Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 328-349). Available also in a digital version from Dissertation Abstracts.

Thesis (M.S. in Computer Science)--Naval Postgraduate School, December 2003. / Thesis advisor(s): Bert Lundy, Wen Su. Includes bibliographical references (p. 101-103). Also available online.

Thesis (M. Phil.)--University of Hong Kong, 2010. / Includes bibliographical references (leaves 116-120). Also available in print.

Thesis (M. Phil.)--University of Hong Kong, 1974. / Mimeographed.

published_or_final_version / Industrial and Manufacturing Systems Engineering / Doctoral / Doctor of Philosophy