BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR86-119
ENTRY:: January 20, 1995
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: Task Queues:  A General Model for the Implementation of Communications Protocols
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Kratzer, Ann
NOTE:: The 'January' in DATE is an arbitrary placeholder.
DATE:: January 1986
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR86-119.pdf
ABSTRACT::
	When any computer communications network is built, its
communications protocol must always be implemented.  The protocol is
implementetd on the switching nodes of the network.  The node software
must respond in real time to events generated external to the
switching node.  Thus, the software running on a switching node
constitutes a concurrent program; this complicates the design,
implementation and testing of the switching node software.  The task
queue model presented in this paper defines a structure for this
software that facilitates the design, implementation and testing of
communications protocols.
END:: ncstrl.dartmouthcs//TR86-119