Thesis (Ph. D.)--University of Wisconsin--Madison, 1982. / Typescript. Vita. Includes bibliographical references (leaf 145).

Thesis (doctoral)--Bonn, 1998. / Includes bibliographical references (p. [273]-[274]).

Thesis (Ph. D.)--University of Wisconsin, 1964. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Bibliography: leaves 124-128.

Thesis (Ph. D.)--University of Wisconsin--Madison, 1985. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 170-182).

No description available.

In this dissertation, multi-rate array (MRA) architecture and its synthesis are proposed and developed. Using multi-coordinate systems (MCS), a unified theory for mapping algorithms from their original algorithmic specifications onto multi-rate arrays is developed. A multi-rate array is a grid of processors in which each interconnection may have its own clock rate; operations with different complexities run at their own clock rate, thus increasing the throughput and efficiency. A class of algorithms named directional affine recurrence equations (DARE) is defined. The dependence space of a DARE can be decomposed into uniform and non-uniform subspaces. When projected along the non-uniform subspace, the resultant array structure is regular. Limitations and restrictions of this approach are investigated and a procedure for mapping DARE onto MRA is developed. To generalize this approach, synthesis theory is developed with initial specification as affine direct input output (ADIO) which aims at removing redundancies from algorithms. Most ADIO specifications are the original algorithmic specifications. A multi-coordinate systems (MCS) is used to present an algorithm's dependence structures. In a MCS system, the index spaces of the variables in an algorithm are defined relative to their own coordinate systems. Most traditionally considered irregular algorithms present regular dependence structures under MCS technique. Procedures are provided for transforming algorithms from original algorithmic specifications to their regular specifications. Multi-rate schedules and multi-rate timing functions are studied. The solution for multi-rate timing functions can be formulated as linear programming problems. Procedures are provided for mapping ADIOs onto multi-rate VLSI systems. Examples are provided to illustrate the synthesis of MRAs from DAREs and ADIOs. The first major contribution of this dissertation is the development of the concrete, executable MRA architectures. The second is the introduction of MCS system and its application in the development of the theory for synthesizing MRAs from original algorithmic specifications. / Graduation date: 1995

No description available.

Thesis (doctoral)--Technische Universität, Kaiserslautern, 2003. / "'infix' is a joint imprint of Akademische Verlagsgesellschaft Aka GmbH and IOS Press BV (Amsterdam)"--T.p. verso. Includes bibliographical references and index.

Thesis (Ph. D.)--Illinois State University, 2001. / Title from title page screen, viewed April 25, 2006. Dissertation Committee: Cynthia W. Langrall (Chair), Graham A. Jones, Tami S. Martin, Patricia H. Klass. Includes bibliographical references (leaves 138-146) and abstract. Also available in print.

No description available.