Continuum computer architecture for nano-scale and ultra-high clock rate technologies

Continuum computer architecture (CCA) is a non-von Neumann architecture that offers an alternative to conventional structures as digital technology evolves towards nano-scale and the ultimate flat-lining of Moore's law. Coincidentally, it also defines a model of architecture particularly well suited to logic classes that exhibit ultra-high clock rates (> 100 GHz) such as rapid single flux quantum (RSFQ) gates. CCA eliminates the concept of the "CPU" that has dominated computer architecture since its inception more than half a century ago and establishes a new local element that merges the properties of state storage, state transfer, and state operation. A CCA system architecture is a simple multidimensional organization of these elemental blocks and physically may be considered as a new family of cellular computer. But CCA differs dramatically from conventional cellular automata. While both deliver emergent global behavior from the aggregation of local rules and ensuing operation. The CCA emergent behavior is a global general-purpose model of parallel computation, as opposed to simply mimicking some limited phenomenon like heat and mass transfer as do conventional cellular automata. This paper presents the motivation and foundation concepts of CCA and exposes key issues for further work.

[1]  T. von Eicken,et al.  Parallel programming in Split-C , 1993, Supercomputing '93.

[2]  Seth Copen Goldstein,et al.  TAM - A Compiler Controlled Threaded Abstract Machine , 1993, J. Parallel Distributed Comput..

[3]  Burton J. Smith.  Architecture And Applications Of The HEP Multiprocessor Computer System , 1982, Optics & Photonics.

[4]  Allan Porterfield,et al.  The Tera computer system , 1990 .

[5]  Andrea C. Arpaci-Dusseau,et al.  Parallel programming in Split-C , 1993, Supercomputing '93. Proceedings.

[6]  Guang R. Gao,et al.  Hybrid technology multithreaded architecture , 1996, Proceedings of 6th Symposium on the Frontiers of Massively Parallel Computation (Frontiers '96).

[7]  Seth Copen Goldstein,et al.  Active Messages: A Mechanism for Integrated Communication and Computation , 1992, [1992] Proceedings the 19th Annual International Symposium on Computer Architecture.

[8]  Larry A. Bergman,et al.  A design analysis of a hybrid technology multithreaded architecture for petaflops scale computation3 , 1999, ICS '99.

[9]  Mateo Valero,et al.  Multiple-banked register file architectures , 2000, Proceedings of 27th International Symposium on Computer Architecture (IEEE Cat. No.RS00201).

[10]  Chun Chen,et al.  The architecture of the DIVA processing-in-memory chip , 2002, ICS '02.

[11]  Wolfgang Porod,et al.  Quantum cellular automata , 1994 .

[12]  K. K. Likharev,et al.  Rapid Single-Flux-Quantum Logic , 1993 .

[13]  William J. Dally,et al.  The J-machine Multicomputer: An Architectural Evaluation , 1993, Proceedings of the 20th Annual International Symposium on Computer Architecture.

[14]  Tommaso Toffoli,et al.  Cellular automata machines - a new environment for modeling , 1987, MIT Press series in scientific computation.

[15]  Robert H. Halstead,et al.  MULTILISP: a language for concurrent symbolic computation , 1985, TOPL.

[16]  Carl Hewitt,et al.  The incremental garbage collection of processes , 1977, Artificial Intelligence and Programming Languages.

[17]  Joonhee Kang,et al.  4.6 GHz SFQ shift register and SFQ pseudorandom bit sequence generator , 1995, IEEE Transactions on Applied Superconductivity.

[18]  Thomas L. Sterling,et al.  Gilgamesh: A Multithreaded Processor-In-Memory Architecture for Petaflops Computing , 2002, ACM/IEEE SC 2002 Conference (SC'02).

[19]  H. T. Kung,et al.  Systolic Arrays for (VLSI). , 1978 .

[20]  Henry G. Baker,et al.  Actors and Continuous Functionals , 1978, Formal Description of Programming Concepts.

[21]  K. Likharev,et al.  Rapid single flux quantum T-flip flop operating up to 770 GHz , 1999, IEEE Transactions on Applied Superconductivity.

[22]  Alexander Yu. Vlasov,et al.  On Quantum Cellular Automata , 2004, ArXiv.

[23]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[24]  Iain S. Duff,et al.  Sparse Matrix Proceedings 1978 , 1979 .