bluuebunny/crossref_metadata_2025_split huggingface dataset:
Prototyping
Authors: Spiegel Mitchell G. 
Published: January 2007

This paper describes prototyping, a state-of-the-art methodology to assist a design team in making a through definition and analysis of new requirements, feasibility, alternative selections, workload impact, system and/or application specification, implementation, and testing. Suggested prototype tools and techniques are presented, and guidance is included to aid a design team in obtaining accurate and timely results. This paper is not intended to be a complete text on design. It should be enhanced with a design team's expertise, consultation from sources with design experience, and reference to other design literature.
Prototyping is a process (the act, study, or skill) of modeling an information-communication system architecture in one or more levels of detail, using descriptive models, abstract models, and working models of the system and its component parts (synonym: archetyping).
This work was completed while the author was working with prior employers.
Project implementation of Software Configuration Management
Authors: Fredrick C. R. 
Published: January 2007

Have you or one of your programmers said: “The system ran yesterday; I only changed one line.” or “I spent my budget, but I'm not done.” or “I fixed that problem yesterday, but it's back now.” or “I thought it would be a nice feature for the operator, so I added it to the program.” or “Why was this line of code changed? Who did it and when?”?
If these or other similar statements are familiar, then Software Configuration Management is a subject that should interest you. Software Configuration Management (SCM) is a management method that establishes a discipline for the software development process and provides visibility to that process.
The step by step procedures used by a large software organization to resolve some of their development problems will be followed here. The result of their efforts was the formulation of a management method that significantly improved the quality of their software products and reduced the costs. It was learned later that other software organizations had gone through similar processes and arrived at similar results. This new tool is now known as Software Configuration Management.
Adaptive search techniques applied to software testing
Authors: Benson J. P. 
Published: January 2007

An experiment was performed in which executable assertions were used in conjuction with search techniques in order to test a computer program automatically. The program chosen for the experiment computes a position on an orbit from the description of the orbit and the desired point.
Errors were interested in the program randomly using an error generation method based on published data defining common error types. Assertions were written for program and it was tested using two different techniques. The first divided up the range of the input variables and selected test cases from within the sub-ranges. In this way a “grid” of test values was constructed over the program's input space.
The second used a search algorithm from optimization theory. This entailed using the assertions to define an error function and then maximizing its value. The program was then tested by varying all of them. The results indicate that this search testing technique was as effective as the grid testing technique in locating errors and was more efficient. In addition, the search testing technique located critical input values which helped in writing correct assertions.
SOFTDOC - A system for automated software static analysis and documentation
Authors: Sneed H. 
Published: January 2007

The code itself is useless without adequate documentation. Besides that it is almost impossible to validate and verify code unless it is properly documented. Yet most of the attention of the past has been devoted to producing code and little to producing the documentation although it is obvious that it is necessary both for testing and maintaining the software product.
Software documentation can be classified according to its usage. Thus, there is a functional documentation for describing what a system does and what it is used for, and technical documentation for describing how the software is constructed and how it performs its functions. The former is directed toward the user, the latter toward the tester and maintainer. The two are, however, highly interrelated. Since the programmer seldom writes the user documentation it is necessary for those who describe what the system does, to know how it does it. An accurate technical documentation is a prerequisite for producing accurate user documentation. Finally it serves yet another purpose. Without it, it is not possible to control the quality of the software. Software Quality Control presupposes a full and up to date technical description in order to assess the characteristics of the system such as modularity, portability, reliability, etc.
Analytic modelling of disk I/O subsystems
Authors: Lazowska Edward D. , Zahorjan John 
Published: January 2007

This is a summary of a tutorial presented during the conference discussing a number of approaches to representing disk I/O subsystems in analytic models of computer systems.
As in any analytic modelling study, the fundamental objective in considering an I/O subsystem is to determine which devices should be represented in the model, and what their loadings should be. The device loadings represent the service required by jobs, and are the basic parameters needed by the computational algorithm which calculates performance measures for the model. To set these parameters, knowledge of service times at the various devices in the I/O subsystem is required.
The tutorial begins by distinguishing analytic modelling from alternative approaches, by identifying the parameter values that are required for an analytic modelling study, and by explaining the role of the computational algorithm that is employed (Denning & Buzen [1978] provide a good, although lengthy, summary).
We then consider a sequence of models of increasingly complex I/O subsystems.
Next we discuss I/O subsystems with rotational position sensing.
We then discuss approaches to modelling shared DASD, emphasizing hierarchical techniques in which highlevel models of each system can be analyzed in isolation. We also mention recent techniques for modelling complex I/O subsystems involving multipathing.
Finally, we discuss the analysis of I/O subsystems based on broadcast channels such as Ethernet.
Performance of globally distributed networks
Authors: Wecker Stuart , Gordon Robert , Gray James , Herman James , Kanodia Raj , Seligman Dan 
Published: January 2007

