ppxscal/embedding_network huggingface dataset:
Heart: An operating system nucleus machine implemented by firmware
Authors: N. Kamibayashi, H. Ogawana, K. Nagayama, H. Aiso
Venue: Proceedings of the first international symposium on Architectural support for programming languages and operating systems (1982)

This paper discusses the role of microprogramming in operating system design and shows several things: (1) advantages of the efficiency which may be gained from microcoded operating system primitives, (2) selecting the most appropriste primitives for implementation, and (3) an analysis of the tradeoffs among software, firmware, and hardware. The authors propose a practical approach of enhancing computer architecture level, from a view point of functional hierarchy of operating systems. In order to prove the advantages of this approach, we have designed and implemented an experimental abstract machine for an operating system nucleus. This research is an experimental design, and evaluation on its operating system nucleus machine,called HEART. HEART is a set of primitive and universal functions, and works as a nucleus of a multiprogrammed operating system. The research results of our approach are the followings: First, to clarify the properties of operating system nucleus, taking functional hierarchy of operating system into consideration. Second, to show the design of operating system nucleus based on novel concepts. Third, to confirm the possibility of implimenting operating system nucleus machine. Finally, we give a performance evaluation on microcoded HEART and the effectiveness of enhancing computer architecture level based on the properties of operating systems.
On the foundations of artificial workload design
Authors: Domenico Ferrari
Venue: ACM SIGMETRICS Performance Evaluation Review (1984)

The principles on which artificial workload model design is currently based are reviewed. Design methods are found wanting for three main reasons: their resource orientation, with the selection of resources often unrelated to the performance impact of resource demands; their avoiding to define an accuracy criterion for the resulting workload model; and their ignoring the dynamics of the workload to be modeled. An attempt at establishing conceptual foundations for the design of interactive artificial workloads is described. The problems found in current design methods are taken into account, and sufficient conditions for the applicability of these methods are determined. The study also provides guidance for some of the decisions to be made in workload model design using one of the current methods.
Word processing and graphics: New technology, old problems
Authors: Charles Taylor, John Beidler
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

During the past two years, the University of Scranton has experienced a tremendous growth of interest in both word processing and in computer graphics. In both cases we still had the age-old problem of user requests for use of equipment whose capabilities they failed to understand. Our handling of word processing was different from our handling of graphics for a variety of reasons. However, in both cases we have achieved satisfactory results in that we have set a reasonable direction for good user services. With word processing, the users were more directly involved in the equipment selection process while with graphics, because of the diversity of user requests, users were not directly involved in equipment purchases. In this paper we present our experiences with our attempts to control problems associated with these new technologies.
Circuit recognition and verification based on layout information
Authors: I. Ablasser, U. Jäger
Venue: Proceedings of the 18th Design Automation Conference (1981)

The mathematical and technical background information for our highly efficient procedure of circuit recognition and verification from layout information is presented. Complete verification and extremely short computing times are the main goals. This procedure can be performed for bipolar as well as for MOS technologies and is part of the whole layout-control system LOCATE.
Industry reaction to computer science education
Authors: George Dodd, Fred A. Gluckson
Venue: ACM SIGCSE Bulletin (1974)

Today, undergraduate Computer Science Education teaches mechanics without teaching problem solving. Typical curricula include courses in assembler languages, compiler theory, list processing, and automata theory. Every MS degree holder, and most BS degree holders, know Polish notation and have written parts of compilers. However, few of them have ever learned to write a program that can be easily enhanced or respond to changes as new management (instructor) requirements are set forth. Even fewer can read a program and describe what it does or debug a system consisting of ten or more modules.
The subsystem approach to enhancing small processor operating systems
Authors: Malcolm G. Lane
Venue: Proceedings of the first SIGMINI symposium on Small systems (1978)

Operating systems for small processors often do not take full advantage of a small processor's resources. The implementation of a subsystem to enhance the standard operating system has proved to be an effective method to increase the utilization of a small processor's resources. Several different subsystems for small processors are discussed. The advantages of using the subsystem approach in a small processor environment are given.
The rectangle placement language
Authors: John Alan Roach
Venue: Proceedings of the 21st Design Automation Conference (1984)

