CaltechAUTHORS
  A Caltech Library Service

A string theory for time dependent complex systems and its application to automatic decomposition

Fox, Geoffrey C. and Furmanski, Wojtek (1988) A string theory for time dependent complex systems and its application to automatic decomposition. In: C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues. Vol.1. ACM , New York, NY, pp. 285-305. ISBN 0-89791-278-0. http://resolver.caltech.edu/CaltechAUTHORS:20161024-162621912

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20161024-162621912

Abstract

We introduce a string or world line formalism that provides a general description of time dependent complex systems. We show that it can be applied to mapping general problems onto both sequential and parallel computers. In principle it unifies the concepts of an optimizing compiler with that of parallel decomposition. We show that it reproduces and smoothly interpolates both our original load balancing methods for loosely synchronous problems and optimal communication and combining algorithms such as index and fold. We evaluate two explicit implementations, the neural_router and neural_accumulator, which use an optimizing neural network.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1145/62297.62329DOIArticle
http://dl.acm.org/citation.cfm?doid=62297.62329PublisherArticle
Additional Information:© 1988 ACM. Work supported in part by DOE grant DE-FG03-85ER25009, the Program Manager of the Joint Tactical Fusion Office, and the ESD division of the USAF, as well as grants from IBM, and SANDIA.
Funders:
Funding AgencyGrant Number
Department of Energy (DOE)DE-FG03-85ER25009
Joint Tactical Fusion OfficeUNSPECIFIED
U.S. Air ForceUNSPECIFIED
IBMUNSPECIFIED
Sandia National LaboratoriesUNSPECIFIED
Record Number:CaltechAUTHORS:20161024-162621912
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:20161024-162621912
Official Citation:G. C. Fox and W. Furmanski. 1988. A string theory for time dependent complex systems and its application to automatic decomposition. In Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (C3P), Geoffrey Fox (Ed.), Vol. 1. ACM, New York, NY, USA, 285-305. DOI=http://dx.doi.org/10.1145/62297.62329
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:71420
Collection:CaltechAUTHORS
Deposited By: Kristin Buxton
Deposited On:24 Oct 2016 23:54
Last Modified:24 Oct 2016 23:54

Repository Staff Only: item control page