In the design and implementation of computer networks one must be concerned with their overall performance and the efficiency of the communication mechanisms chosen. Performance is a major issue in the architecture, implementation, and installation of a computer communication network. The architectural design always involves many cost/performance tradeoffs. Once implemented, one must verify the performance of the network and locate bottlenecks in the structure. Configuration and installation of a network involves the selection of a topology and communication components, channels and nodes of appropriate capacity, satisfying performance requirements.
This panel will focus on performance issues involved in the efficient design, implementation, and installation of globally distributed computer communication networks. Discussions will include cost/performance tradeoffs of alternative network architecture structures, methods used to measure and isolate implementation performance problems, and configuration tools to select network components of proper capacity. The panel members have all been involved in one or more performance issues related to the architecture, implementation, and/or configuration of the major networks they represent. They will describe their experiences relating to performance issues in these areas. Methodologies and examples will be chosen from these networks in current use. There will be time at the end of the session for questions to the panel.
Systems aids in determining Local Area Network performance characteristics
Authors: Sternick Barbara R. 
Published: January 2007

At Bethesda, Maryland, the National Library of Medicine has a large array of heterogenous data processing equipment dispersed over ten floors in the Lister Hill Center and four floors in the Library Building.
The National Library of Medicine decided to implement a more flexible, expansible access medium (Local Area Network (LAN) to handle the rapid growth in the number of local and remote users and the changing requirements. This is a dual coaxial cable communications system designed using cable television (CATV) technology. One cable, the outbound cable, transfers information between the headend and the user locations. The other cable, the inbound cable, transfers information from the user locations to the headend. This system will permit the distribution of visual and digital information on a single medium.
On-line devices, computers, and a technical control system network control center are attached to the LAN through BUS Interface Units (BIUs). The technical control system will collect statistical and status information concerning the traffic, BIUs, and system components. The BIUs will, at fixed intervals, transmit status information to the technical control. The Network Control Centers (NCC) will provide network directory information for users of the system, descriptions of the services available, etc. A X.25 gateway BIU will interface the LAN to the public networks (Telenet and Tymnet) and to X.25 host computer systems.
Distinguishing the potential operands in FORTRAN programs
Authors: Estes George E. 
Published: January 2007

There are several possible relationships between the number of potential operands and the actual operands used which correlate with available data (such as Akiyama's debugging data). However, additional data is required to distinguish between these hypotheses. Since there is a large body of programs available written in FORTRAN, we wish to develop a mechanical counting procedure to enumerate potential operands in FORTRAN programs.
We are currently developing counting rules for these potential operands. Sub-routine parameters and input/output variables are relatively easy to identify. However, a number of FORTRAN features, such as COMMON blocks and EQUIVALENCE'd variables introduce serious complications. Some additional analysis of usage or heuristic approaches are required to differentiate potential operands in these situations.
An application of software science to the quantitative measurement of code quality
Authors: Naib Farid A. 
Published: January 2007

The error rate of a software application may function as a measure of code quality. A methodology has been developed which allows for the accurate prediction of the error rate and hence code quality prior to an application's release.
Many factors were considered which could conceivably be related to the error rate. These factors were divided into two categories: those factors which vary with time, and those factors which do not vary with time. Factors which vary with time were termed environmental factors and included such items as: number of users, errors submitted to date, etc. Factors which do not vary with time were termed internal factors and included Halstead metrics, McCabe metrics and lines of code.
A file organization for cluster-based retrieval
Authors: Croft W. Bruce 
Published: January 2007

A file organization for cluster-based retrieval is presented and tested. This file organization is based on the bottom-up search which, in contrast to the more usual top-down search, starts at the lowest level of a cluster hierarchy (the documents) and looks at progressively larger clusters. This approach enables most of the efficiency problems previously associated with clustered file organizations to be avoided. There are two parts to this file organization - a compact cluster hierarchy representation which does not store cluster representatives and a compact inverted file which is used to provide a starting point for the bottom-up search.
Retrieval experiments show that the bottom-up search using this file organization can be more effective than a serial search, especially if high precision results are required.
Small business system performance analysis
Authors: Dyal James O. , DeWald William 
Published: January 2007

This paper presents results from the performance simulation study of a small business-oriented computer system. The system, SPERRY UNIVAC BC/7-700, is commercially available in the configuration modeled and in other higher performance models. All BC/7 systems modeled are supported with highly interactive applications software systems.
The model is parameterized to select one or more workstations and one or more cartridge disks. File allocations are by cylinder. Seek times are computed by remembering the position of each movable arm. References are randomized within each file, but the sequence in which files are accessed is controlled by the application logic, in conjunction with the number of line items/order. Most event times are not constant, but the result of drawing randomly against empirical distributions with specified mean and standard deviation.
For this study, the system simulated is composed of a single work-station running the highly interactive on-line version of a sophisticated order entry application package. Principal performance measures are system throughput and response time, including operator action times.
It is found that, in the single workstation environment, performance is very cost effective in this highly competitive part of the information system market.
Data base processor mage
Authors: Sabbatel G. Berger 
Published: January 2007

In this paper, we present the design of data base processor MAGE. This DBP is based on a hierarchical DB access method. It is composed of two microprocessors, a disk processor and a moving head disk. The processor requirements, design decisions, and architecture are discussed.
We start with an overview of DBP framework. The MAGE DB access method is then summarized. Finally, we present the design and implementation of the DBP, with a particular emphasis on the disk processor.
A LISP machine
Authors: Greenblatt Richard D. , Knight Thomas F. , Holloway John T. , Moon David A. 
Published: January 2007

LISP is the second oldest computer-programming language still in active use. Our implementation is based on a powerful microprogrammed processor designed specifically for LISP. This processor supports a tagged macro-architecture; it manipulates items which have a built-in data-type field.
The system supports several important new storage-management features, including a real-time garbage collector with hardware assist (using the basic algorithm of Baker).
The software itself is written in LISP to a much larger extent than in previous systems. In fact, there are only two levels in which code is written: LISP and microcode. Among other things this improves the consistancy of system interfaces.
The system design incorporates the personal computer philosophy. We believe the personal computer will predominate in the future since it is preferable to time-sharing in most cases and technological trends are greatly reducing its cost penality. In the case of very large programs, the personal computer can be cost-effective today, due to the phenomenon of thrashing encountered in time-sharing systems.
The Burroughs B1800 microprogrammed measurement system
Authors: Denny W. Michael 
Published: January 2007

Traditional computers are not usually effective assistants in their own measurement.
It is cost-prohibitive to dedicate much of the hardware to measurement. And, when any is dedicated, it is usually too rigidly attached to the hardware itself to follow the rapidly changing software structures.
Software measurement tools, on the other hand, often exhibit overhead penalties and usually remain tools for a few elite “system” programmers. The majority - programming in “non system” languages like COBOL, FORTRAN, and RPG - look to these “experts” for analysis of their own programs' performance.
The B1800 utilizes a hybrid measurement approach which retains many of the advantages of traditional hardware and software monitoring while avoiding the rigidity of hardware-only measurements and the overhead of software-only measurements. This hybrid system is easily implemented in ordinary high level languages like COBOL, RPG, and FORTRAN and easily used by non-system programmers.
Design considerations for a QM-1 based multimicroprocessor emulation system
Authors: Crocker Steve 
Published: January 2007

Microprocessors, which are now readily available, are being used in the design of many systems. Soon avionic systems will be designed that use many microprocessors working together. Systems based on multiple microprocessors (MMP) will be designed to offer higher throughput and/or higher reliability than uniprocessor systems.
There are now very few design tools to aid in developing or evaluating proposed microprocessor systems. One highly useful tool is an emulation facility for modeling, testing, and measuring proposed MMP systems.
Convolutional bound hierarchies
Authors: Stephens Lindsey E. , Dowdy Lawrence W. 
Published: January 2007

The time required to find the exact solution of a product-form queueing network model of a computer system can be high. Faster and cheaper methods of solution, such as approximations, are natural alternatives. However, the errors incurred when using an approximation technique should be bounded.
Several recent techniques have been developed which provide solution bounds. These bounding techniques have the added benefit that the bounds can be made tighter if extra computational effort is expended. Thus, a smooth tradeoff of cost and accuracy is available. These techniques are based upon mean value analysis. In this paper a new bounding technique based upon the convolution algorithm is presented. It provides a continuous range of cost versus accuracy tradeoffs for both upper and lower bounds. The bounds produced by the technique converge to the exact solution as the computational effort approaches that of convolution. Also, the technique may be used to improve any existing set of bounds.
Multiple class memory constrained queueing networks
Authors: Lazowska Edward D. , Zahorjan John 
Published: January 2007

Most computer systems have a memory constraint: a limit on the number of requests that can actively compete for processing resources, imposed by finite memory resources. This characteristic violates the conditions required for queueing network performance models to be <i>separable,</i> i.e., amenable to efficient analysis by standard algorithms. Useful algorithms for analyzing models of memory constrained systems have been devised only for models with a single customer class.
In this paper we consider the multiple class case. We introduce and evaluate an algorithm for analyzing multiple class queueing networks in which the classes have independent memory constraints. We extend this algorithm to situations in which several classes share a memory constraint. We sketch a generalization to situations in which a subsystem within an overall system model has a population constraint.
Our algorithm is compatible with the extremely time- and space-efficient iterative approximate solution techniques for separable queueing networks. This level of efficiency is mandatory for modelling large systems.
An integrated productivity, training, and performance planning/appraisal framework
Authors: Rouse R. A. 
Published: January 2007

Improving the productivity of computer personnel requires an integrated view of the factors which promote effective and efficient work. Motivation, training, performance planning, and productivity are so closely interrelated that to attack them individually results in initiatives which often conflict with one another and lead to confusion of ends by professional personnel. Successful integration of these factors results in a management style and organizational form that supports the accomplishments of productive work.
The framework identifies five major areas contributing to performance and behavior: personal effort, knowledge and skills, attitudes and values, environment, health, and sense of direction. These areas define the impact of training, personal development, management style, project control, performance planning, and job/goal direction-setting on performance and behavior.
The framework also identifies five outcomes of work performance and behavior: rewards, costs, appraisal, equity, and satisfaction. The roles played by reward strategies, appraisal techniques tied to performance planning, and personal job costs to the worker are placed in a unified concept.
The framework provides a view of how to make these factors work together to improve productivity.
Data processing personnel career development implies the exercising of a specific plan within a structured environment. Career development should allow an individual to start as a programmer trainee or anywhere in the hierarchy of the group and progress to appropriate levels of responsibility, authority, and pay that are commensurate with the individual's abilities and desires.
Career development is "GOOD BUSINESS" for the company and for the individual, as it provides for the development and optimal use of existing potential. It can provide significant contributions to productivity improvement and at the same time reduce retention problems. If a career development program is to work, it must be pragmatic. First, it has to be developed and implemented within the environment of each individual company. Second, it has to have sufficient flexibility to allow for the specific career requirements of each individual. This "tall order" has been met with varying degrees of success.
This case study is intended to provide one example of how career development can and does work for the Missouri Pacific Railroad computer professional.
A role of a user in the development and maintenance of an information system
Authors: Järvinen Pertti 
Published: January 2007

This paper comprises two parts. The first describes results from the empirical follow-up study. This study concerns the change-over and early use periods of new application software. After one year's experience in usage of a computer system we organize a programming course for users. Our findings encourage to give users more responsibility in systemeering. Most clerks passed the program comprehension test and some of them constructed small simple programs.
The second part comprises a consideration of various systemeering models. Much attention is paid to participation of users in different systemeering tasks. Also a short post-analysis is made concerning the role of the user. Various degrees of participation are identified.
Evaluating the user interface
Authors: Lund Michelle A. 
Published: January 2007

In the development of a new interactive graphics application, considerable effort was spent on designing a user interface which would be easy to use. When a portion of the application was completed, typical potential users were brought in to help evaluate the interface. They were given a sample task and a short introduction to the application; then their efforts to complete the task were observed and videotaped.
This method of evaluating the user interface provided the development staff with quite a bit of valuable information. Changes were made, and more testing was done, including using some subjects for a second time.
This paper describes how this evaluation method was used for two purposes: to point out problem areas in the interface, and to verify that changes made have improved the user interface.