Digital Commons Network^™

Xinu On The Transputer, Douglas E. Comer, Victor Norman

Department of Computer Science Technical Reports

No abstract provided.

Another Unified Approach To Some Bottleneck And Capacity Optimization Problems, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Parallel Techniques For Computational Geometry, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.

Global Concurrency Control In Heterogeneous Distributed Database Systems, Ahmed K. Elmagarmid, Weimin Du, Yungho Leu

Department of Computer Science Technical Reports

No abstract provided.

A Colored Petri Net-Based Approach For Automated Deadlock Detection In Parallel Programs, N. Mansouri, Amrit L. Goel

Electrical Engineering and Computer Science - Technical Reports

A static analysis approach is proposed for automated detection of deadlocks in a common class of parallel programs, referred to as Single Code Multiple Data (SCMD) programs. It is based on colored Petri net (CP-net) modeling and reachability analysis, where colors correspond to parallel processes. An SCMD program is first translated into a CP-net and a reachability tree is then derived and analyzed for deadlock information. CP-subnets representing basic programming language constructs are described. These subnets are employed as building blocks by an algorithm that translates synchronization-related statements of a process in an SCMD program and connects the resulting subnets. …

An Approach For Minimizing Spurious Errors In Testing Ada Tasking Programs, N. Mansouri, Amrit L. Goel

Electrical Engineering and Computer Science - Technical Reports

We propose an approach for detecting deadlocks and race conditions in Ada tasking software. It is based on an extension to Petri net-based techniques, where a concurrent program is modeled as a Petri net and a reachability graph is then derived and analyzed for desired information. In this approach, Predicate-Action subnets representing Ada programming constructs are described, where predicates and actions are attached to transitions. Predicates are those found in decision statements. Actions involve updating the status of the variables that affect the tasking behavior of the program and updating the Read and Write sets of shared variables. The shared …

A Petri Net-Based Tool For Detecting Deadlocks And Race Conditions In Concurrent Programs, Amrit L. Goel, N. Mansouri

Electrical Engineering and Computer Science - Technical Reports

A static analysis tool for detecting deadlocks and potential race conditions on shared variables in concurrent programs is presented. It is based on Petri Net modeling and reachability analysis, where a concurrent program is modeled as an augmented Petri net and a reachability graph is then derived and analyzed for desired information. Place-Transition subnets representing programming language constructs are described. Transitions in these subnets are augmented with sets of shared variables that occur in sections of the program, called concurrency zones, related to the transitions. The tool consists of four modules. The modeling module employs the augmented subnets as building …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, September 1990, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Gateway Design For Lan Interconnection Via Isdn, Xian-Yu Zhang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Recently, the use of bridges/gateways to interconnect physically distant local area networks (LANs) has become increasingly popular. There are various ways of connecting these bridges/gateways. ISDN is one of them and an attractive one. In this paper we discuss our work in the gateway design for interconnecting LANs via ISDN.

On High Level Characterization Of Parallelism, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Multisearch Techniques Of Hierarchical Dags On Mesh-Connected Computers, With Applications, Jyh-Jong Tsay, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.

Robot Pedagogics: The Adaptation, Analysis, And Computer Control Of A Model Manipulator, Edward T. Hammerand, Chung You Ho

Computer Science Technical Reports

The subject of robotics is addressed by many different fields, among them computer science, electrical engineering, and mechanical engineering. This work is an attempt to bring together all of these aspects from the perspective of a computer science background. Different techniques are considered and reconciled with one another in the analytical area, while detail and explanation are added in all areas that were not previously available. In addition, geometrical interpretations arc presented for concepts that have heretofore been presented only in the form of equations.

Mesh And Pyramid Algorithms For Iconic Indexing, Alok Choudhary, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

In this paper parallel algorithms on meshes and pyramids for iconic indexing are presented. Our algorithms are asymptotically superior to previously known parallel algorithms.

A Simulation Of A Multi-Hop Communications Network Using A Kinematic Topology Generator And Static Sphere-Packing Power Control, Kevin Charles Davis

Masters Theses

No abstract provided.

Synchronization And Load Imbalance Effects In Distributed Memory Multiprocessor Systems, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Application Of The E/T Performance Modeling Methodology To A Computation On A 128 Processor Ncube, Dan C. Marinescu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

The Cops Security Checker System, Daniel Farmer, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

A New Organization Of Sparse Gauss Elimination For Solving Pdes, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Load Redistribution On Hypercubes In The Presence Of Faults, Sanjay Ranka, Jhy-Chun Wang

