Facts and recommendations in this publication may no longer be valid. Please look for up-to-date information in the OSU Extension Catalog: http://extension.oregonstate.edu/catalog
Facts and recommendations in this publication may no longer be valid. Please look for up-to-date information in the OSU Extension Catalog: http://extension.oregonstate.edu/catalog
Parallel software development requires the flexibility to describe algorithms regardless of hardware specification, the ability to accommodate existing applications. and maintainability throughout the software life cycle. We propose the following model to address these issues. Our model incorporates aspects of the object-oriented and large grain data flow programming paradigms, and...
We describe our third generation C* compiler for a hypercube multicomputer. This production quality compiler features a full implementation of the language, including general pointer-based communication and support for separate compilation. The compiler incorporates new optimizations and utilizes an improved set of communication primitives. It supports a variety of standard...
This paper describes HelpDez, a colored-Petri-net-based approach for the design, simulation, and construction of hypermedia help systems. The storage model, system capabilities, and user interface model of a hypermedia help system are examined. Colored Petri nets are chosen to model hypermedia help systems due to their graphical expressiveness and their...
This paper describes an analysis tool that extracts complexity metrics from Program Design Language (PDL) as contained in design specification documents. The tool analyzes pseudocode and computes token-count metrics of PDL complexity on a module by module basis. We used the tool to measure consistency within and across modules and...
This paper develops a new model of software maintenance based upon an objective decision rule which determines whether a given software module can be effectively modified, or if it should instead be rewritten. Completely rewriting a module can be expensive, but it can be even more expensive if the module's...
The performance of the error backpropagation (BP) and ID3 learning algorithms was compared on the task of mapping English text to phonemes and stresses. Under the distributed output code developed by Sejnowski and Rosenberg, it is shown that BP consistently out-performs 1D3 on this task by several percentage points. Three...
Large integer factorization exemplifies a class of hard computational problems requiring the power of a supercomputer but which have algorithms decomposable into many large independent computations. The availability of internetworking provides the opportunity to solve such problems in distributed fashion on ordinary machines. Such a distributed network might contain a...
It often makes sense to write a program in the SIMD style, even if the program is to execute on a MIMD computer. Simulating physical events, in which all motion takes place simultaneously, is one area in which SIMD languages fit the applications particularly well. In this paper we present...