Map
Index
Random
Help
th

QuoteRef: clarDD12_1995

topics > all references > ThesaHelp: references c-d



ThesaHelp:
ACM references a-e
ThesaHelp:
references c-d
Topic:
decomposition of a system into levels
Topic:
operating system kernel
Topic:
procedure valued variables
Topic:
synchronous communication through a channel
Topic:
multi-tasking
Topic:
identifying program modules
Topic:
models of parallel computation
Topic:
information hiding
Topic:
interface between program modules
Topic:
termination of control unit
Topic:
hard real time systems
Topic:
task scheduling
Topic:
concurrency control by monitors

Reference

Clark,D.D., "The structuring of systems using upcalls", Proceedings of the Tenth ACM Symposium on Operating Systems Principles, December 1995, Orcas Island, Washington. Google

Quotations
171 ;;Quote: an upcall calls a higher level function across protection boundaries; an alternative to asynchronous signals
171+;;Quote: upcalls usually call a higher level function through a procedure variable
171 ;;Quote: organize a layer as tasks made of subroutines; all interfaces are subroutine calls instead of intertask communication
174 ;;Quote: rewriting a downcall protocol as upcalls improved performance and code size by 5-10x
174 ;;Quote: an upcall may asks questions about its service; e.g., ask for further data to append to an outgoing packet
175 ;;Quote: if organize modules as multi-tasks, can delay task division until later; otherwise the initial architecture determines the tasks
177 ;;Quote: with upcalls, need to separate client data from the level's data; the later must be consistent and unlocked before an upcall occurs
177 ;;Quote: if an upcall fails, need to recover the calling task; the simple solution is to fail; i.e., tasks are expendable
177 ;;Quote: with upcalls, need to either disallow recursive downcalls, restrict downcalls to simple actions/queuing, or restrict downcalls to setting flags
178 ;;Quote: define task priority as its deadline in microseconds; better than priority levels since easily understood
179 ;;Quote: deadline promotion -- a task with a short deadline can promote a task with a long deadline if it holds a locked monitor


Related Topics up

ThesaHelp: ACM references a-e (259 items)
ThesaHelp: references c-d (337 items)
Topic: decomposition of a system into levels (49 items)
Topic: operating system kernel (67 items)
Topic: procedure valued variables (34 items)
Topic: synchronous communication through a channel (28 items)
Topic: multi-tasking (22 items)
Topic: identifying program modules (26 items)
Topic: models of parallel computation (33 items)
Topic: information hiding (50 items)
Topic: interface between program modules (55 items)
Topic: termination of control unit (22 items)
Topic: hard real time systems (64 items)
Topic: task scheduling (49 items)
Topic: concurrency control by monitors (24 items)

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