Chapter 3 1952 1968 Early History of Software

Chapter 3 – 1952 -1968 Early History of Software

Software l What is software? Programming? l Extremes – Microcode vs. Interface l Read comments - Page 81 l How did hw & sw fit together?

Very Early Days l Summer 1944 - Grace Hopper to Harvard – Howard Aiken, MARK I –Pg. 82 – l “Thus began the process of computer programming in the U. S. ” l Idea for multiple tapes - for code reuse

Early Programming Mark III – typed commands, stored on magnetic tape, executed – (p 83 pix) l Zuse – “Plan Preparation Machine” l – – Commands on tape, check syntax, translated *Rutishauser – Why separate device? EDSAC- library of paper tape code – Wheeler Jump subroutine call l None stored in internal memory l

Early Computers l l l UNIVAC 1952 Today translate to machine code Punch Cards: pre-punched + transitional = compile Grace Hopper: A-0 compiler at UNIVAC – Automatic programming – To handle subroutines by copying them into main Idea: “ Interchangeable parts” too inflexible – Realized were standardizing the wrong level of work

Whirlwind @ MIT l J. H. l Laning & N. Zierler “A program for translation of mathematical equations for Whirlwind I” - 1954 – Behaved like modern compilers – Not general purpose - algebraic equations Backus (FORTRAN) – Elegant but threatened the “priesthood” Knuth – too slow – –

Assemblers l Systems Programming Languages l One-to-one binary (machine) code l Macro instructions l Symbolic Addressing (variables)

SHARE l 1955 - IBM 701 users in L. A. l Compiled library of routines l Grew to 62 members l IBM responded to opinions l Helped transition to 704

Sorting l l l Applications - Files on tape Up to 1973 - 25% compute time – sorting People “used” printed reports, not computer Betty Holberton @ UNIVAC-1952 – Sorted small groups and merged with master file – Knuth – “ 1 st major software routine ever developed for automatic programming Later disks & linked lists - plus

FORTRAN - 1957 Formula Transistor- scientific l IBM for 704, John Backus l Still widely used l Key to success: generated code as efficient as written code l Fast; 704 had floating point hardware l Combination of hiding and access l

COBOL-1959 l l Common Business Oriented Language Dept. of Defense – – – l l Produced language specifications U. S. govt. : all h. w. must handle COBOL Thus, one of 1 st standardized Grave Hopper @ UNIVAC – Flow-matic - Use long character names Year 2000 bug – Not really self documenting

Other Early Languages l l l ALGOL- Europe, 1958 -1960 – Hardware independent – Specified in BNF JOVIAL – Def. Dept. Variant of ALGOL for SAGE – Still used recently LISP – AI - Lists SNOBOL - Strings RPG – IBM - still used – AS 400

Early System Software l Operator scheduled all resources l Soon became too complex l IBM - Job Control Language (JCL) – What compiler – data or code l 1990’s Operating System

MAD: Michigan Algorithmic Decoder University students needed “help” & needed efficient use of computers l 1959: ALGOL Based l *Fast Compile *Good Diagnostics l – l Memory Dumps Helped to keep computer busy NOTE: No applications software!

Evolution of Operation Systems l l l Grew in complexity, size, consumption – Monitor – Supervisor system – Operating system DOS to Windows (GUI) IBM System/360 -1966 – OS/360 - business + scientific - Failure l Mini-computers-1960’s – OS development started over – Small memories – l VMS for VAX (DEC)1978 Personal Computers – OS development started over Again!

Computer Science With Mathematics & Electrical Engineering l Stanford and Purdue – 1950’s l Stanford – George Forsythe l – – Mathematics 1961 Separate Dept. 1965 Study of computers vs. Study of Algorithms l ACM Curriculum ‘ 68 (2013) l

Computer Science (cont. ) l 1968 – ACM – Curriculum - no h. w. l 1964 -12 University degrees l 1968 - 100 l 1980 - Most popular major in the US

Donald Knuth- “The Art of Computer Programming” l 1968 Published 1 st volume of 7 l 1: Fundamental Algorithms l 2: Semi numerical Algorithms l 3: Searching and Sorting

Knuth Cont. l TBA - in progress l 4: Combinatorial Algorithms l 5: Syntactic Algorithms l Maybe - “God Willing” l 6: Theory of Context free languages l 7: Compiler Techniques l www-cs-faculty. stanford. edu/~Knuth/taocp. html

Structured Programming l Edsger Dijkstra – – l Tech. Univ. of Eindhoren, Neth. University of Texas March 1968 - CACM “For a number of years I have been familiar with the observation that the quality of programmers is decreasing function of the frequency of GOTO statements in the programs they produce” Much Debate, but slow change

Intellectual Property Letters in CACM, 1968 l Rockford Inst. , Calvin Mooers l – – l Sought legal protection for TRAC language No alterations, changes, etc. Bernard Galler, MAD, Michigan – MAD & others had been improved by users TRAC failed - too early for protection l Set stage for future laws/ lawsuits l

Software Engineering l 1968 - NATO conference “Software Engineering” – “Crisis” Programmers lacked “ theoretic foundations & disciplines of daily practice” from traditional engineering l No certification nor chain of legal responsibility l Continues to be debated l SE Certification in Texas l

Unbundling l Separate H. W. and S. W. l 1968 - IBM – Government pressure – CICS (Customer Info. Control System) l Opened vendors door for commercial

UNIX l 1969– – – Bell labs in N. J. Ken Thompson, Dennis Ritchie PDP-7 Language “B” – “C” in 1973 l Contrast to ALGOL 68 & PL/1 l Pascal- Nicholas Wirth, Sweden

Chapter 3 – 1952 -1968 Early History of Software