Thesis (M.S. in Modeling, Virtual Environments and Simulation (MOVES))--Naval Postgraduate School, March 2010. / Thesis Advisor(s): Brutzman, Don ; McGregor, Don. "March 2010." Description based on title screen as viewed on April 23, 2010. Author(s) subject terms: Extensible Markup Language (XML), Efficient XML Interchange (EXI), Compression. Includes bibliographical references (p. 337-353). Also available in print.

Thesis (Ph. D.)--University of Wisconsin-Madison, 1989. / Cover title. "August 1989." Includes bibliographical references.

Thesis--University of Wisconsin--Madison. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 99-101).

Based on the author's D. Phil. Thesis (University of Oxford, 2003). / Includes bibliographical references. Available on-line.

Thesis (Ph. D.)--University of Texas at Austin, 2004. / Supervisor: Vijay K. Garg. Vita. Includes bibliographical references.

Thesis (Ph. D.)--University of Texas at Austin, 2007. / Vita. Includes bibliographical references.

Thesis (M.S.)--Georgia State University, 2006. / Title from title screen. Sushil Prasad, committee chair. Electronic text (106 p. : charts) : digital, PDF file. Description based on contents viewed June 11, 2007. Includes bibliographical references. Includes bibliographical references (p. 61-53).

Thesis (Ph. D.)--University of Washington, 2000. / Vita. Includes bibliographical references (p. 125-141).

The research presented in this thesis is about the design and implementation of Naira, a parallel, parallelising compiler for a rich, purely functional programming language. The source language of the compiler is a subset of Haskell 1.2. The front end of Naira is written entirely in the Haskell subset being compiled. Naira has been successfully parallelised and it is the largest successfully parallelised Haskell program having achieved good absolute speedups on a network of SUN workstations. Having the same basic structure as other production compilers of functional languages, Naira's parallelisation technology should carry forward to other functional language compilers. The back end of Naira is written in C and generates parallel code in the C language which is envisioned to be run on distributed-memory machines. The code generator is based on a novel compilation scheme specified using a restricted form of Milner's 7r-calculus which achieves asynchronous communication. We present the first working implementation of this scheme on distributed-memory message-passing multicomputers with split-phase transactions. Simulated assessment of the generated parallel code indicates good parallel behaviour. Parallelism is introduced using explicit, advisory user annotations in the source' program and there are two major aspects of the use of annotations in the compiler. First, the front end of the compiler is parallelised so as to improve its efficiency at compilation time when it is compiling input programs. Secondly, the input programs to the compiler can themselves contain annotations based on which the compiler generates the multi-threaded parallel code. These, therefore, make Naira, unusually and uniquely, both a parallel and a parallelising compiler. We adopt a medium-grained approach to granularity where function applications form the unit of parallelism and load distribution. We have experimented with two different task distribution strategies, deterministic and random, and have also experimented with thread-based and quantum- based scheduling policies. Our experiments show that there is little efficiency difference for regular programs but the quantum-based scheduler is the best in programs with irregular parallelism. The compiler has been successfully built, parallelised and assessed using both idealised and realistic measurement tools: we obtained significant compilation speed-ups on a variety of simulated parallel architectures. The simulated results are supported by the best results obtained on real hardware for such a large program: we measured an absolute speedup of 2.5 on a network of 5 SUN workstations. The compiler has also been shown to have good parallelising potential, based on popular test programs. Results of assessing Naira's generated unoptimised parallel code are comparable to those produced by other successful parallel implementation projects.

A new method of realizing two-element-kind driving-point Impedances is given and illustrated by examples. In this method, networks of any desired topology and having a minimum of elements are utilized. A transformation to normal coordinates forms the basis of the method and, in order to determine network element values, evaluation of the associated transformation matrix is necessary. This matrix is found by formulating and solving a set of multivariable polynomial equations of second degree. The solution to this set of polynomial equations is obtained by a numerical perturbation procedure. To initiate the procedure, a set of element values is chosen, and the network of specified topology is analysed. The corresponding transformation matrix and driving-point impedance are determined from this analysis. The impedance parameters are then perturbed by small amounts in the direction of the specified ones, and the resulting changes in the transformation matrix are calculated. The process is continued until the transformation matrix corresponding to the specified impedance is obtained. A detailed description of the computer program written to carry out the above procedure is Included. A large number of examples of various complexities, including some canonic structures, have been realized by the method. Examples show the superiority of the numerical method to conventional procedures for solving multivariable nonlinear equations. In particular, the choice of the initial set of element values is not required to be close to the final set to achieve convergence to a solution. Some restrictions on the realizability of irreducible complementary tree structures are reported. It is shown that the specification parameters may have local extrema at a point where the Jacobian of the system of polynomial equations vanishes. Examples which support these results are given. / Applied Science, Faculty of / Electrical and Computer Engineering, Department of / Graduate