The intergroup protocols: Scalable group communication for the internet (open access)

The intergroup protocols: Scalable group communication for the internet

Reliable group ordered delivery of multicast messages in a distributed system is a useful service that simplifies the programming of distributed applications. Such a service helps to maintain the consistency of replicated information and to coordinate the activities of the various processes. With the increasing popularity of the Internet, there is an increasing interest in scaling the protocols that provide this service to the environment of the Internet. The InterGroup protocol suite, described in this dissertation, provides such a service, and is intended for the environment of the Internet with scalability to large numbers of nodes and high latency links. The InterGroup protocols approach the scalability problem from various directions. They redefine the meaning of group membership, allow voluntary membership changes, add a receiver-oriented selection of delivery guarantees that permits heterogeneity of the receiver set, and provide a scalable reliability service. The InterGroup system comprises several components, executing at various sites within the system. Each component provides part of the services necessary to implement a group communication system for the wide-area. The components can be categorized as: (1) control hierarchy, (2) reliable multicast, (3) message distribution and delivery, and (4) process group membership. We have implemented a prototype of the …
Date: November 1, 2000
Creator: Berket, K.
System: The UNT Digital Library
Measurement of Deuteron Tensor Polarization in Elastic Electron Scattering (open access)

Measurement of Deuteron Tensor Polarization in Elastic Electron Scattering

None
Date: November 1, 2000
Creator: Gustafsson, Kenneth K.
System: The UNT Digital Library
A Spatial Discretization Scheme for Solving the Transport Equation on Unstructured Grids of Polyhedra (open access)

A Spatial Discretization Scheme for Solving the Transport Equation on Unstructured Grids of Polyhedra

In this work, we develop a new spatial discretization scheme that may be used to numerically solve the neutron transport equation. This new discretization extends the family of corner balance spatial discretizations to include spatial grids of arbitrary polyhedra. This scheme enforces balance on subcell volumes called corners. It produces a lower triangular matrix for sweeping, is algebraically linear, is non-negative in a source-free absorber, and produces a robust and accurate solution in thick diffusive regions. Using an asymptotic analysis, we design the scheme so that in thick diffusive regions it will attain the same solution as an accurate polyhedral diffusion discretization. We then refine the approximations in the scheme to reduce numerical diffusion in vacuums, and we attempt to capture a second order truncation error. After we develop this Upstream Corner Balance Linear (UCBL) discretization we analyze its characteristics in several limits. We complete a full diffusion limit analysis showing that we capture the desired diffusion discretization in optically thick and highly scattering media. We review the upstream and linear properties of our discretization and then demonstrate that our scheme captures strictly non-negative solutions in source-free purely absorbing media. We then demonstrate the minimization of numerical diffusion of a …
Date: November 1, 2000
Creator: Thompson, Kelly Glen
System: The UNT Digital Library