Map
Index
Random
Help
th

QuoteRef: dijkEW2_1971

topics > all references > ThesaHelp: references c-d



ThesaHelp:
references c-d
Topic:
what is truth
Topic:
what is a computer
Topic:
metaphysics and epistemology
Group:
operating system
Topic:
non-deterministic processing
Topic:
decomposition of a system into levels
Topic:
virtual machine
Topic:
operating system kernel
Topic:
identifying program modules
Topic:
system integration
Topic:
program module as encapsulation
Topic:
information hiding
Topic:
interrupt handler
Topic:
communicating sequential processes
Topic:
interrupts
Topic:
models of parallel computation
Topic:
critical regions
Topic:
proving concurrent programs
Topic:
state
Topic:
high priority processes
Topic:
accounting
Topic:
concurrency control by monitors

Reference

Dijkstra, E.W., "Hierarchical ordering of sequential processes", Acta Informatic, 1, 2, pp. 115-138, 1971. Google

Other Reference

p. 72-93 in Hoare, C.A.R., Perrott, R.H. (Eds.), Operating Systems Techniques, Proceedings of a seminar held at Queen's University, Belfast, 1971, London: Academic Press 1927.

Quotations
72 ;;Quote: we attach meaning to perceived structures in the meaningless bits of computer memory and the meaningless traces of computer programs
75 ;;Quote: the goal of an operating system is insensitivity to indeterminism; via layers that are insensitive to proceeding layers
75+;;Quote: structure an operating system as layers of insensitive, abstract machines
75 ;;Quote: avoid unordered modules, each implementing a function; difficult to integrate with each other; quadratic growth in complexity
76 ;;Quote: hide interrupts via abstract processors; everything else as cooperating sequential processes
76 ;;Quote: use an interrupting clock to regulate the bottom layer of the operating system
76+;;Quote: code all synchronization explicitly; speed ratios are not available
80 ;;Quote: if a semaphore is zero, processes may be blocked, waiting for a P-operation; a V-operation wakes one of these processes, without starvation
80 ;;Quote: P- and V-operations solve the problem of mutual exclusion
133 ;;Quote: use private and public semaphores to control access to a shared resource; intermediate states for desired access
88 ;;Quote: the dining philosophers problem demonstrates the constructive approach to multiprogramming correctness
88+;;Quote: introduce the intermediate state, 'hungry', to solve the dining philosophers problem
90 ;;Quote: avoid priority inversion by giving priority to processes in a critical section; T.H.E multiprogramming system uses 'red' and 'white' processes
90 ;;Quote: assign user programs to reserved processes; do not charge time spent in critical sections
91 ;;Quote: combine critical regions into a secretary process; invoked, as needed, by its directors; order is undefined

Related Topics up

ThesaHelp: references c-d (337 items)
Topic: what is truth (66 items)
Topic: what is a computer (62 items)
Topic: metaphysics and epistemology (65 items)
Group: operating system   (27 topics, 877 quotes)
Topic: non-deterministic processing (19 items)
Topic: decomposition of a system into levels (49 items)
Topic: virtual machine (13 items)
Topic: operating system kernel (67 items)
Topic: identifying program modules (26 items)
Topic: system integration (5 items)
Topic: program module as encapsulation (28 items)
Topic: information hiding (50 items)
Topic: interrupt handler (20 items)
Topic: communicating sequential processes (33 items)
Topic: interrupts (25 items)
Topic: models of parallel computation (33 items)
Topic: critical regions (58 items)
Topic: proving concurrent programs (37 items)
Topic: state (35 items)
Topic: high priority processes (13 items)
Topic: accounting (10 items)
Topic: concurrency control by monitors (24 items)

Collected barberCB 6/04 1980
Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.