THEORY NET: Complexity of ...

Article View: ut.theory

Article #134

#134

From: arvind
Date: Fri, 21 Aug 1987 16:15

12 lines
987 bytes

From: Craig Renfrew <craig@computer-science.strathclyde.ac.uk>
Subject:      Complexity of communicating processors

    Most of the theory on computational complexity of parallel processing
assumes perfect communication between processing elements. Can anyone give
me pointers to the literature where the problems of inter-communication
are discussed or analysed ?
        Craig
     
ARPA:    craig%cs.strath.ac.uk@ucl-cs.arpa, craig@cs.strath.ac.uk
UUCP:    craig@strath-cs.uucp, ...!seismo!mcvax!ukc!strath-cs!craig
JANET:    craig@uk.ac.strath.cs

Technical Details

Message-ID: <5289@utcsri.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!utcsri!arvind

Show Full Headers

Complete Article Headers

Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: arc1-ca.pugleaf.net!utzoo!utgpu!utcsri!arvind
From: arvind@utcsri.UUCP
Newsgroups: ut.theory
Subject: THEORY NET: Complexity of ...
Message-ID: <5289@utcsri.UUCP>
Date: Fri, 21-Aug-87 12:15:58 EDT
Article-I.D.: utcsri.5289
Posted: Fri Aug 21 12:15:58 1987
Date-Received: Sat, 22-Aug-87 18:04:12 EDT
Distribution: ut
Organization: CSRI, University of Toronto
Lines: 12