skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

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

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 neuralreverse arrowrouter and neuralreverse arrowaccumulator, which use an optimizing neural network. 15 refs., 11 figs.

Authors:
;
Publication Date:
Research Org.:
California Inst. of Tech., Pasadena (USA)
OSTI Identifier:
6642509
Report Number(s):
DOE/ER/25009-521; CONF-880117-8
ON: DE89003412
DOE Contract Number:  
FG03-85ER25009
Resource Type:
Conference
Resource Relation:
Conference: 3. conference on hypercube concurrent computers and applications, Pasadena, CA, USA, 19 Jan 1988; Other Information: Portions of this document are illegible in microfiche products
Country of Publication:
United States
Language:
English
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; ARRAY PROCESSORS; PARALLEL PROCESSING; ALGORITHMS; COMMUNICATIONS; COMPUTER ARCHITECTURE; SPACE DEPENDENCE; TIME DEPENDENCE; MATHEMATICAL LOGIC; PROGRAMMING; 990210* - Supercomputers- (1987-1989)

Citation Formats

Fox, G C, and Furmanski, W. A string theory for time dependent complex systems and its application to automatic decomposition. United States: N. p., 1988. Web.
Fox, G C, & Furmanski, W. A string theory for time dependent complex systems and its application to automatic decomposition. United States.
Fox, G C, and Furmanski, W. Tue . "A string theory for time dependent complex systems and its application to automatic decomposition". United States.
@article{osti_6642509,
title = {A string theory for time dependent complex systems and its application to automatic decomposition},
author = {Fox, G C and Furmanski, W},
abstractNote = {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 neuralreverse arrowrouter and neuralreverse arrowaccumulator, which use an optimizing neural network. 15 refs., 11 figs.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {1988},
month = {3}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: