+publisher:"University of Arizona" +contributor:("Schlichting, Richard D")

University of Arizona

1. Bridges, Patrick G. Composing and coordinating adaptations in Cholla .

Degree: 2002, University of Arizona

► Adaptation is an increasing important attribute for software that must operate well in changing environments, such as those encountered by mobile devices connected by wireless… (more)

▼ Adaptation is an increasing important attribute for software that must operate well in changing environments, such as those encountered by mobile devices connected by wireless networks. However, adaptive software can be difficult to design, implement, and build, especially in systems with multiple adaptable components on multiple machines. A key challenge in such systems is coordinating adaptation across components, whether these components on located on the same or different machines. Without such coordination, for example, components may adapt in inconsistent or incompatible ways, leading to instability or poor performance. In addition, customizing adaptation policies to match the demands of the system and constructing testbeds are also difficult. This dissertation describes Cholla, a framework for implementing adaptation in configurable networked software. Cholla addresses the challenges of inter-component coordination on a single machine and can be used along with existing techniques to implement coordination across machines. In addition, Cholla extends the benefits of configurable software to adaptation by allowing the policies that control adaptation to be constructed in a configurable manner. This allows the control logic to be analyzed, customized, and composed in ways that would be difficult at best in other systems. A prototype implementation of Cholla that uses Cactus, a system for building highly configurable network protocols and services, is also presented. Two example applications are presented to demonstrate the effectiveness of Cholla: a multimedia transmission system and a configurable proxy for wireless networks. Both applications use CTP, a Cactus-based configurable transport protocol, and are structured in such a way that Cholla controls adaptive behavior in both CTP and between CTP and the application. Experimental results show that approach is the effective, especially in cases where adaptation mechanisms are limited and system behavior is very sensitive to adaptation choices. Finally, this dissertation describes a WaveLAN emulator that allows the testing of adaptable software for wireless systems without constructing a complete hardware testbed. While the emulator can only provide accurate results under light network loads, it is nonetheless useful for emulating the dynamic nature of connectivity in low latency wireless networks. Advisors/Committee Members: Schlichting, Richard D (advisor).

