Robert L. Ashenhurst – författare

Foundations of Microprogramming: Architecture, Software, and Applications discusses the foundations and trends in microprogramming, focusing on the architectural, software, and application aspects of microprogramming. The book reviews microprocessors, microprogramming concepts, and characteristics, as well as the architectural features in microprogrammed computers. The text explains support software and the different hierarchies or levels of languages. These include assembler languages which are mnemonic or symbolic representation of machine commands; the procedure oriented machine-dependent; and the procedure oriented machine independent. A simulator is used to interpret programs written in machine or micro-language before the instructions in the program can be run. A simulator and translator (which change some steps from one program written in another language to another program) should interface with the design language of the computer for these components to operate even when a new machine is developed. The book cites four existing computers which have "simple" diagonal microinstructions such as the Hewlett-Packard HP21MX and the Microdata 3200. Horizontal types of microinstructions allow parallel execution of many micro-operations, such as the Cal Data family of computers, the Varian 73, and the NANODATA QM-1. Microprogramming is applied in emulation, program enhancement, operating systems, signal processing, and graphics. The text can benefit programmers, computer engineers, computer technicians, and computer instructors dealing with many aspects of computers such as programming, hardware interface, networking, engineering or design.

Decomposability: Queueing and Computer System Applications presents a set of powerful methods for systems analysis. This 10-chapter text covers the theory of nearly completely decomposable systems upon which specific analytic methods are based. The first chapters deal with some of the basic elements of a theory of nearly completely decomposable stochastic matrices, including the Simon-Ando theorems and the perturbation theory. The succeeding chapters are devoted to the analysis of stochastic queuing networks that appear as a type of key model. These chapters also discuss congestion problems in information processing systems, which could be studied by the queuing network models. A method of analysis by decomposition and aggregation for these models is proposed. Other chapters highlight the problem of computer system performance evaluation, specifically the analysis of hardware and software of the dynamic behavior of computer systems and user programs. These topics are followed by a description of an aggregative model of a typical multiprogramming time-sharing computer system. The last chapter examines the existing affinity between the concept of aggregate in nearly completely decomposable structures and the notions of module and level of abstraction so frequently invoked in computer system design and software engineering. This book will prove useful to both hardware and software designers and engineers, as well as scientists who are investigating complex systems.

Computer Security provides information pertinent to the growing concern with computer security and privacy, extending beyond the conventional military requirement to cover the entire civilian and business community. This book discusses the approaches to ensure the integrity of stored data. Organized into eight chapters, this book begins with an overview of the relationships between privacy issues and security measures. This text then provides a discussion on privacy issues, legislative measures, and their implications on security. Other chapters consider the technical implications of the enactment of privacy legislation and explain the control of access required by the privacy legislation. This book discusses as well the internal policies and procedures of operational security, which is adopted by management to ensure the security of their data and computer installation. The final chapter deals with optimizing database management system to facilitate the use of data effectively and efficiently. This book is a valuable resource for technical managers.

Computability Theory: An Introduction provides information pertinent to the major concepts, constructions, and theorems of the elementary theory of computability of recursive functions. This book provides mathematical evidence for the validity of the Church–Turing thesis. Organized into six chapters, this book begins with an overview of the concept of effective process so that a clear understanding of the effective computability of partial and total functions is obtained. This text then introduces a formal development of the equivalence of Turing machine computability, enumerability, and decidability with other formulations. Other chapters consider the formulas of the predicate calculus, systems of recursion equations, and Post''s production systems. This book discusses as well the fundamental properties of the partial recursive functions and the recursively enumerable sets. The final chapter deals with different formulations of the basic ideas of computability that are equivalent to Turing-computability. This book is a valuable resource for undergraduate or graduate students.

ACM Monograph Series: Decision Table Languages and Systems focuses on linguistic examination of decision tables and survey of the features of existing decision table languages and systems. The book first offers information on semiotics, programming language features, and generalization. Discussions focus on semantic broadening, outer language enrichments, generalization of syntax, limitations, implementation improvements, syntactic and semantic features, decision table syntax, semantics of decision table languages, and decision table programming languages. The text then elaborates on design implications, decision structure tables, spectrum of decision table use, and history of decision table programming. Topics include feature evaluation method, breadth of decision table applicability, and suggested design procedure. The book also takes a look at sequential test procedures and language references. The publication is a vital reference for researchers interested in decision table languages and systems.

Computer System Organization: The B5700/B6700 Series focuses on the organization of the B5700/B6700 Series developed by Burroughs Corp. More specifically, it examines how computer systems can (or should) be organized to support, and hence make more efficient, the running of computer programs that evolve with characteristically similar information structures. Comprised of nine chapters, this book begins with a background on the development of the B5700/B6700 operating systems, paying particular attention to their hardware/software architecture. The discussion then turns to the block-structured processes involved in the B6700 job, which consists of a time-invariant algorithm and a time-varying data structure which is the record of execution of that algorithm. Subsequent chapters deal with the basic data structures for B6700 algorithms; task attributes and the creation and coordination of tasks; stack structure and stack ownership; and software interrupts. Storage control strategies as well as the pros and cons of B6700 are also considered, along with some hardware details of procedure entry and return and tasking. This monograph is intended for computer center directors, other computer professionals, and serious students in computer science who have an interest in the subject of computer organization.

Algebraic Theory of Automata provides information pertinent to the methods and results of algebraic theory of automata. This book covers a variety of topics, including sets, semigroup, groupoids, isomorphism, semiautomata, proof of Kleene''s theorem, and algebraic manipulations. Organized into seven chapters, this book begins with an overview of the fundamental properties of groups and semigroups. This text then examines the notion of semiautomaton, which serves as a basis for a rich and interesting theory. Other chapters consider algebraic notions and methods that are very useful in dealing with semiautomata. This book discusses as well some properties of the notion of covering of semiautomata. The final chapter deals with the theory of Krohn and Rhodes. This book is a valuable resource for graduate students.