Published January 1988
| public
Book Section - Chapter
A string theory for time dependent complex systems and its application to automatic decomposition
- Creators
- Fox, Geoffrey C.
- Furmanski, Wojtek
- Other:
- Fox, Geoffrey
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.
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.Additional details
- Eprint ID
- 71420
- DOI
- 10.1145/62297.62329
- Resolver ID
- CaltechAUTHORS:20161024-162621912
- DE-FG03-85ER25009
- Department of Energy (DOE)
- Joint Tactical Fusion Office
- U.S. Air Force
- IBM
- Sandia National Laboratories
- Created
-
2016-10-24Created from EPrint's datestamp field
- Updated
-
2021-11-11Created from EPrint's last_modified field