ppxscal/embedding_network huggingface dataset:
Graceful preemption for multi-link link layer protocols
Authors: M. Wm. Beckner, T. J. J. Starr
Venue: Proceedings of the eighth symposium on Data communications (1983)

This paper discusses a powerful priority mechanism that can be used on a physical communication medium supporting multiple, independent, logical data links. This scheme allows a high priority message to immediately interrupt a lower priority message which is in the process of being transmitted, and yet will not require the retransmission of the first part of the lower priority message; hence, the term graceful preemption. Graceful preemption may be extended to furnish multiple priority levels similar to existing processor interrupt structures which implement multiple levels. This protocol may serve a single processor which handles several different processes, or several independent stations that share a common bus. Hence, priority levels can be enforced without the need for a centralized bus &ldquo;master&rdquo; or &ldquo;arbitrator&rdquo; unit. As an example, the application of graceful preemption to the Integrated Services Digital Network (ISDN) link access procedure, LAPD, is discussed.
Software reliability and design: A survey
Authors: Peter Freeman
Venue: Proceedings of the 13th Design Automation Conference (1976)

This paper begins with an examination of the nature of software reliability, noting that two facets of reliability (correctness and robustness) are often confused. A brief survey is given of current attempts to improve program correctness and develop mechanisms that provide robustness. Starting from a discussion of the distinction that should be (but often isn't) drawn between design and programming, we identify six trends in software design that can be expected to impact significantly our ability to achieve reliable software. The paper closes with a brief discussion of the impact of software design automation on reliability.
Distribution of cryogenic liquids in a multi-plant system
Authors: John C. Loose
Venue: Proceedings of the second conference on Applications of simulations (1968)

The business of manufacturing and distributing cryogenic liquids is not unlike many other industries in that production methods are well advanced and fairly standard. The competitive edge, if it is to be found, is more likely realized in better planning and in improved efficiency in the costly product distribution system. And, it is in this area that significant success with computer simulation models has been achieved. This paper is a case study of the application of computer simulation techniques to long-range and short-range planning. The model described was developed to aid in investment planning and to provide a test vehicle for evaluating new ideas in product distribution. It is a particularly interesting model for discussion because it combines, for perhaps the first time in a single program, two of the most successful tools of operations research: simulation and linear programming.
The changing role of the EDP manager
Authors: David R. Callaghan
Venue: Proceedings of the ACM '81 conference (1981)

This paper attempts to explain the difficulties of managing a growing EDP resource and why the manager must change his managerial style as the resource expands. The primary vehicle for this explanation will be a combination of role theory as developed by Kahn and Wolfe, Kahn et al., and others with the stage hypothesis of computer center growth as developed by Nolan. This combination will show that as the computer center grows, the role that the EDP manager plays in the organization will change, requiring an appropriate change in managerial style. The model serves to explain why there is high turnover in EDP management because of the EDP manager's inability to change his managerial style as his role changes.
Computer Science Programs at Universities Awarding the Ph.D. Degree
Authors: Lloyd D. Fosdick
Venue: Proceedings of the twelfth annual SIGCPR conference (1974)

This paper discuss's on the Computer Science Programs at Universities Awarding the Ph.D. Degree
Instructional databases in APL
Authors: Cecil E. Denney, Ronald E. Converse
Venue: Proceedings of the eighth international conference on APL (1976)

This paper deals with the discovery of educational &ldquo;structures&rdquo; during the process of creating an instructional database system in APL for the direct use of teachers for preparing individually oriented student study guides and evaluation materials. The paper deals with the educational setting, identified needs, development process, role of APL and the resulting Curriculum Materials Management System.
Analytical models for an Ethernet-like local area network link
Authors: Madhav Marathe, Sujit Kumar
Venue: ACM SIGMETRICS Performance Evaluation Review (1981)

Ethernet -like local area network links have been studied by a number of researchers. Most of these studies have involved extensive simulation models operating at the level of individual packets. However, as we begin building models of systems built around such links, detailed simulation models are neither necessary, nor cost-effective. Instead, a simple analytical model of the medium should be adequate as a component of the higher level system models. This paper discusses a number of analytical models and identifies a last-in-first-out M/G/1 model with slightly increased service time as one which adequately captures both the mean and the coefficient of variation of the response time. Given any offered load, this model can be used to predict the mean waiting time and its coefficient of variation. These two can be used to construct a suitable 2 stage hyperexponential distribution. Random numbers can then be drawn from this distribution for use as waiting times of individual packets.
Towards a family of languages for the design and implementation of machine architectures
Authors: Subrata Dasgupta, Marius Olafsson
Venue: Proceedings of the 9th annual symposium on Computer Architecture (1982)

In recent years, increases in complexity of hardware/firmware systems, and the concern for systems reliability have resulted in growing interest in methodologies and tools for the design, description and verification of computer systems. A vital component of any such design methodology is the language used for representing the design. In the case of particularly complex systems the design process may involve a succession of stages each of which represents the system at a particular level of abstraction. In such situations several languages may be required, each suited to a particular level of abstraction. We present here, one such family of languages, consisting at present of two members, S*A, an architectural description language, and S*, a high level microprogramming language schema. These closely related (&ldquo;kin&rdquo;) languages may be used collaboratively for the systematic, top-down development of an architecture, down to the microcode level. The resulting descriptions of the architecture provide, in addition, a complete unified document of the multilevel design process.
The user services profession
Authors: William W. McMillan
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

As a profession develops, its members tend to formalize the definition of the profession's scope, the educational requirements and ethical standards for the practitioner, and, in some cases, certification procedures. This will happen to user services if the profession continues to exist with a fair measure of distinction from mainstream computer science and from applied computing. As the number of user services people employed under the title &ldquo;programmer&rdquo; decreases, and the number employed as &ldquo;consultant,&rdquo; &ldquo;writer,&rdquo; or similar titles increases, people both inside and outside of the profession will begin thinking about what a user services person is and where he or she should come from. In this paper, I suggest that we begin thinking now about some formal issues concerning the profession, such as the skills needed to practice it and the requirements that should be met to enter it. Admittedly, this is an early stage of development at which to discuss these issues, but I encourage it for two reasons. First, we should prevent over-formalization that would spoil the character of the profession. Second, we should develop some mechanisms now to advance the personal growth of user services professionals.
An interactive system for proving theorems in the predicate calculus
Authors: Jacques Cohen, Ann Rubin
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

This paper describes an interactive system for proving theorems in the first order predicate calculus. The system utilizes Jeffrey's tree method, a variant of Beth's method of semantic tableaux, which lends it self well to a man-machine interactive type of implementation. The method also permits one to separate clearly the basic problems involved in automatic theorem proving from those of devising suitable heuristics to obtain a proof. The latter can be superimposed on the basic system at a later stage by means of a strategy language. This paper places special emphasis on a detailed description of programs involved. The system is operational on a small computer.
Efficient message routing in Mega-Micro-Computer networks
Authors: Larry D. Wittie
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

With rapidly developing microprocessor technology, we can anticipate an entire microcomputer being contained on a single, low-cost LSI chip. It will be technically and economically feasible to interconnect thousands or millions of these microcomputers to form a very large and powerful machine&mdash;a Mega-Micro-Computer (MMC). This paper defines a system of interlocking buses allowing dense message flow within an MMC. Each microcomputer shares two buses; each bus is shared by sixteen computers. There is a simple algorithm for optimal routing of messages. Data activity on each bus is analytically determined as a function of network size and the spatial distribution of messages between nodes. MMCs are about equally efficient whether connected by buses or by Pierce rings. For equal line costs, an MMC can allow 200 times denser message flow than a million computer network structured like Illiac IV.
Development tools for user microprogramming
Authors: Steven Geyer, Anthony Lake
Venue: ACM SIGMICRO Newsletter (1981)

Software tools used to develop microcode for the BBN Microprogrammable Building Block have been implemented using standard software engineering and language development utilities. The major microcode development tools include a microassembler, multi-task operating system, and debugging packages. Important aspects of these and other development tools are the functional, user interface and structural characteristics.
Computers and the improvement of writing
Authors: Colette Daiute, Robert Taylor
Venue: Proceedings of the ACM '81 conference (1981)

Writing with a computer text editor can simplify and enhance the writing process and product. This paper discusses how some recent research on writing can guide use of the text editor to improve writing and to make it more enjoyable. The context of the discussion is formal writing instruction in courses at Teachers College. This new writing tool seems to make the writing process different in critical ways that decrease the psychological and physical constraints in writers.
A new approach to an adaptive computer&mdash;an automatic recovery mechanism to prevent the occurrence of subtract errors
Authors: Ken Sakamura, Koichi Nakano, Yoshio Kato, Hideo Aiso
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

This paper deals with an automatic recovery mechanism designed to prevent the occurrence of subtract errors at the computer architecture level. This mechanism always detects the occurence of subtract errors whenever addition or subtraction is performed. If a subtract error is detected, backtracking to a certain location is carried out, and from there recomputing is performed in order to realize the required precision. An adaptive algorithm required for this mechanism is described in detail. An experimental adaptive computer was implemented on a Burroughs B1700. The evaluation of the experiments proves that the inherent possibilities of dynamic microprogramming play a very important role in realizing this mechanism, and that the proposed mechanism will be useful for the development of future high-level computer systems.
DIRECT - a multiprocessor organization for supporting relational data base management systems
Authors: David J. DeWitt
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

The design of DIRECT, a multiprocessor organization for supporting relational data base management systems is presented. DIRECT has a MIMD (multiple instruction stream, multiple data stream) architecture. It can simultaneously support both intra-query and inter-query concurrency. The number of processors assigned to a query is dynamically determined by the priority of the query and the size of the relations it references. The size of a relation is not limited to that of the associative memory as in some previous data base machines. Concurrent updates are controlled through address translation tables which are maintained by a controlling processor. DIRECT is being implemented using LSI-11/03 microprocessors and CCD memories which are searched in an associative manner. A novel cross-point switch is used to connect the LSI-11 processors to the CCD memories. While cross-point switches have proven too expensive for use in general purpose parallel processors, their application in DIRECT demonstrates that these switches can be successfully used in specialized applications.
T01A-programming languages: T01A3-Readability and GOTO-free programming
Authors: Dennis Bunde
Venue: Proceedings of the 2nd annual computer science conference on Program information abstracts (1974)

Readability in computer language design is important to facilitate the communication of algorithms between users, in debugging, and in program modification. Reading for comprehension involves forming an internal model of what is being said. Both program proving and program reading involve manipulating this model. In order for the human to apply operators to this model, it is necessary to remember it. There is a psychological cost associated with remembering the model. This cost is an increasing function of the human memory load. Two results consistent with this view are: I. Minimizing the scope of variables, labels, and functions increases the readability of programs. 2. The control structure of the optimally readable language is neither completely GOTO-free nor completely GOTO structured.
A parallel bit map processor architecture for DA algorithms
Authors: Tom Blank, Mark Stefik, Willem vanCleemput
Venue: Proceedings of the 18th Design Automation Conference (1981)

Bit maps have been used in many Design Automation (DA) algorithms such as printed circuit board (PCB) layout and integrated circuit (IC) design rule checking (DRC). The attraction of bit maps is that they provide a direct representation of two-dimensional images. The difficulty with large scale use of bit maps (e.g., for DRC on VLSI) is that the large amounts of data can consume impractical amounts of computation on sequential machines. This paper describes a processing architecture that is specifically designed to operate on bit maps. It has an inherently two-dimensional construction and has a very large parallel processing capability. Also included in this paper are descriptions of algorithms that exploit the architecture. Algorithms for routing, DRC, and bit vector manipulation are included.
Man-machine communications in the biological-medical research environment
Authors: William E. Farley, Alfred H. Pulido, Tate M. Minckler, Lee D. Cady,  Jr.
Venue: Proceedings of the 1966 21st national conference (1966)

The key source of raw data in most biomedical research is the patient's medical record. The hospital patient medical record is most commonly thought of as the repository for all pertinent facts relating to laboratory test results, diagnostic conclusions, treatment procedures, and observations. Depending on the nature of the patient's complaint, there are varying amounts of medical history information incorporated into the record. In many instances, the compilation of the record has become so routine that little thought is given to its potential value as a medical research tool. Ideally, the medical record would serve the clinician during treatment of the patient and when no longer needed by him would pass to the researcher to be associated with other similar records for statistical analysis. Obviously, the method presently used would satisfy both of these needs to only a limited extent.
Teaching declarative programming
Authors: J. M. Adams
Venue: ACM SIGCSE Bulletin (1975)

At the Conference on Programming Methodology in January 1974 at Albuquerque, New Mexico Prof. Edsger Dijkstra described a method of program development in which the imperative form of a program is developed from the assertions which form the correctness proof. In other words the declarative (or non-procedural) aspect of an algorithm guides its implementation into an imperative (or procedural) form. While extremely exciting, this methodology is rather alien to those with traditional training in the imperative method of program development. Since this encompasses almost everyone including most instructors and students, a problem arises in introducing the methodology into the standard computer science curriculum. This paper describes our approach to the problem at New Mexico State and the results.
A digital communication network for computers giving rapid response at remote terminals
Authors: D. W. Davies, K. A. Bartlett, R. A. Scantlebury, P. T. Wilkinson
Venue: Proceedings of the first ACM symposium on Operating System Principles (1967)

Those computer applications which involve rapid response to events at distant points create special problems in digital communication. Such applications are increasing in number, and could increase more rapidly if better solutions existed to the communication problems. The present-day methods for communication of data in rapid-response systems employ 'private wires' for the transmission paths or, where the available data rate and reliability is sufficient, employ voice channels from the switched telephone network. Given these rather arbitrary transmission facilities the user adds the terminal equipment necessary to make a communication system and sometimes integrates a number of paths into a private network.
Manufacturing applications
Authors: M. J. Maggard, W. G. Lesso, G. L. Hogg, D. T. phillips, Carter L. Franklin,  II, J. Douglas DeMaire, M. M. Patel, J. M. Panchal, M. T. Coughlin, Willaim L. Berry
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The objective of this session is to bring together a wide range of new concepts in manufacturing simulation to stimulate discussion and interest. The concepts involve the strategic and tactical decisions that are made during the course of a successful application in the manufacturing environment. Strategic aspects revolve around the selling of results to management. Tactical considerations include the scope of modeling detail and in the simulation model. The over-all goal of the papers and discussion is to provide a systematic foundation for analysts to draw from during the development of practical applications. Tactical considerations are concerned with the step-by-step abstraction of the simulation model from the real-world environment, and include setting the level of detail with the model as well as choosing an appropriate language.
APL two by two-syntax analysis by pairwise reduction
Authors: J. D. Bunda, J. A. Gerth
Venue: Proceedings of the international conference on APL (1984)

Benkard explains the precedence rules of APL with a syntactic binding hierarchy [1,2]. This paper uses the hierarchy as a basis for developing a more formal description of APL syntax which can be applied directly in a syntax analyzer. The flexibility of this approach makes it useful as a basis for examining the effect of proposed syntax changes and the consequences of previous design choices.
The Multics Input/Output system
Authors: R. J. Feiertag, E. I. Organick
Venue: Proceedings of the third ACM symposium on Operating systems principles (1971)

An I/0 system has been implemented in the Multics system that facilitates dynamic switching of I/0 devices. This switching is accomplished by providing a general interface for all I/O devices that allows all equivalent operations on different devices to be expressed in the same way. Also particular devices are referenced by symbolic names and the binding of names to devices can be dynamically modified. Available I/0 operations range from a set of basic I/0 calls that require almost no knowledge of the I/O System or the I/0 device being used to fully general calls that permit one to take full advantage of all features of an I/O device but require considerable knowledge of the I/0 System and the device. The I/O System is described and some popular applications of it, illustrating these features, are presented.
A review of human factors research on programming languages and specifications
Authors: Bill Curtis
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

This paper presents a partial review of the human factors work on computer programming. It begins by giving an overview of the behavioral science approach to studying programming. Because of space limitations this review will concentrate on cognitive models of programmer problem solving and the experimental research on language characteristics and specification formats. Areas not reviewed include debugging, programming teams, individual differnces, and research methods. The conclusions discuss promising directions for future theory and research.
Education, training and technology transfer in software engineering (Panel Discussion)
Authors: C. Floyd, I. Stinson, T. Straeter, A. Wasserman
Venue: Proceedings of the 4th international conference on Software engineering (1979)

Formal education and professional training, even re-training, are becoming the central issue of software engineering, as computers become employed in almost every organized human activity. Professional know-how of any kind today must be combined with some computer skill. Equally importantly, new ideas, tools and techniques developed in laboratories must be applied to improve quality of software and reduce cost of programming. This demands a smooth flow of technology which in turn requires informed and educated minds to absorb novelty. Without them applied technology remains stagnant and accumulated research ideas unused.
A structure for interprocess communication in a data communications handler
Authors: H. F. Tibbals
Venue: Proceedings of the 1976 annual conference (1976)

The use of an implementation which models a simple single server queuing system to control transfers between processes in a communications handler is described. Exchanges between processes are carried by three word elements, called LINKs, which are used to transfer control information and to assign data to processes. The managements of interactions by the single queue structure is used to coordinate parallel, time-independent operation of the attached processes, with the interface provided by the LINKs giving a simple yet flexible interface between activities. The implementation is a special purpose operating system designed for use in a PDP-11 computer dedicated to handling transfers of control and data between a number of communicating processes, which are connected to the PDP-11 by communications lines, direct memory access interfaces and shared memory.