Physical Sciences and Mathematics Commons^™

Pargal: A Package For Parallel Graph Algorithms, Winston Anand-Kumar

Masters Theses

In this thesis, we have considered three graph problems namely, spanning forest problem, connected component problem and minimum cost spanning forest problem. Standard methods to solve these problems using sequential algorithms by various authors are presented for each problem. Efficient parallel algorithms for these problems have also been presented by various authors; however, most of these solutions demands a need for large number of processors, which immediately increases the cost of the hardware and in most of the cases it seems not very practical.

We present efficient solutions for the three problems on a hypercube parallel computer using p processors. …

An Integrated Simulation Model Development Environment For Slam Ii Using Object-Oriented Paradigm, Rizvan Erol

Masters Theses

An integrated simulation model development environment was implemented to assist the modeler by automating certain activities of simulation modeling. The system included interactive model definition, experimental design, automatic simulation program generation in SLAM II. Object-oriented paradigm at software development stage was extensively used to conceptualize the structure, and rules of the SLAM II language in order to generate efficient, and modular program code. The present system targeted modeling of various probabilistic inventory control system problems. The remarkable advantages of the system were rapid model development time, and achieving reliable program code without requiring any knowledge in SLAM II. Object-oriented programming …

An Efficient Over-The-Cell Routing Algorithm For High Performance Circuits, Sivakumar Natarajan

Masters Theses

In this thesis, we present a three-layer and a two-layer over-the-cell (OTC) channel routing algorithm (WILMA3 and WILMA2 respectively) for high speed circuits. This router not only minimizes the channel height by using over-the-cell areas but also achieves the net’s timing requirements.

We have implemented our routers in C on SUN Sparc 1+ workstation and tested it on MCNC benchmarks Primary I and II. Experimental results show that WILMA3 can achieve results which are 72% better (on the average) than the conventional two layer channel router, 61% better than two layer over-the-cell router and 51% better than three layer greedy …

Eztex: A Graphical User Interface System For Latex, Ravi K. Kosaraju

Masters Theses

No abstract provided.

Improved Global Routing Using ⋋-Geometry, Surendra Burman

Masters Theses

No abstract provided.

A Computer Simulation Of The Rotary Vacuum Filter Brown Stock Washing System Using Distribution Sampling, Edison G. Yiu

Masters Theses

A probabilistic model was utilized to simulate the brown stock washing system's error due to process variability and measurement noise. Mass balances of the washing system were performed using distribution sampling. This model relies on a nonlinear relationship between displacement and dilution, which permitted the generation of displacement ratio based upon wash liquor ratio. Experimental trials were performed on a pilotscale rotary vacuum single-stage washer. Nonlinear first-order relationship appears to characterize a pilotscale washer adequately. Differences were observed between the means and standard deviations of the measured results compared to the simulation output. Future work is needed to identify the …

Sequential And Parallel Discrete Event Simulation On Computer Communication Networks, Tao Zhou

Masters Theses

This thesis presents the discrete event simulation technique on the network design, focusing on the methodology, modeling and implementation. The developed technique is suitable for the analysis of any store-and-forward computer communication networks with any level of complexity. The proposed generic simulation model can be used to test the architectures and protocols of existing networks and networks being designed. In implementation of the sequential discrete event simulation, an object-oriented programming strategy is applied to the network simulation using the C++ language. The parallel discrete event simulation is introduced to solve the problem of long time execution of the sequential simulation …

The Development And Application Of Testing Techniques In An Object-Oriented Paradigm, Robert F. Kozal

Masters Theses

This thesis is the study of testing object-oriented programs. Aspects of object-oriented programs for which testing techniques are developed include classes, methods, inheritance, polymorphism, and encapsulation. The application of these techniques are illustrated, and a comparison between traditional testing techniques and object-oriented techniques is also drawn.

On Planar Routing Of Multi-Terminal Nets In Vlsi Physical Design, Jahangir A. Hashmi

Masters Theses

In this thesis, we study two problems related to the physical design of VLSI circuits. One problem is related to the VLSI global routing and the other is related to the detailed routing in a bounded region.

We consider the routing of multiple multi-terminal nets on a single layer. We suggest a new approach for this problem. Our approach is based on simultaneously finding a forest of k non-intersecting spanning trees. We present an O(n^3) algorithm for finding two spanning trees corresponding to two nets on a single layer.

We also study the problem of finding a minimum Steiner tree …

A Survey Of Computer Use In Occupational Therapy Fieldwork Sites, Martha E. Parks

Masters Theses

Eighty-three Western Michigan University occupational therapy fieldwork sites were surveyed to determine: (a) extent of computer use, (b) diagnostic categories with which computers are used, (c) extent of computer knowledge of registered occupational therapists (OTRs), and (d) adequacy of computer knowledge of fieldwork students. Forty-seven (56.6%) of the 83 surveys were returned. OTRs at 36 (76.6%) of the 47 sites currently use computers. Word processing is the most common way in which these OTRs use computers. The most common clinical use of computers is perceptual/motor assessment and treatment, while the most common research use of computers is for report writing. …

Graph Theory Based Routing Algorithms, Bo Wu

Masters Theses

In this thesis, we study two VLSI layout problems.

We investigate the Minimum-Bend Single Row Routing Problem in which the objective function is to minimize the number of doglegs (or blends) per net. Our approach uses a graph theoretic representation in which an instance of the Single Row Routing Problem is represented by three graphs, an overlap graph, a containment graph and an interval graph. Using this graph representation, we develop three algorithms for minimum-bend single row routing problem.

We present a three-layer over-the-cell router (ICR-3) for the standard cell design style based on a new cell model which assumes …

Algorithms For Incomplete Hypercubes, Venkata K. Prabhala

Masters Theses

Networked multiprocessing architectures for parallel com putation offer an alternative to high cost supercomputing. Recently hypercube has emerged as the most versatile architecture for parallel com putations. However, the number of nodes m in a hypercube is a power of 2, 2^d, where d is the dimension of the hypercube. In practice, it m ay not be possible to have a complete hypercube because the cost of upgradation is proportional to the num ber of nodes. Incomplete and Composite hypercubes help remove the exponential node(and hence cost) constraint.

In this thesis we establish the equality of m-node …