Constraint-based symbolic layout of VLSI designs has received growing attention during the past few years. Several systems have been developed which can offer graphical or textual media for the expression of designs and can provide automatic compaction to technology specific design rules. The ability of these systems to allow for the expression of more generalized relationships is a topic open for further research. RPL is a constraint-based symbolic layout language intended to address the problem of providing a more flexible set of constraints and restraints to the designer for expressing the relationships and dependencies of the design. This paper describes some of the ideas behind this work and details some of the progress that has been made.
Computer designed multilayer hybrid substrate using thick film technology
Authors: Chester W. Waldvogel
Venue: Proceedings of the 14th Design Automation Conference (1977)

State of the art system designs require larger, more densely populated, thermally stable, multilayer hybrid substrates. Increased logic densities dictate the need for narrower conductor line widths and better screening techniques. Increasing material and labor costs, as well as component shortages, are also major considerations in the efficient design of complex substrates. Presented herein are the materials, screening techniques, and process steps required to fabricate a densely populated hybrid using computer generated artwork. The substrate discussed in this paper is being produced for the Naval Air Development Center; the prototype units have been completed and a production lot is currently being fabricated. The hybrid consists of one 32 screened layer berylium substrate housed in 2.8" x 2.5" x.165" metal package. The substrate utilizes 135 (54 H series) TTL chips, operates at a frequency of 10 megaHertz, and dissipates 18 watts.
The influence of productions on derivations and parsing (Extended Abstract)
Authors: Benton L. Leong, Detlef Wotschke
Venue: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages (1976)

The concept of grammar forms [4,5] provides evidence that there seems to be no way to base the definitions of many grammar types used in parsing and compiling solely on the concept of productions. Strict interpretations, as introduced in [3,5], of unambiguous or LR(k) grammar forms generate unambiguous or LR(k) languages, respectively. This is not true in the LL(k) case. It is decidable whether a strict interpretation of an unambiguous grammar form is unambiguous. For any two compatible strict interpretations G1 and G2 of an unambiguous grammar form it is decidable whether L(G1)@@@@L(G2), L(G1)@@@@L(G2)&equil;&thgr;, finite, or infinite. For every grammar form F1 there exists a grammar form F2 such that the grammatical family of F1 under unrestricted interpretations is equal to the grammatical family of F2 under strict interpretations.
A method for adaptive performance improvement of operating systems
Authors: David Reiner, Tad Pinkerton
Venue: Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1981)

This paper presents a method for dynamic modification of operating system control parameters to improve system performance. Improved parameter settings are learned by experimenting on the system. The experiments compare the performance of alternative parameter settings in each region of a partitioned load-performance space associated with the system. The results are used to modify important control parameters periodically, responding to fluctuations in system load and performance. The method can be used to implement adaptive tuning, to choose between alternative algorithms and policies, or to select the best fixed settings for parameters which are not modified. The method was validated and proved practical by an investigation of two parameters governing core quantum allocation on a Sperry Univac 1100 system. This experiment yielded significant results, which are presented and discussed. Directions for future research include automating the method, determining the effect of simultaneous modifications to unrelated control parameters, and detecting dominant control parameters.
Interactive graphics for volume modeling
Authors: R. Wolfe, W. Fitzgerald, F. Gracer
Venue: Proceedings of the 18th Design Automation Conference (1981)

This paper describes the GRaphic INput subsystem (GRIN) of an experimental volume modeling system called the Geometric Design Processor (GDP) developed at the IBM Thomas J. Watson Research Center. Sitting at an interactive graphic workstation, a mechanical designer generates computer volume models of complex physical objects and mechanisms built up from primitive volumes, e.g., cuboids, cylinders, swept surfaces, etc., entered at any orientation in 3-dimensional space. Objects are represented in the model as polyhedral approximations. The central issue is the provision of an efficient, natural means for a mechanical designer to enter and interact with these models.
Strategic value of the R D investment: A simulation model approach
Authors: Edmund B. Pyle,  III, Wilfred J. Westlake, Bryce Douglas, A. Douglas Bender
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

A Monte-Carlo Simulation Model was developed in an attempt to relate the size of the R D budget to the future need for new pharmaceutical products in order to sustain the desired level of sales growth. This paper describes the simulation model in detail and presents an example of how it is used to evaluate and compare various R D spending levels and strategies.
Finding an extremum in a network
Authors: Steven P. Levitan, Caxton C. Foster
Venue: Proceedings of the 9th annual symposium on Computer Architecture (1982)

