Parallel Computers for the Simulation of Complex Systems
|
Complex Systems for the theory of Computer and Network Architecture
|
Complex Systems for new Computational Methodologies
|
001 Complex Systems and Parallel Computing Australian International Conference on Complex Systems Australian National University Canberra, Australia December 14-16, 1992 Geoffrey C. Fox 002 The Three Themes of Lecture: Parallel Computers and Complex Systems 003 Issues in Parallel Computers for the Simulation of Complex Systems 004 Standard Performance Graph Heading to 1 to 10 Teraflops by year 2000 005 When will parallel computing take over? 006 The President's High Performance Computing and Communication Initiative (HPCCI) 007 Challenges and Status of Parallel Computing 008 High Performance Fortran Overview 009 HPF computational model 010 Example of Fortran-90D source code: Gaussian Elimination 011 HPF directives 012 Data Alignment and Distribution Directives 013 Examples of Alignments (1) 014 Examples of Distributions (1) 015 For More Information on HPF 016 FORTRAN-90D The First Implementation of HPF (NPAC, Syracuse University) Current Status 017 Common Software needed for Heterogeneous Local Area Network (Ethernet - FIDDI - HIPPI - FCS ......) 018 Importance of MetaProblems 019 Hybrid Problem Structure for Command and Control 020 The Mapping of Heterogeneous Problems onto Heterogeneous Computer Systems 021 SIMCITY is an interesting PC based complex system simulation. 022 Implementation of Complex System Simulation 023 AVS as System Integration Tool 024 Parallel AVS - Planned Project at NPAC 025 Architecture of Parallel AVS System 026 VR Operating Shells 027 Components of Proposed Televirtuality Server at NPAC 028 A Theory of Parallel Computing based on Complex Systems 029 Computing as a set of Mapping Problems 030 Complex Systems to give a theory of computing 031 Parallel Computing is "just" an optimization problem, even if we can't agree on what to optimize 032 Concurrent Computation as a Mapping Problem -I 033 Concurrent Computation as a Mapping Problem - II 034 Computation as a map of a set of Complex Systems 035 Domain Decomposition and Complex Systems ? 036 Physical Analogy for Complex Computer 037 The Physical Space/TimeAnalogy for a General Problem 038 Some Temporal Properties of Computation 039 General Space Time Complex System Picture for Problem to Computer Mapping 040 Computer Languages and Space - Time Properties 041 Information Dimension of a General Complex System 042 Performance of a Parallel Computer 043 Hierarchical Multicomputer Spatial and Temporal Decomposition 044 Shared or Hierarchical Memory Computer 045 Comparison of Cache and Distributed Memory Communication Overhead 046 Extension of Space-Time Picture to treat Hierarchial memory and caches etc. 047 Space-Time Decompositions for the concurrent one dimensional wave equation 048 Typical Example of Mapping an Irregular Bunch of Grid Points 049 Use of Physical Optimization in High Performance Fortran 050 Physics Analogy for Load Balancing 051 Complex System SHLSoft governed by Hamiltonian = Execution Time 052 Decomposition of an Arch onto 16 Processors in a Hypercube 053 PHYSICS ANALOGY FOR STATIC AND DYNAMIC LOAD BALANCING 054 General definition of temperature TS of a complex system 055 Particle dynamics problem on a four node system 056 Instantaneous Energy Distribution for Time Dependent Domain Decomposition and Block Scattered Distributions 057 Time Averaged Energy for Adaptive Particle Dynamics Problem 058 A general theory of computation 059 HISTORICALLY ONE OF THE MOTIVATIONS FOR THE RESEARCH WAS TO " AUTOMATE" THE KNOWN FOLD ALGORITHM 060 The String Formalism for Dynamic Computations 061 Loosely Synchronous Static and Adaptive Problems in the String Picture 062 An initial approach to computational string dynamics or equivalently the Construction of the Energy Function 063 Full String Dynamics as an Interacting Field Theory 064 Complex systems suggest new computational methodologies 065 Physical Optimization and Computation Approaches and their Field of Origin 066 Genetic Algorithms for Data Decomposition 067 Three Major Genetic Operators 068 MultiScale Methods in Parallel Data Decomposition 069 Results of Various Physical Optimization Methods for Data Decomposition 070 A similar but Larger Problem 071 Some Overall Questions Relevant In Classisfying Optimization Problems and Methods 072 Two Types of Global Mininum and their relation to Local Minima 073 Typical Formalism for Physical Optimization 074 Global and Local Minima in Temperature Dependent Free Energy 075 Comparison of Physical Optimization Methods 076 Some Applications of Deterministic Annealing 077 Simulated Tempering -- a New Approach to Monte Carlo Optimization/Simulated Annealing 078 The Conventional Simulated Annealing and its Problems for Random Field Ising Models 079 Key Idea in The Tempering Approach 080 Goodbye! Many Choices - Which is best When?