Sorting Large Files on a Backend Multiprocessor
The authors investigate the feasibility and efficiency of a parallel sort-merge algorithm by considering its implementation of the JASMIN prototype, a backend multiprocessor built around a fast packet bus. They describe the design and implementation of ...
An Asynchronous, Distributed Flow Control Algorithm for Rate Allocation in Computer Networks
An asynchronous, distributed algorithm is presented that determines the optimal transmission rate allocation in computer networks with virtual circuit routing. The flow control problem is formulated as a gradient hill-climbing algorithm. It is ...
Fault Tolerance Capabilities in Multistage Network-Based Multicomputer Systems
The inherent fault tolerances of systems based on nonredundant multistage interconnection networks (MINs) is investigated. Graph models are used to describe the system, indicate faults, study their effects, and aid in mathematical formulation of these ...
Meaningful Special Classes of Ternary Logic Functions-Regular Ternary Logic Functions and Ternary Majority Functions
Special ternary logic functions, namely, regular functions suitable for treating ambiguity and majority functions based on an extended majority principle are considered. The one-to-one correspondence between n-ary monotone regular ternary logic ...
Efficient Design of Totally Self-Checking Checkers for all Low-Cost Arithmetic Codes
A method is proposed that is based on the partitioning of the input code variables into two sections, each section representing the binary form of a number Z/sub 1/ and Z/sub 2/, respectively. For a code with check base A=2/sup m/-1, two m-bit end-...
Stochastic High-Level Petri Nets and Applications
A class of stochastic Petri nets called stochastic high-level Petri nets (SHLPNs) is proposed. SHLPNs are high-level Petri nets augmented with exponentially distributed firing times. SHLPNs generally lead to models with a smaller state space. A computer ...
Performance of ARQ Schemes on Token Ring Networks
Token ring networks differ in the manner in which acknowledgements are handled. In Newhall rings, acknowledgements of data packets are either sent as independent packets or piggybacked on returned data packets. In acknowledgement rings, there is an ...
An Algebraic Model for Asynchronous Circuits Verification
An algebraic methodology for comparing switch-level circuits with higher-level specifications is presented. Switch-level networks, 'user' behavior, and input constraints are modeled as asynchronous machines. The model is based on the algebraic theory of ...
Communication Performance in Multiple-Bus Systems
A simple queueing model is presented for studying the effect of multiple-bus interconnection networks on the performance of asynchronous multiprocessor systems. The proposed model is suitable for systems in which each processor has a local memory and is ...
Failure Dependent Bandwidth in Shuffle-Exchange Networks
A failure-dependent bandwidth model for shuffle-exchange (S/E) and augmented shuffle-exchange (S/E+) interconnection networks is presented. The models are based on probabilities of either data or address model failures for the individual binary switches ...
Floating-Point to Logarithmic Encoder Error Analysis
The logarithmic number (LNS), which supports high-speed, high-precision arithmetic, is envisioned as a possible arithmetic coprocessor attachment to a floating-point (FLP) processor. An error analysis of an FLP-to-LNS encoder is presented. Analytic ...
Strongly Fault Secure PLAs and Totally Self-Checking Checkers
A general approach is presented to the design of totally self-checking (TSC) programmable logic arrays (PLAs). A strongly fault secure (SFS) implementation is suggested for the functional PLA, which is shown to be SFS whenever the output is encoded by ...
Topological Properties of Hypercubes
The n-dimensional hypercube is a highly concurrent loosely coupled multiprocessor based on the binary n-cube topology. Machines based on the hypercube topology have been advocated as ideal parallel architectures for their powerful interconnection ...
An Experimental Study to Determine Task Size for Rollback Recovery Systems
The effects of using a recovery cache to save the variables of a program are studied. A novel optimization model for rollback is formulated to include the effects of a recovery cache in rollback systems. The parameters of the model proposed are the ...
Efficient Complex Matrix Multiplication
A well-known algorithm for complex multiplication which requires three real multiplications and five real additions is observed not to require commutativity. The resulting extension of its applicability to complex matrices is examined. The computational ...
An Efficient Class of Unidirectional Error Detecting/Correcting Codes
A method for constructing a class of t-error correcting and all unidirectional error-detecting systematic codes is proposed. These codes have been shown to be more efficient than codes constructed using other methods proposed in the literature. In a ...
Generating Fractal-Like Surfaces on General Purpose Mesh-Connected Computers
Realistic images of natural surfaces are often generated using computationally expensive stochastic modeling techniques. A parallel procedure to generate such models is presented. The target machines are general-purpose mesh-connected computers. The ...
Fault Tolerance in a Systolic Residue Arithmetic Processor Array
The regularity of systolic arrays and the potential for redundancy in residue number systems are used to provide fault tolerance in VLSI systems. The fault tolerance is concurrent with normal circuit operation and allows a continuous flow of correct ...
