Performance evaluation
- 1 September 1981
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 10 (3) , 106-109
- https://doi.org/10.1145/1010629.805480
Abstract
What is experimental computer science? This question has been widely discussed ever since the Feldman Report was published (1979 [18]). Many computer scientists believe that survival of their discipline is intimately linked to their ability to rejuvenate experimentation. The National Science Foundation instituted the Coordinated Experimental Research Program (CERP) in 1979 to help universities set up facilities capable of supporting experimental research. Other agencies of government are considering similar programs. Some industrial firms are offering similar help through modest cash grants and equipment discounts. What is experimental computer science? Surprisingly, computer scientists disagree on the answer. A few believe that computer science is in flux—making a transition from theoretical to experimental science—and, hence, no operational definition is yet available. Some believe that it is all the non-theoretical activities of computer science, especially those conferring “hands-on” experience. Quite a few believe that it is large system development projects—i.e., computer and software engineering—and they cite MIT's Multics, Berkeley's version of Bell Labs' UNIX, the ARPAnet, IBM's database System R, and Xerox's Ethernet-based personal computer network as examples. These beliefs are wrong. There are well-established standards for experimental science. The field of performance evaluation meets these standards and provides examples of experimental science for the rest of the computing field.Keywords
This publication has 20 references indexed in Scilit:
- Computational algorithms for product form queueing networksCommunications of the ACM, 1980
- Measuring and Calculating Queue Length DistributionsComputer, 1980
- Social processes and proofs of theorems and programsCommunications of the ACM, 1979
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Computational algorithms for closed queueing networks with exponential serversCommunications of the ACM, 1973
- Analysis of system bottlenecks using a queueing network modelPublished by Association for Computing Machinery (ACM) ,1971
- Sorting in a paging environmentCommunications of the ACM, 1970
- An anomaly in space-time characteristics of certain programs running in a paging machineCommunications of the ACM, 1969
- Dynamic space-sharing in computer systemsCommunications of the ACM, 1969
- A study of replacement algorithms for a virtual-storage computerIBM Systems Journal, 1966