An APL-simulator of non-Von Neumann computer architectures

ABSTRACT

APL has a long tradition as a language for the notation of computer architectures that dates back to its use as notation of the IBM 360 system. Its powerful primitives and compactness make it an ideal tool for simulating hardware functions in order to gain insights into the functionality, the performance and the programming issues of an algorithm without the need to undergo the painstaking process of actually building the target machine and implementing the program on it. We have developed an APL2 software simulator for Non-Von Neumann computers. The basic data structure of the system is an array whose elements model a number of RAMs containing control registers, data and program code. The user can “define” his/her machine by specifying the communication network and communication primitives, the instruction set and its semantics, and the complexity measure. We demonstrate the use of the program system for studying various schemes for adaptive load sharing on multicomputers.

REFERENCES

• Athas, Seitz: William C. Athas , Charles L. Seitz, Multicomputers: Message-Passing Concurrent Computers, Computer, v.21 n.8, p.9-24, August 1988 [doi>10.1109/2.73]
• Bruin et.al: A. de Bruin , H. G. R. Kan, A simulation tool for the performance evaluation of parallel branch and bound algorithms, Mathematical Programming: Series A and B, v.42 n.2, p.245-271, February 1, 1988 [doi>10.1007/BF01589406]
• Dikshit et.al: P. Dikshit , S. K. Tripathi , P. Jalote, SHAYOG: a test bed for evaluation dynamic load-sharing policies, Software—Practice & Experience, v.19 n.5, p.411-435, May 1989 [doi>10.1002/spe.4380190502]
• Eager et.al: Derek L. Eager , Edward D. Lazowska , John Zahorjan, Adaptive load sharing in homogeneous distributed systems, IEEE Transactions on Software Engineering, v.12 n.5, p.662-675, May 1986
• Karlin, Upfal: Anna R. Karlin , Eli Upfal, Parallel hashing: an efficient implementation of shared memory, Journal of the ACM (JACM), v.35 n.4, p.876-892, Oct. 1988 [doi>10.1145/48014.350550]
• Leiserson, Maggs: Leiserson C.E. and B.M. Maggs, Communication-Efficient Parallel Algorithms for Distributed Random-Access Machines, Algorithmicn,3,53 - 77,1988
• Matulka: Matulka J., TCP/UDP Performance as Experienced by User-Level Processes, EUUG Conference Proceedinga, Autumn 89, 179-188
• Parberry: Ian Parberry, Parallel complexity theory, John Wiley & Sons, Inc., New York, NY, 1987
• Taudes: Alfred Taudes, Communication Heuristics in Distributed Combinatorial Search Algorithms, Proceedings of the 3rd International Workshop on Distributed Algorithms, p.268-279, September 26-28, 1989
• Van Cleave, 1985a: Van Cleave P., Using APL to Write an Assembler, in: APL as a Tool of Thought 111, NYSIGAPL, 50-55, 1985
• Van Cleave, 1985b: Van Cleave P., APL as a Tool for Teaching Computer Theory, in: APL as a Tool of Thought 111, NYSIGAPL, 56-60, 1985

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: APL

Additional Classification:
  B. Hardware
  B.3 MEMORY STRUCTURES
      B.3.3 Performance Analysis and Design Aids**
          Subjects: Simulation**
  B.5 REGISTER-TRANSFER-LEVEL IMPLEMENTATION
      B.5.2 Design Aids
          Subjects: Simulation

  C. Computer Systems Organization
  C.1 PROCESSOR ARCHITECTURES
      C.1.2 Multiple Data Stream Architectures (Multiprocessors)
          Subjects: Parallel processors**

  E. Data
  E.1 DATA STRUCTURES
      Subjects: Arrays

General Terms:
Design, Experimentation, Languages