We propose a method for implementing &ldquo;the election process&rdquo; - finding an extrema of values computed in a multiprocessor network. It operates in an average time less than Log2(N), for a network of size N. It requires a single register, memory cell, or global buss into which all the processors can attempt to write, with the success of one guaranteed; and from which they may all read, in parallel. A second method is given which guarantees termination in O(Log2(MAX)) steps.
Verification system for formal requirements description
Authors: Kiyoshi Agusa, Atsushi Ohnishi, Yutaka Ohno
Venue: Proceedings of the 6th international conference on Software engineering (1982)

The requirements description which is proved to be correct is the key to the successful development of a reliable system. Since the adaptability of the requirements description language is obtained with a simple and extensible language structure, most part of communication is maintained with proper use of labels. Many verification system can provide only restricted capability because of lack of the recognition of meaning of labels. This paper proposes the verification method with assertion description which gives another view of a target system. First, the formal model of the verification is given. Next, the verification method based on theorem proving and several views for verification are mentioned. Last, the verification system and examples are shown.
The CMX network
Authors: Peter Lacovara
Venue: Proceedings of the sixth symposium on Data communications (1979)

During the past four years, the CHASE has made expanding use of its centralized CHASE Message Switch (CMX)located at the Operations Center in New York. The CMX, positioned as the center of a worldwide &ldquo;star&rdquo; network was first put into production in October of 1976 to automate the collection of funds transfer and administrative messages from CHASE's overseas branches in the Far East, Mid-East, Europe, South America, and the Caribbean. Interfaces to the Cable Wireless Switches in Hong Kong and Brussels were used to establish efficient communications links where feasible. Dedicated point-to-point and multi-point low speed leased lines were used elsewhere. The CMX was, within the constraints of its functions as a message switch, uniquely suited to supporting the staged development and implementation of CHASE's worldwide communications network. Its use as part of the large centralized telegraphic utility, has enabled CHASE to provide stable and efficient funds transfer services to its various customer bases. Several important factors, however, make it reasonable to examine the desirability of designing and implementing a new message switching facility for the CHASE.
Concise natural language interaction (abstract only)
Authors: Paul Roller Michaelis, James A. Hendler
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - II): Human interface and the user interface - Volume 1981 (1981)

Advances in both hardware and software continue to make it possible to design user oriented systems more easily. Because we have not had a language for describing the user orientation of computer systems, a variety of interpersonal metaphors have been used to aid in the comparative evaluations of systems. Recent cultural history has shaped the semantics of computer systems. Out of the turbulent, liberal strains of the 1960s emerged the movement to humanize computer systems. During the self-centered backlash of the 1970s the term friendly became a computer household word. During the 1980s we need to grow beyond a concern for friendliness alone and build systems that are considerate.Consideration supercedes friendliness in at least three major ways, First, it goes beyond satisfaction by focusing upon attempts to help and assist others. Secondly, it requires that a person take the role of another and take the other's needs into account. Thirdly, to be considerate is to be courteous and, most importantly, respectful. In these respects, the metaphor of the considerate system points to the essence of user orientation wltbout sacrificing other critical system features such as productivity. In fact, truly considerate systems will facilitate productivity because of improved communication clarity, greater tolerance for user errors and idiosyncrasies, and increased availability of options, i.e., user-directed socio-computer interaction.Designing and developing considerate systems is not easy and requires considerable time and effort. Representative users must he involved in the selection of system features and in the process (formative) evaluation as well as the outcome (summative) evaluation. Consequently, there is a very necessary and essential role for the social scientist in the development of present day socio-computer systems.
Microcomputer utilization in basic programming courses
Authors: Robert N. Cook
Venue: Proceedings of the ninth SIGCSE technical symposium on Computer science education (1978)

Traditionally, classroom demonstrations of computer programs have been done on time sharing terminals connected via modems, phones, and phone lines to the university &ldquo;central&rdquo; computer. As anyone who has ever conducted such a demonstration knows, this approach is, to say the least, unreliable. It is not uncommon for professors standing in front of their classes to find that one of the elements in the electronic path from the keyboard to the computer and back to the monitors has failed or that the response time of the central computer is now measured in minutes instead of seconds. The result is that the students, while they may be entertained, certainly lose the value of the &ldquo;on-line&rdquo; demonstration. This paper discusses an alternative approach to classroom demonstrations&mdash;namely the use of the microcomputers.
Interactive software development tool: ISDT
Authors: M. Azuma, M. Takahashi, S. Kamiya, K. Minomura
Venue: Proceedings of the 5th international conference on Software engineering (1981)