Electrical Engineering and Computer Science - Technical Reports

In this paper, we present load redistribution algorithms for hypercubes in the presence of faults. Our algorithms complete in low-order polynomial of the number of faulty nodes and exhibit excellent experimental performance. These algorithms are topology independent and can be applied to a wide variety of networks.

Visual Speech Training Aid For The Deaf, Subhashri Venkat

Electrical & Computer Engineering Theses & Dissertations

A computer-based vowel articulation training aid has been developed. A "continuous" acoustic-phonetic transformation is performed to map speech parameters to a lower dimensionality display space. There are two possible approaches to this transformation problem. The transformation could be either linear or a combination nonlinear/linear. The nonlinear transformation is performed using a multi-layered feedforward neural network with linear output layers. Speech parameters are extracted either from an analog filter bank arrangement (band energies) or by a digital signal processing procedure (Discrete Cosine Transform Coefficients). The speech parameters obtained from both methods correspond to the spectral envelope of the speech signals. The …

Typed Token Approach For Database Processing During Network Partitioning, Bharat Bhargava, Shy-Renn Lian

Department of Computer Science Technical Reports

No abstract provided.

Computer Viruses--A Form Of Artificial Life?, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Cascading Of Arithematic Coding Method With The Lzw Algorithm, Venkat R. Maram, Nageshwar R. Kadakuntla

Theses

Two known compression algorithms appropriate for communication are the LZW algorithm and the Arithmetic Coding method. Both algorithms are adaptive and require no extra communication from the encoder to the decoder. We present a scheme to cascade these algorithms into an adaptive algorithm which achieves higher compression ratio and is appropriate for communication.

Communication And Control In Spmd Parallel Numerical Computations, Dan C. Marinescu, John R. Rice, E. A. Vavalis

Department of Computer Science Technical Reports

No abstract provided.

A Neural Network Simulator For The Connnection Machine, N. Asokan, Ravi V. Shankar, Chilukuri K. Mohan, Kishan Mehrotra, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

In this paper we describe the design, development, and performance of a neural network simulator for the Connection Machine (CM)3. The design of the simulator is based on the Rochester Connectionist Simulator(RCS). RCS is a simulator for connectionist networks developed at the University of Rochester. The CM simulator can be used as a stand-alone system or as a high-performance parallel back-end to RCS. In the latter case, once the network has been built by RCS, the high-performance parallel back-end system constructs an equivalent network on the CM processor array and executes it. The CM simulator facilitates the exploitation of the …

Dynamic Range Partitioning In Multiprocessor Database Implementations, Ophir Frieder

Electrical Engineering and Computer Science - Technical Reports

Multiprocessor implementation of the relational database operators has recently received great attention in literature [1-4, 8, 11]. As the complexity of implementing the relational operators rests on the inter-node communication patterns involved in an operation, greater research attention has been focused on Join algorithms. The Join traffic patterns subsume those of the remaining relational operators. To effectively exploit parallelism in bucket based join implementations, the domain of the joining attributes must be partitioned into equal subranges. That is, the processing of each subrange requires roughly the same amount of time. A skewed distribution of workload significantly hinders performance. As relations …

Optical Switching And Routing Architectures For Fiber-Optic Computer Communication Networks, Alok Choudhary, Salim Hariri, Wang Song, Partha Banerjee, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

Optical technology has become a significant part of communication networks. We propose an Optical Interface Message Processor (OPTIMP) that exploits high-bandwidth, parallelism, multi-dimensional capability, and high storage density offered by optics. The most time consuming operations such as switching and routing in communication networks are performed in optical domain in the proposed system. Our design does not suffer from the optical/electrical conversion bottlenecks and can perform switching and routing in the range of Gigabits/s. The proposed design can have significant impact in high-speed communication networks as well as high-speed interconnection networks for parallel computers. The source-destination (S-D) information from a …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, May 1990, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A four page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Parallel Sparse: Data Structure And Organization, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Root Finding Algorithm For Parallel Architecture Machines, Stuti Moitra

Computer Science Theses & Dissertations

In this thesis a parallel algorithm for determining the zeros of any given analytic function is described. Parallelism is achieved by modifying the traditional bisection algorithm for architecture machines.

Given any user supplied function f(X), continuous on the interval A_o ≤ x ≤ B₀, and the tolerance of accuracy an algorithm of determining up to ten roots, with error of approximation less than or equal to tolerance, on parallel systems like Distributed Array Processor (OAP) and N-cube is considered.

A variation of the bisection method has been adapted for this purpose. At each level of iteration a …