Advertisement

Programming with active data

  • Chris Jesshope
  • Philip Miller
  • Jelio Yantchev
Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 342)

Abstract

In this paper we have defined a virtual systems architecture (VSA), which combines both data parallel and process parallel models of computation. Data manipulations strategies for the efficient implementation of the VSA have been considered for various data types and algorithms, which show that a packet based virtual array implementation is required. We introduce a packet routing scheme the mad postman that is shown to have considerably better latency properties than previously published results and considered synchronous cellula automata to implement this scheme. In general, the mad postman is most advantageous to use in lower dimension networks, for example 2-D meshes, where latency is usually higher due to higher network diameter. In such networks the efficiency of the mad postman routing will be higher due to the smaller number of dead address digits generated per each packet. Such networks match form to function, and in current implementation technologies (i.e VLSI chips and PCBs), they will therefore provide cheaper hardware, thus allowing for a higher cost/performance ratio to be achieved.

Keywords

Virtual Network Systolic Array Virtual Channel Physical Node Virtual Processor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

9. References

  1. [1]
    Reddaway, S. F.: DAP — a distributed array processor, First Ann. Symp. on Computer Architecture, Gainsville, (1973), 61–65.Google Scholar
  2. [2]
    INMOS Ltd,: The transputer family 1987, INMOS Ltd, 1987.Google Scholar
  3. [3]
    Jesshope, C. R.: Implementations of load balanced active-data models of parallel computation. Concurrent Computations: Algorithms, Architectures and Technology (Eds. S. K. Tewksbury, B. W. Dickinson and S. C. Schwartz) Plenum press, New York.Google Scholar
  4. [4]
    INMOS Ltd.: The Ooccam 2 reference manual, Prentice Hall, Hemel Hempstead 1988.Google Scholar
  5. [5]
    Hillis, W. D.: The connection machine, MIT Press, Massacvhusetts, 1985.Google Scholar
  6. [6]
    Cruz, A. J. O.: The design of a control unit and parallel algorithms for a SIMD computer, Ph.D. Thesis, Southampton University, Dept. of Electronics and Comp. Sci., 1988.Google Scholar
  7. [7]
    Yantchev J. and C. R. Jesshope: Deadlock free packet routing with bounded buffering for asynchronous regular arrays of processors, Preprint submitted to IEE Proc E.Google Scholar
  8. [8]
    Roscoe, A.W. and Dathi, N.,: The Pursuit of Deadlock Freedom, Oxford University Computing Laboratory technical monograph PRG-57.Google Scholar
  9. [9]
    Dally, William J.: A VLSI Architecture for Concurrent Data Structures, Kluwer Academic Publishers, Boston, 1987.Google Scholar
  10. [10]
    Kermani, P. and L. Kleinrock: Virtual Cut-Through: A New Computer Communication Switching Technique, Computer Networks, 3, (1979), 267–286.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Chris Jesshope
  • Philip Miller
  • Jelio Yantchev
    • 1
  1. 1.Department of Electronics and Computer ScienceThe UniversitySouthamptonEngland

Personalised recommendations