ACM Home Page
Please provide us with feedback. Feedback
A comparison of batch processing and instant turnaround
Full text PdfPdf (767 KB)
Source
Communications of the ACM archive
Volume 10 ,  Issue 8  (August 1967) table of contents
Pages: 495 - 500  
Year of Publication: 1967
ISSN:0001-0782
Author
Lyle B. Smith  Stanford Univ., Stanford, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 15,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/363534.363552
What is a DOI?

ABSTRACT

A study of the programming efforts of students in an introductory programming course is presented and the effects of having instant turnaround (a few minutes) as opposed to conventional batch processing with turnaround times of a few hours are examined. Among the items compared are the number of computer runs per trip to the computation center, program preparation time, keypunching time, debugging time, number of runs, and elapsed time from the first run to the last run on each problem. Even though the results are influenced by the fact that “bonus points” were given for completion of a programming problem in less than a specified number of runs, there is evidence to support “Instant” over “Batch”.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
BECKER, H. B. Time-sharing: the next step. Comput. Autom. (Oct. 1966), 18.
 
4
SMITH, L. B. Part one: A comparison of batch processing and instant turnaround. Part two: A survey of most frequent syntax and execution-time errors. Stanford Computation Center, Feb. 1967.