Influence of High-Level Languages on Computer Architecture

  • Hervé Gallaire
Conference paper
Part of the NATO Advanced Study Institutes Series book series (ASIC, volume 32)

Abstract

These papers have been entitled ‘Influence of High Level Languages on Computer Architecture’. In fact what will be presented attempts to cover both this topic and the opposite i.e the influence of computer architecture on high level languages. The reason for doing so is that some new concepts have been recently introduced, which have an impact on both architecture and languages. One such concept is that of ‘parallelism’ which will be thoroughly investigated in these papers. More specific implications like Algol-machines, APL machines will only be touched upon as they will be covered by Dr Wilner (7). These lectures will thus be divided into three chapters.

Keywords

Parallel Machine Computer Architecture Assignment Statement Array Processor Parallel Loop 
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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 0.
    Proceedings of the Conference on Programming Languages and Compilers for parallel and vector machines; Sigplan Notices 10,3 March 75.Google Scholar
  2. 1.
    Dahl O.J, Dijkstra E., Hoare C.A.R.; Structured Programming. Academic Press 1972.Google Scholar
  3. 2.
    Traub J.F. (ed); Complexity of Sequential and Parallel Numerical Algorithms. Academic Press 1973.Google Scholar
  4. 3.
    Geller D.P., Weinberg G.M., The Principle of Sufficient Reason. In (0) pp. 34–38.Google Scholar
  5. 4.
    Stone H.S., Problems of Parallel Computation. In (2) pp. 1–16.Google Scholar
  6. 5.
    Flynn M.J., Some Computer Organizations and their Effectiveness. IEEE Transactions on Computers, Vol. C-21, No.9, Sept. 72, pp. 948–960.Google Scholar
  7. 6.
    Amdahl G.M., Validity of the Single Processor Approach to Achieving Large Scale Computing Facilities. Proc. AFIPS, SJCC 67, pp. 483–485.Google Scholar
  8. 7.
    Wilner W.T., Problem-Language-Oriented Architecture. These Proceedings.Google Scholar
  9. 8.
    Minsky M., Papert S., On some Associative, Parallel, and Analog Computations. Associative Information Techniques, E.J. JACKS Ed., New York, Elsevier 1971.Google Scholar
  10. 9.
    Thurber K.J., Patton P.C., The Future of Parallel Processing IEEE T.C., Vol C-22, No.12, Dec. 73, pp. 1140–1143.Google Scholar
  11. 10.
    Balint F.J., Super User Problems Require Super Computers. IEEE Compcon, San Francisco, Feb. 76, pp. 130–132.Google Scholar
  12. 11.
    Owens J.L., The Influence of Machine Organization on Algorithms In (2), pp. 111–130.Google Scholar
  13. 12.
    Reddy D.R., Some Numerical Problems in Artificial Intelligence: Implications for Complexity and Machine Architecture. In (2), pp. 131–148.Google Scholar
  14. 13.
    Kuck D.J., Parallel Processor Architecture. A survey. 1975. Sagamore Computer Conference on Parallel Processing, pp. 15–39.Google Scholar
  15. 14.
    Ramamoorthy C.V., LI H.F., Pipelined Processors — A survey. 1975. Sagamore Comp. Conf. on Parallel Processing, pp. 40–62.Google Scholar
  16. 15.
    Sumner F.H., MU5 Computer System — These Proceedings.Google Scholar
  17. 16.
    Summer F.H., Woods J.V., The MU5 Computer System. AFCET, RAIRO Informatique Vol. 10, No. 1, Jan. 76, pp. 109–130.Google Scholar
  18. 17.
    Control Data STAR-100 Computer, Hardware Reference Manual, Control Data Corporation, St Paul, Minnesota.Google Scholar
  19. 18.
    Texas Instruments Advanced Scientific Computer System, in Multiprocessors and Parallel Processing, by Comtre Corporation. P.H. ENSLOW (ed. ), Wiley and Sons 1974.Google Scholar
  20. 19.
    Texas Instruments Inc. ‘The ASC System Central Processor’ AustinGoogle Scholar
  21. 20.
    Burroughs Corporation, ILLIAC IV Systems Characteristics and Programming Manual.Google Scholar
  22. 21.
    Barnes G., et al, The ILLIAC IV Computer. IEEE T.C., Vol. 17 Aug. 68, pp. 746–757.Google Scholar
  23. 22.
    Erickson D.B., Array Processing on an Array Processor. In (0) pp. 17–24.Google Scholar
  24. 23.
    Lawrie D.H., Access and Alignment of Data in an Array Processor. IEEE T.C., Vol. C-24, No 12, pp. 1145–1154.Google Scholar
  25. 24.
    Shapiro H.D., Storage Schemes in Parallel Memories. 1975. Sagamore Conference on Parallel Processing, pp. 159–166.Google Scholar
  26. 25.
    Cordonnier V.M., A Two Dimension Pipe-lined Processor for Communication in a Parallel System. As (24), pp. 115–121.Google Scholar
  27. 26.
    Siegel H.J., Analysis Techniques for SIMD Machine Interconnection Network and the Effects of Processor Address Mask. In (24).Google Scholar
  28. 27.
    Chen C.J., Franck A.A., On Programmable Parallel Data Routing Networks via Cross-bar Switches - 1974. Sagamore Conf., pp. 338.Google Scholar
  29. 28.
    Batcher K.E, Sorting Networks and their Applications. AFIPS 1968 SJCC, pp. 307–314.Google Scholar
  30. 29.
    Benes V.E., Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, N.Y. 1965.MATHGoogle Scholar
  31. 30.
    Keller R.M., A Novel Method of Constructing Sorting Networks. 1973 Sagamore Computer Conf. On parallel Processing, pp. 90.Google Scholar
  32. 31.
    Enslow P.H., Multiprocessor Architecture — A Survey. 1975. Sagamore Computer Conf. on Parallel Processing, pp. 63–70.Google Scholar
  33. 32.
    Swanson R.C., Interconnections for Parallel Memories to Unscramble p-ordered Vectors. IEEE TC, Vol. C-23, No 11, p. 1105.Google Scholar
  34. 33.
    Baskett F., Smith A.J., Interference in Multiprocessor Computer Systems with Interleaved Memory. CS Dept. Stanford University NO 74–450.Google Scholar
  35. 34.
    Kuck D., Maruyama K., Time Bounds on the Parallel Evaluation of Arithmetic Expressions. SIAM J. of Computing, Vol. 4, NO 2–75.Google Scholar
  36. 35.
    Brent R., The Parallel Evaluation of General Arithmetic Expressions. JACM, Vol. 21, (1974), pp. 201–206.MathSciNetMATHCrossRefGoogle Scholar
  37. 36.
    Presberg D.L., Johnson N.W., IVTRAN’S Parallelism Analyzer and Synthesizer. In (0), pp. 9–16.Google Scholar
  38. 37.
    Lamport L., The Coordinate Method for the Parallel Execution of Do Loops. 1973 Sagamore Conf., pp. 1–12.Google Scholar
  39. 38.
    Lamport L., The Hyperplane Method for an Array Computer 1974 Sagamore Conf. on Parallel Processing, pp. 113–131.Google Scholar
  40. 39.
    Lampwort L., The Parallel Execution of Do Loops. CACM, Vol. 17, NO 2, Feb. 1974, pp. 83–93.Google Scholar
  41. 40.
    Kuck D., et al., Measurements of Parallelism in Ordinary Fortran Programs. IEEE Computer, Jan. 1974, pp. 37–46.Google Scholar
  42. 41.
    Kuck D., Multioperation Machine Computional Complexity. In (2), pp. 17–47.Google Scholar
  43. 42.
    Schneck P.B., Automatic Recognition of Vector and Parallel Operations in a Higher Level Language — SIGPLAN, Vol. 7, NO 11.Google Scholar
  44. 43.
    Schneck P.B., Movement of Implicit Parallel and Vector expressions out of Program Loops. In (0) pp. 103–106.Google Scholar
  45. 44.
    Bernstein A.J., Analysis of Programs for Parallel Processing IEEE Ec., Oct. 1966, p. 757.Google Scholar
  46. 45.
    Baer J. L., A survey of Some Theoritical Aspects of Multiprocessing ACM Computing Surveys, Vol. 5, N0 1, 1973, pp. 31–80.Google Scholar
  47. 46.
    Massachusetts Computer Associates, the IV TRAN Manual, CADD 7-311-0111, Nov. 1973.Google Scholar
  48. 47.
    Millstein R.E., Muntz C.A., The ILLIAC IV Fortran Compiler. In (0), pp. 1–8.Google Scholar
  49. 48.
    Stevens K.G., CFD a Fortran Like Language for the ILLIAC IV In (0), pp. 72–76.Google Scholar
  50. 49.
    Lawrie D.H., et al., Glypnir a Programming Language for the ILLIAC IV CACM, Vol. 18, NO 3, March 75, pp. 157–164.Google Scholar
  51. 50.
    Milton R.L., Preliminary Results of a Comparative Analysis of ILLIAC IV Languages. 1975. Sagamore Conf., pp. 172–179.Google Scholar
  52. 51.
    Wedel D., Fortran for the TIASC. In (0), pp. 119–132.Google Scholar
  53. 52.
    Basili V.R., Knight J.C., A Language Design for Parallel Processing. In (0), pp. 39–43.Google Scholar
  54. 53.
    Zosel M.E., A Modest Proposal for Vector Extensions to ALGOL. In (0), pp. 62–71.Google Scholar
  55. 54.
    Zwakenberg R., et al., Vector Extensions to LRL TRAN. In (0), pp. 77–86.Google Scholar
  56. 55.
    Karp R.M., Rutledge J.D., Generating a Data Flow Model of a Program. IBM Technical Disclosure Bulletin, Vol. 8, NO 11, 1966.Google Scholar
  57. 56.
    Karp R.M., Miller R.E., Properties of a Model for Parallel Computations. SIAM J. Of Applied Maths, Vol. 14, NO 6, Nov. 66.Google Scholar
  58. 57.
    Adams D.A., A Computation Model with Data flow Sequencing. Tech. Report CS 117, Stanford University, Dec. 68.Google Scholar
  59. 58.
    Dennis J.B., Packet Communication Architecture. 1975 Sagamore Conf. On Parallel Processing, pp. 224–230.Google Scholar
  60. 59.
    Dennis J.B., First Version of a Data flow Procedure Language. Programming Symposium, Paris, April 1974, pp. 362–375, Springer Verlag.Google Scholar
  61. 60.
    Dennis J.B., Minsunas D.P., A Preliminary Architecture for a Basic Data Flow Processor, 2nd Annual Symp. On Computer Architecture, A C M Sigarch 1974, Vol. 3, NO 4.Google Scholar
  62. 61.
    Rumbaugh J.E., A Parallel Asynchronous Computer Architecture for Data Flow Programs. Ph D. Thesis, MIT Project MAC, 1975.Google Scholar
  63. 62.
    Rumbaugh J.E., Data Flow Languages. 1975 Sagamore Conf. On Parallel Processing, pp. 217–219.Google Scholar
  64. 63.
    Tesler L.G., Enea H.J., A Language Design for Concurrent Processes. AFIPS, SJCC Vol. 32, 1968, pp. 403–408.Google Scholar
  65. 64.
    Urschler G., The Transformation of Flow Diagrams into Maximally Parallel Form. 1973 Sagamore Conf. On Parallel Processing.Google Scholar
  66. 65.
    Syre J.C., Parallelism, Control and Synchronisation Expression in a Single Assignment Language. 4th ACM Computer Science Conference, Anaheim, Feb. 76.Google Scholar
  67. 66.
    Comte D., et al., Techniques et Exploitation de l’Assignation Unique. Vol. 5–8 — Rapport CERT - Toulouse.Google Scholar
  68. 67.
    Gelly O., et al., LAU System Software. 1976 International Conference on Parallel Processing, 1976 — Detroit.Google Scholar
  69. 68.
    Plas A., et al., LAU System Architecture 1976. International Conference on Parallel Processing, Aug. 76 — Detroit.Google Scholar
  70. 69.
    Klinkhammer J.F., A Definitional Language. Philips Research Lab., Internal Report Eindhoven (Holland).Google Scholar
  71. 70.
    Chamberlin D.D., Parallel Implementation of a Single Assignment Language. Ph. D Thesis, Jan. 71. Stanford University.Google Scholar
  72. 71.
    Arvind, Gostelow K.P., A New Interpreter for Data Flow Schemas. ACM Computer Conference Anaheim, Feb. 76.Google Scholar
  73. 72.
    Roucairol G.P., Two Transformations of Single Assignment Programs. Institut de Programmation Paris, NO 75–15.Google Scholar
  74. 73.
    Haberman N.A., Path Expression. Internal Report, Carnegie Mellon University, June 75.Google Scholar
  75. 74.
    Hoare C.A.R., Monitors: An Operating System Structuring Concept. CACM 17, Oct. 74, pp. 549–557.Google Scholar
  76. 75.
    Campbell R.H., The Specification of Process Synchronization by Paths Expressions. Colloque IRIA, April 74, pp. 93–106.Google Scholar
  77. 76.
    Miller R.E., Cocke J., Programmable Computers, A new class of General Purpose Machines. Theoretical Programming Syrap. Novosibirsk, Aug. 72.Google Scholar

Copyright information

© D. Reidel Publishing Company, Dordrecht-Holland 1977

Authors and Affiliations

  • Hervé Gallaire
    • 1
    • 2
  1. 1.E.N.S.A.E.ToulouseFrance
  2. 2.C.E.R.T./O.N.E.R.A.ToulouseFrance

Personalised recommendations