Batch processing is a means of improving the efficiency of transaction processing systems. Despite the maturity of this field, there is no rigorous theory that can assist in the design of batch systems. This thesis proposes such a theory, and shows that it is practical to use it to automate system design. This has important consequences; the main impediment to the wider use of batch systems is the high cost of their development and intenance. The theory is developed twice: informally, in a way that can be used by a systems analyst, and formally, as a result of which a computer program has been developed to prove the feasibility of automated design. Two important concepts are identified, which can aid in the decomposition of any system: 'separability', and 'independence'. Separability is the property that allows processes to be joined together by pipelines or similar topologies. Independence is the property that allows elements of a large set to be accessed and updated independently of one another. Traditional batch processing technology exploits independence when it uses sequential access in preference to random access. It is shown how the same property allows parallel access, resulting in speed gains limited only by the number of processors. This is a useful development that should assist in the design of very high throughput transaction processing systems. Systems are specified procedurally by describing an ideal system, which generates output and updates its internal state immediately following each input event. The derived systems have the same external behaviour as the ideal system except that their outputs and internal states lag those of the ideal system arbitrarily. Indeed, their state variables may have different delays, and the systems as whole may never be in consistent state. A 'state dependency graph' is derived from a static analysis of a specification. The reduced graph of its strongly-connected components defines a canonical process network from which all possible implementations of the system can be derived by composition. From these it is possible to choose the one that minimises any imposed cost function. Although, in general, choosing the optimum design proves to be an NP-complete problem, it is shown that heuristics can find it quickly in practical cases. / Thesis (Ph.D.)--Mathematical and Computer Sciences (Department of Computer Science), 1999.

Thesis (Ph. D.)--University of Hong Kong, 2007. / Also available online.

Thesis (Ph.D.)--Tufts University, 2001. / Adviser: Robert J. K. Jacob. Submitted to the Dept. of Computer Science. Includes bibliographical references (leaves 114-117). Access restricted to members of the Tufts University community. Also available via the World Wide Web;

Thesis (M.S.E.C.E.)--Baylor University, 2007. / Includes bibliographical references (p. 141).

Thesis (M.S.)--Rochester Institute of Technology, 1989. / Includes bibliographical references (leaves 78-79).

Thesis (M.S.)--University of Nevada, Reno, 2007. / "May, 2007." Includes bibliographical references (leaves 71-73). Online version available on the World Wide Web.

Thesis (Ph.D.) -- McMaster University, 1998. / Includes bibliographical references [leaves 185-198]. Also available via World Wide Web.

Thesis (Ph. D. in Computer Science)--Vanderbilt University, May 2008. / Title from title screen. Includes bibliographical references.

Thesis (M.A. Sc.)--University of Toronto, 2004. / Adviser: Chris Damaren.

Thesis (Ph. D.)--Ohio University, August, 2002. / Title from PDF t.p. Includes bibliographical references (leaves 298-307).