Computer System Organization (eBook)

The B5700/B6700 Series

Elliott I. Organick (Autor)

Robert L. Ashenhurst (Herausgeber)

eBook Download: PDF

2014 | 1. Auflage
142 Seiten
Elsevier Science (Verlag)
978-1-4832-1904-2 (ISBN)

Infos

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.

Inhalt

Front Cover 1
Computer System Organization 4
Copyright Page 5
Table of Contents 6
Preface 8
CHAPTER 1. 
12 
CHAPTER 2. 
20 
CHAPTER 3. 
28 
3.1 INTRODUCTION 28
3.2 OPERAND STACKS 33
3.3 TREATMENT OF SYSTEM INTRINSICS 36
3.4 BLOCK EXITS AND RETURNS 37
3.5 PROCEDURE CALLS—GENERAL 38
3.6 HARDWARE INTERRUPTS AS HARDWARE FABRICATED PROCEDURE CALLS 42
3.7 SMALL WORKING SETS 43
3.8 SHARING PROGRAMS AND DATA 46
CHAPTER 4. 
48 
4.1 CREATION AND COORDINATION OF TASKS 48
4.2 TASK ATTRIBUTES 55
4.3 ILLUSTRATIVE PROBLEM 61
CHAPTER 5. 
68 
5.1 THE CRITICAL BLOCK CONCEPT 68
5.2 DEPENDENT VERSUS INDEPENDENT TASKS 71
CHAPTER 6. 
74 
6.1 INTRODUCTION 74
6.2 AN ILLUSTRATIVE EXAMPLE 76
6.3 DATA STRUCTURES FOR SOFTWARE INTERRUPTS 80
6.4 INTERRUPTING A SLEEPING TASK AND OTHER PROBLEMS 84
6.5 RESOURCE-ORIENTED SYNCHRONIZING PRIMITIVES 86
6.6 SOFTWARE INTERRUPT CAVEATS 87
CHAPTER 7. 
88 
7.1 STORAGE CONTROL AT BLOCK EXIT 88
7.2 PREVENTING DANGLING POINTERS 89
CHAPTER 8. 
94 
8.1 INTRODUCTION 94
8.2 USER LANGUAGES AND USER PROGRAM PERFORMANCE 94
8.3 THE OPERATING SYSTEM 100
8.4 HARDWARE LIMITATIONS AND FUTURE IMPROVEMENTS 101
CHAPTER 9. Some Hardware Details of Procedure Entry and Return and Tasking 104
9.1 OVERVIEW 104
9.2 THE STACK VECTOR 106
9.3 INFORMATION AND ADDRESSING STRUCTURE 106
9.4 STACK BUILD-UP AND PROCEDURE ENTRY 110
9.5 HARDWARE INTERRUPTS 122
9.6 MULTIPLE PROCESSORS 122
9.7 JOB AND TASK INITIATION 122
Bibliography 132
Index 138

Produkt-Details

• Erscheint lt. Verlag: 25.6.2014
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Informatik ► Betriebssysteme / Server
• Themenwelt: Mathematik / Informatik ► Informatik ► Theorie / Studium
• ISBN-10: 1-4832-1904-6 / 1483219046
• ISBN-13: 978-1-4832-1904-2 / 9781483219042