Operating Systems Engineering: Proceedings of the 14th IBM Computer Science Symposium Amagi, Japan, October 1980

468 Pages·1982·10.318 MB·English

by  Nobuo Saito (auth.), Mamoru Maekawa, Laszio A. Belady (eds.)

Lecture Notes ni
Computer Science
detidE yb .G Goos dna .J sinamtraH
341
gnitarepO smetsyS
gnireenignE
sgnideecorP of eht ht41 MBI Science Computer muisopmyS
,igamA ,napaJ October 0891
detidE yb .M awakeaM dna Belady L.A.
galreV-regnirpS
Berlin Heidelberg NewYork 1982
Editorial Board
.D Barstow .W Brauer Brinch R Hansen .D Gries .D Luckham
.C Moler .A Pnueli .G rellJ(nrgeeS .J Stoer .N Wirth
Editors
Mamoru Maekawa
etaicossA ,rosseforP ytisrevinU of oykoT
1-3-7 Hongo ,uk-oyknuB ,oykoT ,311 napaJ.
Laszlo .A Belady
Manager of Software ,ygolonhceT MBI Corporate Headquarters
Armonk, 10504, NY ASU
CR Subject Classifications :)1891( 4.35
ISBN 3-54041604-4 Berlin Springer-Verlag Heidelberg NewYork
tSBN 0-387-11604-4 NewYork Heidelberg Springer-Vertag Berlin
This work is subject to copyright. All whether rights reserved, are the whole or part of the material
8i concerned, specifically those of translation, reprinting, re-use of illustrations, broadcasting,
reproduction by photocopying machine or similar and storage means, in data banks. Under
§ 54 of the German Copyright Law where copies are made for other than private use, fee a is
payable to "Verwertungsgesetlschaft Wort", Munich.
© by Springer-Vertag Berlin Heidelberg 1982
Printed in Germany
Printing and binding: Offsetdruck, Bettz Hemsbach/Bergstr.
2145/3140-543210
ECAFERP
Much research and advances in operating systems have been
made since an operating system became one of the largest
pieces of software of a computer system. Operating systems
have been the major driving force for software engineering
research because of performance, delivery and management
problems. Despite of much research and advances, however,
their understanding ~ construction and maintenance are still
largely based on direct experience. The Working Conference
on Operating Systems Engineering was organized to identify
and discuss major systematic engineering approaches by in-
viting leading specialists in this field. The following eight
topics were identified:
I. Concurrency and access control
2. Program behavior and performance models
.3 Operating system evaluation
~. User interfaces
5- Distributed operating systems
6. Network operating systems
7- Development process and tools
8. Data flow machines
The first two topics~ concurrency and performance, are tradi-
tionally in the center of operating system research. Here,
new developments are reported in addition to summaries of
past research. The third and fourth topics are concerned with
the dynamics of operating system programs. System evolution
is one of the major software engineering topics and it is
interesting to see how "mammoth" operating systems can be
made soft and flexible. The problem has long been recognized
but relevant systematic research is only recent. The fifth
and sixth topics address the problems in distributed com-
puting systems~ which have been in the focus of considerable
interest in recent years. New developments, both theoretical
VI
and practical, are reported. The seventh topic is an impor-
tant subject in software engineering and is covered by two
studies in design methodologies and tools. The eigth and
last topic addresses the problems of software development
for data flow machines. Both researchers and practitioners
should find this book interesting and useful.
The symposium and this book were made possible through the
efforts of many people. We would particularly like to
acknowledge IBM Japan for sponsoring the symposium.
M. Maekawa L.A. Be lady
University of Tokio IBM, Armonk
CONTENTS
Part I. Concurrency Control and Access
Control
1. Synchronization Mechanisms for Parallel Processing . . . . . . . . . . 2
Nobuo Saito
2. A Parallel Programming Language and Description of Scheduler " " " 23
Hajime Enomoto, Naoki Yonezaki, Isao Miyamura
and Masayuki Sunuma
8. Specification of Schedulers with Algebraic Specification Tech-
tuques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42
Kouichi Wada, Kenichi Hagihara, Toshiro Araki
and Nobuki Tokura
4 Generalized Dynamic Authorization Mechanisms . . . . . . . . . . . 63
Yahiko Kambayashi
Part II Program Behavior and Performance
Models
1. Program Behavior and Its Models . . . . . . . . . . . . . . . . . . . 80
Takashi Masuda and Tong-Haing Fin
2 CPU Scheduling for Effective Multiprogramming . . . . . . . . . . 104
Hisao Kameda
3. Dynamic Tuning of Operating Systems . . . . . . . . . . . . . . . . 119
Chiaki Ishikawa, Ken Sakamura and Mamoru Maekawa
4. On Pseudo Workload for Performance Measurement of Interac-
tive Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143
Masatoshi Miyazaki, Shigeru Matsuzawa, Seiziro Obata
and Shoichi Noguchi
IV
Part !II. Operating System Evolution
1. Modifiability of Large Software Systems . . . . . . . . . . . . . . . . 150
Laszlo A. Belady
2. Operating System Conceptual Model for Ease of Extension ...... )-75
Mamoru Maekawa
Part IV User Interfaces
1. Perspective of OS Interface to Users . . . . . . . . . . . . . . . . . 208
Toru Takeshita
2. Intelligent Console--A Universal User Interface of a Computer
System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 233
Itsujiro Arita
Part V. Distributed Operating Systems
1 Structuring Distributed Programs with Control Fault Detection . • • 252
Michiharu Tsukarnoto
2. A Distributed Operating System for a Binary Tree Multiproces-
sot . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 270
Yoshizo Takahashi
Vii
Part VI. Network Operating Systems
1. GAMMA--NET: Computer Network Coupled by 100 MBPS
Optical Fiber Ring Bus--System Planning and Ring Bus Subsys-
tem Description . . . . . . . . . . . . . . . . . . . . . . . . . . . . 288
Katsuo Ikeda, Yoshihiko Ebihara, Michihiro Ishizaka,
Takao Fujima, Tomoo Nakamura and Kazuhiko Nakayama
2. Product Validation for Standardized Network Protocol . . . . . . . . 311
Tadao Saito, Toshihiko Kato and Hiroshi Inose
3. Protection and Synchronisation in a Message-Switched System .... 331
Jon Livesey and Eric Manning
4. On the Progress of Communication Between Two Machines ..... 369
Mohammed G. Gouda, Eric G. Manning and Y. T. Yu
Part VII. Development Process and Tools
1 Form Transformer--A Formalism for Office Form Manipulation . . . 392
Hiroyuki Kitagawa and Tosiyasu L. Kunii
2. Automated Design of Concurrent Process Systems . . . . . . . . . . 407
Toyohiko Hirota, Koichi Tabata and Yutaka Ohno
Part VIII Data Flow Machines
1. Concurrent Programming . . . . . . . . . . . . . . . . . . . . . . . 6211
Randal E. Bryant and Jack .B Dennis
2 Streams and Managers . . . . . . . . . . . . . . . . . . . . . . . . 452
Arvind and J. Dean Brock
Part ,I
Concurrency Control and Access Control
Concurrency control and access control mechanisms are indis-
pensable facilities to ensure the correctness of operations
in multiprocess multiple resource systems. Various research
has been carried out to find powerful, efficient and concep-
tually simple mechanisms. The first three papers discuss
problems of concurrency control and the last paper is con-
cerned with access control mechanisms. The first paper by
.N Saito surveys major synchronization mechanisms and ident-
ifies important research topics. Especially, a classification
of these mechanisms is made and properties used in parallel
program verification are discussed. The second paper by .H
Enomoto, .N Yonezaki, .I Miyamura and .S Sunuma proposes a
new parallel programming language and an efficient scheduling
algorithm. The algorithm is shown to be easily described
in the proposed language. The third paper by .K Wada, .K
Hagiwara, .T Araki and .N Tokura discusses new algebraic
specification techniques for schedulers. Specifications of
schedulers using these techniques are also given. The last
paper by .Y Kambayashi is concerned with decentralized
dynamic authorization mechanisms. New mechanisms which can
specify security levels are presented.
2
SYNCHRONIZA~TtON MECHANISMS FOR PARALLEL PROCESSING
Nobuo SAITO
Department of Mathematics
Faculty of Engineering
Keio University
3-14-1, Hiyoshi, Kohoku-Ku
Yokohama 223
JAPAN
ABSTRACT
The synchronization mechanism in parallel processing is a very important facility. This
paper discusses the recent trends of synchronization mechanisms, especially from the point
of general features and program verification.
.1 INTRODUCTION
Synchronization mechanisms play an important role in parallel/concurrent processing.
A great varieties of such mechanisms have been proposed so far, and their characteristics
have been discussed. This paper gives another discussion about the recent trends of
synchronization mechanisms mainly from the points of views of general properties and
program verification.
The first general purpose synchronization mechanism is a semaphore system proposed
by E. W. Dijkstra. The monitor concept proposed by C. A. R. Hoare is based on the data
abstraction technique, and both~0f these are used in shared resource computer systems.
On the other hand, the recent development of microcomputers enabled the realization
of distributed computer systems, and new concepts of the synchronization mechanisms
for such systems were proposed. Communicating Sequential Processes(CSP), Distributed
Processes(DP) and rendezvous mechanism in Ada are much different from rather clas-
sical mechanisms. These new mechanisms might rather easily be implemented in dis-
tributed computer systems. This paper first discusses the essential differences among these
synchronization mechanisms.
It is quite important to develop verification techniques for parallel processing programs
since the testing and debugging in such programs are much more difficult~and tiresome
than in sequential programs. The development of verification techniques is closely related
to the investigation of formal semantics. It si very useful to discuss the formal and informal
verification techniques for parallel processing programs with synchronization mechanisms.
This paper discusses several verification techniques, and points out some difficulties.
.2 TYPICAL SYNCHRONIZATION MECHANISMS
The followings are typical synchronization mechanisms proposed so far.
(1) erohpameS metsyS [Dijkstra(1968)]
A semaphore system consists of semaphore variables, P operation and V operation.
Several variations of this system can be considered.
(2) Monitor ])4791(eraoH[