A Concurrent Smalltalk Compiler for the Message-Driven Processor

This thesis describes Optimist, an optimizing compiler for the Concurrent Smalltalk language developed by the Concurrent VLSI Architecture Group. Optimist compiles Concurrent Smalltalk to the assembly language of the Message-Driven Processor (MDP). The compiler includes numerous optimization techniques such as dead code elimination, dataflow analysis, constant folding, move elimination, concurrency analysis, duplicate code merging, tail forwarding, use of register variables, as well as various MDP-specific optimizations in the code generator. The MDP presents some unique challenges and opportunities for compilation. Due to the MDP's small memory size, it is critical that the size of the generated code be as small as possible. The MDP is an inherently concurrent processor with efficient mechanisms for sending and receiving messages; the compiler takes advantage of these mechanisms. The MDP's tagged architecture allows very efficient support of object-oriented languages such as Concurrent Smalltalk. The initial goals for the MDP were to have the MDP execute about twenty instructions per method and contain 4096 words of memory. This compiler shows that these goals are too optimistic -- most methods are longer, both in terms of code size and running time. Thus, the memory size of the MDP should be increased.

Concurrent Smalltalk on the Message-Driven Processor

Concurrent Smalltalk is the primary language used for programming the J- Machine, a MIMD message-passing computer containing thousands of 36-bit processors connected by a very low latency network. This thesis describes in detail Concurrent Smalltalk and its implementation on the J-Machine, including the Optimist II global optimizing compiler and Cosmos fine-grain parallel operating system. Quantitative and qualitative results are presented.

A Theory of Quantitative Inference Applied to a Mechanical Design Compiler

This thesis presents the ideas underlying a computer program that takes as input a schematic of a mechanical or hydraulic power transmission system, plus specifications and a utility function, and returns catalog numbers from predefined catalogs for the optimal selection of components implementing the design. Unlike programs for designing single components or systems, the program provides the designer with a high level "language" in which to compose new designs. It then performs some of the detailed design process. The process of "compilation" is based on a formalization of quantitative inferences about hierarchically organized sets of artifacts and operating conditions. This allows the design compilation without the exhaustive enumeration of alternatives.

Lean Transition of Emerging Industrial Capability

This volume of the final report documents the technical work performed from December 1998 through December 2002 under Cooperative Agreement F33615-97-2-5153 executed between the U.S. Air Force, Air Force Research Laboratory, Materials and Manufacturing Directorate, Manufacturing Technology Division (AFRL/MLM) and the McDonnell Douglas Corporation, a wholly-owned subsidiary of The Boeing Company. The work was accomplished by The Boeing Company, Phantom Works, Huntington Beach, St. Louis, and Seattle; Ford Motor Company; Integral Inc.; Sloan School of Management in the Massachusetts Institute of Technology; Pratt & Whitney; and Central State University in Xenia, Ohio and in association with Raytheon Corporation. The LeanTEC program manager for AFRL is John Crabill of AFRL / MLMP and The Boeing Company program manager is Ed Shroyer of Boeing Phantom Works in Huntington Beach, CA. Financial performance under this contract is documented in the Financial Volume of the final report.

Optimizing the Dynamic Distribution of Data-stream for High Speed Communications

The performances of high-speed network communications frequently rest with the distribution of data-stream. In this paper, a dynamic data-stream balancing architecture based on link information is introduced and discussed firstly. Then the algorithms for simultaneously acquiring the passing nodes and links of a path between any two source-destination nodes rapidly, as well as a dynamic data-stream distribution planning are proposed. Some related topics such as data fragment disposal, fair service, etc. are further studied and discussed. Besides, the performance and efficiency of proposed algorithms, especially for fair service and convergence, are evaluated through a demonstration with regard to the rate of bandwidth utilization. Hoping the discussion presented here can be helpful to application developers in selecting an effective strategy for planning the distribution of data-stream.

Lean Transition of Emerging Industrial Capability (LeanTEC)

Lean Transition of Emerging Industrial Capability (LeanTEC) program was a cooperative agreement between the Boeing Company and AFRL conducted from January 1998 to January 2002. The results of this program are documented in the Manual for Effective Technology Transition Processes included as an attachment to this report. This manual provides processes, procedures, and tools for greatly improving technology transition in the aerospace industry. Methodology for the implementation of these improvements is given along with methods for customizing the various processes, procedures, and tools for a given company or business unit. The indicated methodology was tested by the LeanTEC team and results are documented in the report.

Industrial Relations and "Humanware"

This is a preliminary paper. Please do not quote without the permission of the author. The research on which this paper is based has been conducted with the collaboration of John Paul MacDuffie, MIT. The researchers owe much to the warm cooperation of managers, employees, and union officials of Japanese auto companies and joint venture companies in the U.S. as well as American auto companies and the UAW. We would like to express our sincere appreciation for their assistance.

Optimizing Product Line Designs: Efficient Methods and Comparisons

We compare a broad range of optimal product line design methods. The comparisons take advantage of recent advances that make it possible to identify the optimal solution to problems that are too large for complete enumeration. Several of the methods perform surprisingly well, including Simulated Annealing, Product-Swapping and Genetic Algorithms. The Product-Swapping heuristic is remarkable for its simplicity. The performance of this heuristic suggests that the optimal product line design problem may be far easier to solve in practice than indicated by complexity theory.