Subjects/Keywords: Computer Science.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bridges, P. G. (2002). Composing and coordinating adaptations in Cholla . (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/289844

Chicago Manual of Style (16^th Edition):

Bridges, Patrick G. “Composing and coordinating adaptations in Cholla .” 2002. Doctoral Dissertation, University of Arizona. Accessed January 16, 2021. http://hdl.handle.net/10150/289844.

MLA Handbook (7^th Edition):

Bridges, Patrick G. “Composing and coordinating adaptations in Cholla .” 2002. Web. 16 Jan 2021.

Vancouver:

Bridges PG. Composing and coordinating adaptations in Cholla . [Internet] [Doctoral dissertation]. University of Arizona; 2002. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/10150/289844.

Council of Science Editors:

Bridges PG. Composing and coordinating adaptations in Cholla . [Doctoral Dissertation]. University of Arizona; 2002. Available from: http://hdl.handle.net/10150/289844

University of Arizona

2. Hiltunen, Matti Aarno, 1963-. Configurable fault-tolerant distributed services .

Degree: 1996, University of Arizona

URL: http://hdl.handle.net/10150/290628

► Fault tolerance – that is, the ability of a system to continue providing its specified service despite failures – is becoming more important as computers are increasingly… (more)

▼ Fault tolerance – that is, the ability of a system to continue providing its specified service despite failures – is becoming more important as computers are increasingly used in application areas such as process control, air-traffic control, and banking. Distributed systems, consisting of computers connected by a network, are an important platform for many fault-tolerant systems. Unfortunately, it is difficult to construct fault-tolerant distributed software, so communication services such as multicast, RPC, membership, and transactions have been proposed as simplifying abstractions. However, although numerous versions of these services have been defined, no single implementation provides a perfect match for all applications and all execution environments. This dissertation presents an approach to constructing highly configurable fault-tolerant services. A new model is proposed where a service is composed out of microprotocol objects, each of which implements an individual semantic property of the overall service. This makes it easy to construct different customized versions of a service with properties tailored to the specifics of an application. The model allows micro-protocols to cooperate using user-definable events and shared variables, making the model more flexible than existing approaches. Three prototype implementations of the model are also described. In addition, a new approach is introduced for specifying abstract properties of services using temporal logic over message ordering graphs, which are abstract representations of collections of messages on each site. Furthermore, the problem of which combinations of properties or corresponding micro-protocols are feasible is addressed by defining relations that identify those combinations that result in a functioning service. Dependency and configuration graphs are presented as tools for constructing operational configurations. This new approach is used to develop configurable membership and group RPC services. Furthermore, the system diagnosis problem is contrasted with membership, and new membership and system diagnosis algorithms are derived based on the observations. Finally, the dissertation presents an application of the event-driven model to adaptive systems that dynamically change their behavior as a result of changes in the execution environment or user requirements. Advisors/Committee Members: Schlichting, Richard D (advisor).

Subjects/Keywords: Engineering, Electronics and Electrical.; Computer Science.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hiltunen, Matti Aarno, 1. (1996). Configurable fault-tolerant distributed services . (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/290628

Chicago Manual of Style (16^th Edition):

Hiltunen, Matti Aarno, 1963-. “Configurable fault-tolerant distributed services .” 1996. Doctoral Dissertation, University of Arizona. Accessed January 16, 2021. http://hdl.handle.net/10150/290628.

MLA Handbook (7^th Edition):

Hiltunen, Matti Aarno, 1963-. “Configurable fault-tolerant distributed services .” 1996. Web. 16 Jan 2021.

Vancouver:

Hiltunen, Matti Aarno 1. Configurable fault-tolerant distributed services . [Internet] [Doctoral dissertation]. University of Arizona; 1996. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/10150/290628.

Council of Science Editors:

Hiltunen, Matti Aarno 1. Configurable fault-tolerant distributed services . [Doctoral Dissertation]. University of Arizona; 1996. Available from: http://hdl.handle.net/10150/290628

University of Arizona

3. Bhatti, Nina Trappe. A system for constructing configurable high-level protocols .

Degree: 1996, University of Arizona

URL: http://hdl.handle.net/10150/290666

► Distributed applications often require sophisticated communication services such as multicast, membership, group RPC (GRPC), transactions, or support for mobility. These services form a large portion… (more)

▼ Distributed applications often require sophisticated communication services such as multicast, membership, group RPC (GRPC), transactions, or support for mobility. These services form a large portion of the supporting software for distributed applications, yet the specific requirements of the service vary from application to application. Constructing communication services that are useful for multiple diverse applications while still being manageable and efficient is a major challenge. This dissertation focuses on improving the construction of complex communication services. The contributions of the dissertation are a new model for the construction of such services and the design and implementation of a supporting network subsystem. In this model, a communication service is decomposed into distinct micro-protocols, each implementing a specific semantic property. Micro-protocols have well-defined interfaces that use events to coordinate actions and communicate state changes, which results in a highly modular and configurable implementation. This model augments, rather than replaces, the conventional hierarchical protocol model. In this implementation, a conventional x-kernel protocol is replaced with a composite protocol in which micro-protocol objects are linked with a standard runtime system that externally presents the standard x-kernel interface. Internally, the runtime system provides common message services, enforces a uniform inter-face between micro-protocols, detects and generates events, and synchronously or asynchronously executes event handlers. The viability of the approach is demonstrated by performance tests for several different configurations of a suite of micro-protocols for a group RPC service. The micro-protocols in this suite implement multiple semantic properties of procedure call termination, message ordering, reliability, collation of responses, call semantics, membership, and failure. The tests were conducted while running within the x-kernel as a user level task on the Mach operating system. Additional micro-protocols for mobile computing applications validate the generality of the model. We designed micro-protocols for quality of service (QoS), transmitting and renegotiating QoS parameters during handoffs, as well as for mobility management, covering cell detection, handoff, and disconnection. This suite of micro-protocols can be configured to accommodate a range of different service requirements or even to mimic existing mobile architectures such as those found in the Crosspoint, PARC TAB, InfoPad, or DataMan projects. Advisors/Committee Members: Schlichting, Richard D (advisor).

Subjects/Keywords: Computer Science.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bhatti, N. T. (1996). A system for constructing configurable high-level protocols . (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/290666

Chicago Manual of Style (16^th Edition):

Bhatti, Nina Trappe. “A system for constructing configurable high-level protocols .” 1996. Doctoral Dissertation, University of Arizona. Accessed January 16, 2021. http://hdl.handle.net/10150/290666.

MLA Handbook (7^th Edition):

Bhatti, Nina Trappe. “A system for constructing configurable high-level protocols .” 1996. Web. 16 Jan 2021.

Vancouver:

Bhatti NT. A system for constructing configurable high-level protocols . [Internet] [Doctoral dissertation]. University of Arizona; 1996. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/10150/290666.

Council of Science Editors:

Bhatti NT. A system for constructing configurable high-level protocols . [Doctoral Dissertation]. University of Arizona; 1996. Available from: http://hdl.handle.net/10150/290666

University of Arizona

4. Mohamed, Shamim P. End-user specification of interactive displays.

Degree: 1993, University of Arizona

URL: http://hdl.handle.net/10150/186439

► Presenting data graphically can often increase its understandability – well-designed graphics can be more effective than a tabular display of numbers. It is much easier to… (more)

▼ Presenting data graphically can often increase its understandability – well-designed graphics can be more effective than a tabular display of numbers. It is much easier to get an understanding of the relationships and groupings in data by looking at a pictorial representation than at raw numbers. Most visualization systems to date, however, have allowed users to only choose from a small number of pre-defined display methods. This does not allow the easy development of new and innovative display techniques. These systems also present a static display – users cannot interact with and explore the data. More innovative displays, and the systems that implement them, tend to be extremely specialised, and closely associated with an underlying application. We propose techniques and a system where the user can specify most kinds of displays. It provides facilities to integrate user-input devices into the display, so that users can interact and experiment with the data. This encourages an exploratory approach to data understanding. Most users of such systems have the sophistication to use advanced techniques, but conventional programming languages are too hard to learn just for occasional use. It is well known that direct manipulation is a powerful technique for novice users; systems that use it are much easier to learn and remember for occasional use. We provide a system that uses these techniques to provide a visualization tool. Extensions to the WYSIWYG (What You See Is What You Get) metaphor are provided to handle its shortcomings, the difficulty of specifying deferred actions and abstract objects. In the data graphics domain, the main drawbacks of WYSIWYG systems are the difficulty of allowing a variable number of data items, and specifying conditional structures. This system also encourages re-use and sharing of commonly used display idioms. Pre-existing displays can be easily incorporated into new displays, and also modified to suit the users' specific needs. This allows novices and unsophisticated users to modify and effectively use display techniques that advanced users have designed. Advisors/Committee Members: Schlichting, Richard D. (committeemember), Bailey, Mary L. (committeemember).

Subjects/Keywords: Computer graphics.; Computer science.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mohamed, S. P. (1993). End-user specification of interactive displays. (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/186439

Chicago Manual of Style (16^th Edition):

Mohamed, Shamim P. “End-user specification of interactive displays. ” 1993. Doctoral Dissertation, University of Arizona. Accessed January 16, 2021. http://hdl.handle.net/10150/186439.

MLA Handbook (7^th Edition):

Mohamed, Shamim P. “End-user specification of interactive displays. ” 1993. Web. 16 Jan 2021.

Vancouver:

Mohamed SP. End-user specification of interactive displays. [Internet] [Doctoral dissertation]. University of Arizona; 1993. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/10150/186439.

Council of Science Editors:

Mohamed SP. End-user specification of interactive displays. [Doctoral Dissertation]. University of Arizona; 1993. Available from: http://hdl.handle.net/10150/186439

University of Arizona

5. Rajagopalan, Mohan. Optimizing System Performance and Dependability Using Compiler Techniques .

Degree: 2006, University of Arizona

URL: http://hdl.handle.net/10150/194402

► As systems become more complex, there are increasing demands for improvement with respect to attributes such as performance, dependability, and security. Optimization is defined as… (more)

▼ As systems become more complex, there are increasing demands for improvement with respect to attributes such as performance, dependability, and security. Optimization is defined as theprocess of making the most effective use of a set of resources with respect to some attribute. Existing optimization techniques, however, have two fundamental limitations. They target individual parts of a system without considering the potentially significant global picture, and they are designed to improve a single attribute at a time. These limitations impose significant restrictions on the kinds of optimization possible, the effectiveness of the techniques, and the ability to improvethe optimization process itself.This dissertation presents holistic system optimization, a new approach to optimization based on taking a broad view of a system. Unlike current approaches, holistic optimizations consider different kinds of interactions at multiple levels in a system, and target a variety of metrics uniformly. A key component of this research has been the use of proven compiler techniques to ensure transparency, automation, and correctness. These techniques have been implemented in Cassyopia, a software prototype of a framework for performing holistic optimization.The core of this work is three new holistic optimizations, which are also presented. The first describes profile-directed static optimizations designed to improve the performance of eventbased programs by spanning boundaries that separate code that raises events from handlers that field them. The second, system call clustering, improves the system call behavior of an entire program by grouping together calls that can be executed in a single boundary crossing. In thiscase, the optimization spans kernel and user address spaces. Finally, authenticated system calls optimize system security through a novel implementation of an efficient system call monitor. This example demonstrates how the new approach can be used to create new optimizations that not only span address space boundaries but also target attributes such as dependability. All of these optimizations involve the application of standard compiler techniques in non-traditional contexts and demonstrate how systems can be improved beyond what is possible using existing techniques. Advisors/Committee Members: Schlichting, Richard D (advisor), Schlichting, Richard D. (committeemember), Debray, Saumya K. (committeemember), Hiltunen, Matti A. (committeemember), Andrews, Gregory R. (committeemember).

Subjects/Keywords: Operating Systems; Compiler Optimization; Program Analysis; Performance Optimization; Security and Intrusion Tolerance; Holistic System Optimization

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Rajagopalan, M. (2006). Optimizing System Performance and Dependability Using Compiler Techniques . (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/194402

Chicago Manual of Style (16^th Edition):

Rajagopalan, Mohan. “Optimizing System Performance and Dependability Using Compiler Techniques .” 2006. Doctoral Dissertation, University of Arizona. Accessed January 16, 2021. http://hdl.handle.net/10150/194402.

MLA Handbook (7^th Edition):

Rajagopalan, Mohan. “Optimizing System Performance and Dependability Using Compiler Techniques .” 2006. Web. 16 Jan 2021.

Vancouver:

Rajagopalan M. Optimizing System Performance and Dependability Using Compiler Techniques . [Internet] [Doctoral dissertation]. University of Arizona; 2006. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/10150/194402.

Council of Science Editors:

Rajagopalan M. Optimizing System Performance and Dependability Using Compiler Techniques . [Doctoral Dissertation]. University of Arizona; 2006. Available from: http://hdl.handle.net/10150/194402

University of Arizona

6. O'Bagy, Janalee. The implementation of generators and goal-directed evaluation in Icon.

Degree: 1988, University of Arizona

URL: http://hdl.handle.net/10150/184491

► Generators and goal-directed evaluation provide a rich programming paradigm when combined with traditional control structures in an imperative language. Icon is a language whose goal-directed… (more)

Subjects/Keywords: Icon (Computer program language); Generators (Computer programs)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

O'Bagy, J. (1988). The implementation of generators and goal-directed evaluation in Icon. (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/184491

Chicago Manual of Style (16^th Edition):

O'Bagy, Janalee. “The implementation of generators and goal-directed evaluation in Icon. ” 1988. Doctoral Dissertation, University of Arizona. Accessed January 16, 2021. http://hdl.handle.net/10150/184491.

MLA Handbook (7^th Edition):

O'Bagy, Janalee. “The implementation of generators and goal-directed evaluation in Icon. ” 1988. Web. 16 Jan 2021.

Vancouver:

O'Bagy J. The implementation of generators and goal-directed evaluation in Icon. [Internet] [Doctoral dissertation]. University of Arizona; 1988. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/10150/184491.

Council of Science Editors:

O'Bagy J. The implementation of generators and goal-directed evaluation in Icon. [Doctoral Dissertation]. University of Arizona; 1988. Available from: http://hdl.handle.net/10150/184491

University of Arizona

7. Hayes, Roger Leonard. UTS: A type system for facilitating data communication.

Degree: 1989, University of Arizona

URL: http://hdl.handle.net/10150/184840

► This dissertation presents a type scheme called UTS. The goal of UTS is to support composition between autonomous systems and programs. Composition is defined to… (more)

▼ This dissertation presents a type scheme called UTS. The goal of UTS is to support composition between autonomous systems and programs. Composition is defined to include procedure call and message passing; it also includes command invocation and the use of stored data. The design of UTS and the principles that guided that design are discussed. The UTS type system is intended as an easily-ported pidgin language. It includes the most common scalar types, such as integer, floating point, and string; the common type constructors such as record and array; and it supports a mechanism for reference to procedures. An innovation of the type scheme is that every value, including procedure values, is tagged with a type indicator, so that it is self-describing. In order to provide a high degree of portability, to provide access to a wide variety of systems, and to support dynamic binding, UTS requires a minimum of centralized knowledge and shared data definitions. It does provide a mechanism for underspecification of types that supports flexible commands and generic procedures. UTS was originally developed as the type system for the Saguaro distributed operating system. UTS is used in Saguaro for all stored data and for procedure invocation both at the system call level and the user interface level. UTS is also used as the type system for MLP, a system that provides heterogeneous remote procedure calls. MLP is designed to minimize the cost of adding new languages while providing the ability to handle common situations easily and automatically. More complex situations can be handled by making use of routines for programmer-controlled inspection and translation of UTS values. Two implementations of MLP are described, with the changes between the versions and the rationale for those changes. The run-time systems for the two versions are also described. The use of MLP is illustrated by projects built on an MLP platform. The largest of these is a prototype of the Saguaro command interpreter. Another is an interface between MLP and the Emerald programming language. The dissertation ends with a summary and discussion of possibilities for future research. Advisors/Committee Members: Schlichting, Richard D (advisor), Andrews, Gregory R. (committeemember), Hudson, Scott E. (committeemember), Yakowitz, Sidney J. (committeemember).

Subjects/Keywords: Data transmission systems.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hayes, R. L. (1989). UTS: A type system for facilitating data communication. (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/184840

Chicago Manual of Style (16^th Edition):

Hayes, Roger Leonard. “UTS: A type system for facilitating data communication. ” 1989. Doctoral Dissertation, University of Arizona. Accessed January 16, 2021. http://hdl.handle.net/10150/184840.

MLA Handbook (7^th Edition):

Hayes, Roger Leonard. “UTS: A type system for facilitating data communication. ” 1989. Web. 16 Jan 2021.

Vancouver:

Hayes RL. UTS: A type system for facilitating data communication. [Internet] [Doctoral dissertation]. University of Arizona; 1989. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/10150/184840.

Council of Science Editors:

Hayes RL. UTS: A type system for facilitating data communication. [Doctoral Dissertation]. University of Arizona; 1989. Available from: http://hdl.handle.net/10150/184840

University of Arizona

8. Druschel, Peter. Operating system support for high-speed networking.

Degree: 1994, University of Arizona

URL: http://hdl.handle.net/10150/186828

► The advent of high-speed networks may soon increase the network bandwidth available to workstation class computers by two orders of magnitude. Combined with the dramatic… (more)

Subjects/Keywords: Computer networks.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Druschel, P. (1994). Operating system support for high-speed networking. (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/186828

Chicago Manual of Style (16^th Edition):

Druschel, Peter. “Operating system support for high-speed networking. ” 1994. Doctoral Dissertation, University of Arizona. Accessed January 16, 2021. http://hdl.handle.net/10150/186828.

MLA Handbook (7^th Edition):

Druschel, Peter. “Operating system support for high-speed networking. ” 1994. Web. 16 Jan 2021.

Vancouver:

Druschel P. Operating system support for high-speed networking. [Internet] [Doctoral dissertation]. University of Arizona; 1994. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/10150/186828.

Council of Science Editors:

Druschel P. Operating system support for high-speed networking. [Doctoral Dissertation]. University of Arizona; 1994. Available from: http://hdl.handle.net/10150/186828

University of Arizona

9. Guedes Neto, Dorgival Olavo. Operating system and network support for high-performance computing .

Degree: 1999, University of Arizona

URL: http://hdl.handle.net/10150/298757

► High-performance computing applications were once limited to isolated supercomputers. In the past few years, however, there has been an increasing need to share data between… (more)

▼ High-performance computing applications were once limited to isolated supercomputers. In the past few years, however, there has been an increasing need to share data between different machines. This, combined with new network technologies which provide higher bandwidths, have led high-performance computing systems to adapt so that they can move data over the local network. There are some problems in doing this. Current high-performance systems often use centralized protocol servers, thereby creating bottlenecks to network connections. In addition, the lack of a more appropriate protocol leads to the use of TCP by applications using parallel connections. TCP is not perfectly tuned to such applications. This dissertation presents a detailed analysis of the problems caused by centralized protocol servers and the use of TCP in high-performance computing environments. It shows why the network servers currently available in some supercomputers do not provide good performance. It also presents simulation results that illustrate how TCP connection performance can degrade rapidly when multiple cooperative connections are used. The main contributions in this work are the development of distributed protocol stacks and cooperative rate-based traffic shaping. Distributed stacks use an user-level protocol implementation to replicate the TCP/IP protocol stack in all the nodes of a multicomputer, removing the protocol server from the data path and avoiding the associated bottleneck. Cooperative rate shaping uses bandwidth estimates to pace data packets, avoiding most of the problems that cause performance degradation in parallel cooperative connections. It also provides a way for cooperating connections to share their bandwidth estimates, improving performance by making good use of their combined knowledge. Advisors/Committee Members: Peterson, Larry (advisor), Peterson, Larry L. (committeemember), Hartman, John H. (committeemember), Schlichting, Richard D. (committeemember).

Subjects/Keywords: Computer Science.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Guedes Neto, D. O. (1999). Operating system and network support for high-performance computing . (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/298757

Chicago Manual of Style (16^th Edition):

Guedes Neto, Dorgival Olavo. “Operating system and network support for high-performance computing .” 1999. Doctoral Dissertation, University of Arizona. Accessed January 16, 2021. http://hdl.handle.net/10150/298757.

MLA Handbook (7^th Edition):

Guedes Neto, Dorgival Olavo. “Operating system and network support for high-performance computing .” 1999. Web. 16 Jan 2021.

Vancouver:

Guedes Neto DO. Operating system and network support for high-performance computing . [Internet] [Doctoral dissertation]. University of Arizona; 1999. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/10150/298757.

Council of Science Editors:

Guedes Neto DO. Operating system and network support for high-performance computing . [Doctoral Dissertation]. University of Arizona; 1999. Available from: http://hdl.handle.net/10150/298757

University of Arizona

10. Henderson, Lehman Edwin, Jr. Testing eigenvalue software.

Degree: 1991, University of Arizona

URL: http://hdl.handle.net/10150/185744

► This dissertation describes a significant advance in automated testing of eigenvalue software. Several programs are described that assist the researcher in verifying that a new… (more)

Subjects/Keywords: Dissertations, Academic.; Computer science.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Henderson, Lehman Edwin, J. (1991). Testing eigenvalue software. (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/185744

Chicago Manual of Style (16^th Edition):

Henderson, Lehman Edwin, Jr. “Testing eigenvalue software. ” 1991. Doctoral Dissertation, University of Arizona. Accessed January 16, 2021. http://hdl.handle.net/10150/185744.

MLA Handbook (7^th Edition):

Henderson, Lehman Edwin, Jr. “Testing eigenvalue software. ” 1991. Web. 16 Jan 2021.

Vancouver:

Henderson, Lehman Edwin J. Testing eigenvalue software. [Internet] [Doctoral dissertation]. University of Arizona; 1991. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/10150/185744.

Council of Science Editors:

Henderson, Lehman Edwin J. Testing eigenvalue software. [Doctoral Dissertation]. University of Arizona; 1991. Available from: http://hdl.handle.net/10150/185744

University of Arizona

11. Mishra, Shivakant. Consul: A communication substrate for fault-tolerant distributed programs.

Degree: 1992, University of Arizona

URL: http://hdl.handle.net/10150/185824

► As human dependence on computing technology increases, so does the need for computer system dependability. This dissertation introduces Consul, a communication substrate designed to help… (more)

▼ As human dependence on computing technology increases, so does the need for computer system dependability. This dissertation introduces Consul, a communication substrate designed to help improve system dependability by providing a platform for building fault-tolerant, distributed systems based on the replicated state machine approach. The key issues in this approach – ensuring replica consistency and reintegrating recovering replicas – are addressed in Consul by providing abstractions called fault-tolerant services. These include a broadcast service to deliver messages to a collection of processes reliably and in some consistent order, a membership service to maintain a consistent system-wide view of which processes are functioning and which have failed, and a recovery service to recover a failed process. Fault-tolerant services are implemented in Consul by a unified collection of protocols that provide support for managing communication, redundancy, failures, and recovery in a distributed system. At the heart of Consul is Psync, a protocol that provides for multicast communication based on a context graph that explicitly records the partial (or causal) order of messages. This graph also serves as the basis for novel algorithms used in the ordering, membership, and recovery protocols. The ordering protocol combines the semantics of the operations encoded in messages with the partial order provided by Psync to increase the concurrency of the application. Similarly, the membership protocol exploits the partial ordering to allow different processes to conclude that a failure has occurred at different times relative to the sequence of messages received, thereby reducing the amount of synchronization required. The recovery protocol combines checkpointing with the replay of messages stored in the context graph to recover the state of a failed process. Moreover, this collection of protocols is implemented in a highly-configurable manner, thus allowing a system builder to easily tailor an instance of Consul from this collection of building-block protocols. Consul is built in the x-Kernel and executes standalone on a collection of Sun 3 work-stations. Initial testing and performance studies have been done using two applications: a replicated directory and a distributed wordgame. These studies show that the semantic based order is more efficient than a total order in many situations, and that the overhead imposed by the checkpointing, membership, and recovery protocols is insignificant. Advisors/Committee Members: Schlichting, Richard D (advisor), Peterson, Larry L. (committeemember), Snodgrass, Richard T. (committeemember), Gay, David (committeemember), Leonard, John (committeemember).

Subjects/Keywords: Fault-tolerant computing.; Computer network protocols.; Software engineering.

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mishra, S. (1992). Consul: A communication substrate for fault-tolerant distributed programs. (Doctoral Dissertation). University of Arizona. Retrieved from http://hdl.handle.net/10150/185824

Chicago Manual of Style (16^th Edition):

Mishra, Shivakant. “Consul: A communication substrate for fault-tolerant distributed programs. ” 1992. Doctoral Dissertation, University of Arizona. Accessed January 16, 2021. http://hdl.handle.net/10150/185824.

MLA Handbook (7^th Edition):

Mishra, Shivakant. “Consul: A communication substrate for fault-tolerant distributed programs. ” 1992. Web. 16 Jan 2021.

Vancouver:

Mishra S. Consul: A communication substrate for fault-tolerant distributed programs. [Internet] [Doctoral dissertation]. University of Arizona; 1992. [cited 2021 Jan 16]. Available from: http://hdl.handle.net/10150/185824.

Council of Science Editors:

Mishra S. Consul: A communication substrate for fault-tolerant distributed programs. [Doctoral Dissertation]. University of Arizona; 1992. Available from: http://hdl.handle.net/10150/185824

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations