Computer programming in the punch card era

From the invention of computer programming languages into the 1980s, many if not most computer programmers created, edited and stored their programs on punch cards. The practice was nearly universal with IBM computers in the era. In many organizations, programmers carefully wrote out their programs on special forms called coding sheets, taking care to distinguish the digit zero from the letter "O," the digit one from the letter "I," 8's from "Bs," 2's from "Zs," and so on. Completed forms were sent to the keypunch department where operators typed them in, one line to a card. In other shops, programmers did their own keypunching.

Program editing was generally done at the keypunch. It was easy to reorder program statements. A single character typo could be corrected by duplicating the card up to the error column, typing the correct character and then duplicating the rest of the card. More complex edits were harder and might require retyping the line after the point of error.

Many early programming languages, including Fortran, Cobol and the various IBM assembler languages, used only the first 72 columns of a card—a tradition that traces back to the card reader used on the IBM 704 computer. Columns 73-80 were ignored by the compiler and could be used for identification, such as adding a sequence number so that if the card deck was dropped it could be restored to its proper order using a card sorter. Programmers often didn't bother doing this during development or for student projects and, instead, frequently drew a diagonal stripe across the top of the deck using a marking pen as a check for proper order. Programs were backed up by duplicating the entire deck or by having it written onto a magnetic tape.

In many mainframe operations, known as closed shops, programmers submitted the program decks, often followed by data cards to be read by the program, to a person working behind a counter in the computer room. Many computer installations used cards with the opposite corner cut (sometimes no corner cut) as "job separators", so that an operator could stack several job decks in the card reader at the same time and be able to quickly separate the decks manually when he removed them from the stacker. These cards (e.g., a JCL "JOB" card to start a new job) were often prepunched in large quantities in advance. [ [http://www.columbia.edu/acis/history/cards.html Columbia University Computing History: IBM Cards] ] This was especially useful when the main computer did not read the cards directly, but instead read their images from magnetic tape that was prepared offline by smaller computers such as the IBM 1401. After running it, the computer operator would return the card deck and any hardcopy printed output, typically to one of a set of alphabetically-labelled cubby holes, based on the programmer's last initial.

Depending on workloads and project priority the process could take hours; overnight and 24 hour turnaround times were not uncommon. Dedicated geeks of the era might stay up all night to get a few quick turn-arounds in the early morning hours -- otherwise unavailable, using this very expensive equipment -- mainframe computer usage was measured in seconds per job, and every job was charged to an account. Other operations, such as those using smaller computers like the IBM 650, 1620 and 1130, were run as an open shop, where programmers had use of the computer for a block of time. A keypunch was usually located nearby for quick corrections. This was all batch-mode processing, as opposed to interactive processing.

ee also

*cite web
last = Fisk
first = Dale
title = Programming with Punched Cards
date = 2005
url = http://www.columbia.edu/acis/history/fisk.pdf
accessdate = October 2006
* [http://www.columbia.edu/acis/history/ssio.html Columbia University Computing History: The Columbia University Self Service Input/Output Area]

References

*E. I. Organick, "A Fortran IV Primer", Addison-Wesley, 1966

External links

* [http://www.computercollector.com/archive/ibm/pcdpp/ IBM Punched Card Data Processing Principles (1961) hosted at www.computercollector.com]

Notes