The SDAARC architecture

While traditional parallel computing systems are still struggling to gain a wider acceptance, the largest parallel computer that has ever been available is currently growing with the communication resource Internet. Unfortunately it is also rarely used in the parallel computation field. The reason for the rejection of parallel computers is mainly the difficulty of parallel programming. In this paper we propose the Self Distributing Associative ARChitecture (SDAARC). It has been derived from the Cache Only Memory Architecture (COMA). COMAs provide a distributed shared memory (DSM) with automatic distribution of data. We show how this paradigm of data distribution can be extended to the automatic distribution of instruction sequences (microthreads). We show how microthreads can be extracted from legacy C code to produce code that can automatically be parallelized by SDAARC at run time. We also discuss how SDAARC can be implemented on a rightly coupled multiprocessor systems on heterogenous LAN based computer networks (Intranet) and on WANs of computing resources.

[1]  Eduard Ayguadé,et al.  A framework for automatic dynamic data mapping , 1996, Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing.

[2]  Seif Haridi,et al.  Data Diffusion Machine - A Scalable Shared Virtual Memory Multiprocessor , 1988, FGCS.

[3]  Viktor K. Prasanna,et al.  Efficient Algorithms for Block-Cyclic Redistribution of Arrays , 1999, Algorithmica.

[4]  Paul W. A. Stallard,et al.  Hiding Miss Latencies with Multithreading on the Data Diffusion Machine , 1995, ICPP.

[5]  Clifford Neuman.  Security, accounting, and assurance , 1998 .

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

[7]  Erik Hagersten,et al.  The Cache Coherence Protocol of the Data Diffusion Machine , 1989, PARLE.

[8]  Monica S. Lam,et al.  Maximizing Multiprocessor Performance with the SUIF Compiler , 1996, Digit. Tech. J..

[9]  Bernd Klauer,et al.  Combining Static Partitioning with Dynamic Distribution of Threads , 1998, DIPES.

[10]  Erik Hagersten,et al.  The Cache Coherence Protocol of the Data Diffusion Machine , 1989 .

[11]  Rajesh Raman,et al.  High-throughput resource management , 1998 .

[12]  Bradley C. Kuszmaul,et al.  Cilk: an efficient multithreaded runtime system , 1995, PPOPP '95.

[13]  Anoop Gupta,et al.  Comparative performance evaluation of cache-coherent NUMA and COMA architectures , 1992, ISCA '92.

[14]  Walid A. Najjar,et al.  Comparison of two storage models in data-driven multithreaded architectures , 1996, Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing.

[15]  Erik Hagersten,et al.  DDM - A Cache-Only Memory Architecture , 1992, Computer.

[16]  Rishiyur S. Nikhil,et al.  A Multithreaded Implementation of Id using P-RISC Graphs , 1993, LCPC.

[17]  Bernd Klauer,et al.  Tailoring a self-distributing architecture to a cluster computer environment , 2000, Proceedings 8th Euromicro Workshop on Parallel and Distributed Processing.

[18]  Bernd Klauer,et al.  A Combined Virtual Shared Memory and Network which Schedules , 1997, Euro-PDS.

[19]  Bernd Klauer,et al.  Automatic scheduling for cache only memory architectures , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.

[20]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..