This paper describes an interactive software development tool(ISDT),which supports the detailed system design and the manufacture phase in the business application system development. The ISDT is based on Standardized Technology and Engineering for Programming Support (STEPS), experience gained is complied, and new program development support techniques are adopted. The ISDT user will be able to design programs interactively while sitting at a display terminal. ISDT manages specifications stored in a database and automatically generates COBOL programs and documents as required. This paper discusses business application program characteristics at first. Then it is shown how the development support system should be handled. Next, ISDT functions are explained with plenty of figures.
SIMULA-a way of thinking
Authors: Berth Eklundh
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

SIMULA as a tool for modelling and programming is reviewed. Some basic questions that arise in a simulation context are dealt with, and the evolution steps from a percepted reality to final simulation program are examined and exemplified. The modelling step is considered the most important and more effort is put in the analysis of this than in a semantic and syntactical definition. A specific example is given, and SIMULA is used to simulate that example. The importance of conceptually wellsuited building-blocks for simulationtasks is discussed, and the concepts of SIMULA are put in relation to program evaluation.
The effect of look-ahead paging in a virtual memory system as determined by simulation
Authors: Leon R. Wechsler
Venue: Proceedings of the 1st symposium on Simulation of computer systems (1973)

The virtual memory concept, introduced in 1961 with the Atlas computer, has gained widespread acceptance in recent years, and has been designed into a number of 3rd and 4th generation large processors. Basically, the concept distinguishes between name space (program-generated addresses) and physical space (memory location addresses) with the computer performing the function of mapping name space into physical space. Program pages are moved from auxiliary memory to main memory as required for execution, and physical space assignments are made in accordance with a set of allocation algorithms. In particular, the ability of the virtual memory to realize automatic storage allocation has made it well suited for time sharing computer applications. With limited computer resources, the user is given the illusion that a very large main memory is at his disposal by the dynamic allocation of memory space. For each user's time slice, control of the associated working set of pages is accomplished with demand paging. Immediately preceding the start of a time slice, the technique is to load only that page containing the next instruction, and thereafter load additional pages of the working set those necessary to start processing as demanded during the time slice. This approach is reasonably effective providing that the program working sets change membership slowly and that the computer systems incorporate a high speed access auxiliary memory like Large Capacity Storage (LCS) to store latest program working sets.
Managing the development of reliable software
Authors: R. D. Williams
Venue: Proceedings of the international conference on Reliable software (1975)

This paper discusses the serious need for improved management methods and software development technology to support the production of truly reliable software and presents experience gained on TRW's Site Defense Program in addressing that need. The basic theme is simply this: We have attempted to achieve a better understanding of how to specify, design, build and validate reliable software; we have translated that understanding into an integrated and exceptionally disciplined software development methodology; we have used, evaluated and refined the methodology enough to recognize and report substantial early success and continuing progress toward that goal.
TYMNET - a serendipitous evolution
Authors: Max P. Beere, Neil C. Sullivan
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

It became evident after closer analysis of the projected corporate model, that in order to maintain a viable business and to achieve profit goals, Tymshare, Inc. must consolidate its computers into one location and transfer the computer power from that location to where it was needed. The challenge was immediately evident: communication capability at reasonable cost. The need was equally evident that this communication capability had to be dependable, error free, and interactive. Tymshare chose to develop its own network from the communication common carrier service. This network, which Tymshare calls TYMNET, is presently in service using 80 Tymshare-built TYMSAT communication computers. Each TYMSAT uses a Varian Data 620 computer. Each step in the development of this network resulted from the solution of specific problems, often bringing new problems to light in the process of solving old ones.
Rank vs depth for array partitioning
Authors: J. Philip Benkard
Venue: Proceedings of the international conference on APL (1984)

In some applications a subset of the dimensions of an array is used to define a framework which holds instances of cells defined by the complementary subset. A rank four array might be viewed as a page containing several rows of graphs. This structure could be used to apply a rotate function to each of the graphs. Existing proposals to implement a general scheme of program controlled distribution of functions over data arrays are compared. Nested arrays are suggested as the preferred technique. The analogy between the EACH operator and the ENCLOSE function in APL2/NARS leads to remarks on arrays of functions. In that context function distribution becomes a special case of scalar extension.