Go to  Advanced Search

Termination and storage requirements in a model for parallel computations

Show full item record

Files in this item

Files Size Format Description   View
UBC_1970_A7 S39_4.pdf 2.626Mb Adobe Portable Document Format   View/Open
 
Title: Termination and storage requirements in a model for parallel computations
Author: Schnapp, Ivan
Degree Master of Applied Science - MASc
Program Electrical and Computer Engineering
Copyright Date: 1970
Subject Keywords Computers.
Abstract: This paper deals with a graph-theoretic model for parallel computations as formulated by Karp and Miller. A necessary condition and a sufficient condition for self-termination of loops with unit loop gain are presented. For the special case that W=U the necessary and sufficient condition is derived. A direct procedure for testing termination properties of strongly connected graphs is presented. A method due to Reiter, for determining the maximum storage required for a computation graph, is extended to cover the general case.
URI: http://hdl.handle.net/2429/34610
Series/Report no. UBC Retrospective Theses Digitization Project [http://www.library.ubc.ca/archives/retro_theses/]
Scholarly Level: Graduate

This item appears in the following Collection(s)

Show full item record

All items in cIRcle are protected by copyright, with all rights reserved.

UBC Library
1961 East Mall
Vancouver, B.C.
Canada V6T 1Z1
Tel: 604-822-6375
Fax: 604-822-3893