Arnold Allen (mathematician)

Last updated

Arnold Oral Allen (died 2004) was an American instructor, public speaker, and writer who worked at IBM and Hewlett-Packard, and specialized in the analysis and mathematical modelling of computer performance.

Contents

Biography

Allen earned a Ph.D. in mathematics at UCLA in 1962 under Angus Taylor with a dissertation entitled Banach and Hilbert Spaces of Analytic Functions, [1] where he later lectured. At IBM, he taught at the Information Systems Management Institute in Los Angeles, California. Later, at Hewlett-Packard, he was a member of the Performance Technology Center, then a researcher at the Advanced Technology Group in Roseville, California.

Allen was elected as a director of the Computer Measurement Group (CMG), and selected to be the keynote speaker at two international conferences. He was an invited speaker at the Sixth International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, held in Edinburgh, Scotland in September 1992.

In 1994, he received the Computer Measurement group's A. A. Michelson award for technical excellence and professional contributions as a teacher and inspirer of others. [2]

Work

Allen is most well known as the author of the book, Probability, Statistics, and Queueing Theory with Computer Science Applications. [3] Originally published in 1978, and still in print in 2007, it is widely used as a university textbook, by practitioners of computer performance analysis, and by those wishing to apply probability, statistics and queueing theory techniques to solve problems in other fields, such as operations research, management science, engineering, and physics.

At IBM and Hewlett-Packard, Allen's students were typically systems engineers and project managers, not computer scientists. He encouraged them to improve upon the informal approaches to computer performance analysis that were (and still are) in common use, applying more formal methods and using mathematical models to predict how the performance of a computer system would behave as workloads increased. He began his 1994 book, Computer Performance Analysis with Mathematica, with this observation:

The word performance in computer performance means the same thing that performance means in other contexts, that is, it means "How well is the computer doing the work it is supposed to do?" [4]

He concluded the book by quoting George Bernard Shaw: "The reasonable man adapts himself to the world; the unreasonable man persists in trying to adapt the world to himself. Therefore all progress depends on the unreasonable man". [5] Allen commented, "I hope the reader fits Shaw's definition of unreasonable, and wants to change things for the better".

Publications

Related Research Articles

Statistics Study of the collection, analysis, interpretation, and presentation of data

Statistics is the discipline that concerns the collection, organization, analysis, interpretation, and presentation of data. In applying statistics to a scientific, industrial, or social problem, it is conventional, to begin with a statistical population or a statistical model to be studied. Populations can be diverse groups of people or objects such as "all people living in a country" or "every atom composing a crystal". Statistics deals with every aspect of data, including the planning of data collection in terms of the design of surveys and experiments.

In queueing theory, a discipline within the mathematical theory of probability, Little's result, theorem, lemma, law, or formula is a theorem by John Little which states that the long-term average number L of customers in a stationary system is equal to the long-term average effective arrival rate λ multiplied by the average time W that a customer spends in the system. Expressed algebraically the law is

Computational science, also known as scientific computing or scientific computation (SC), is a field in mathematics that uses advanced computing capabilities to understand and solve complex problems. It is an area of science that spans many disciplines, but at its core, it involves the development of models and simulations to understand natural systems.

Jeffrey P. Buzen American computer scientist

Jeffrey Peter Buzen is an American computer scientist in system performance analysis best known for his contributions to queueing theory. His 1971 doctoral thesis Computational algorithms for closed queueing networks with exponential servers has guided the study of queueing network modeling.

Clifford Nass American academic

Clifford Ivar Nass was a professor of communication at Stanford University, co-creator of The Media Equation theory, and a renowned authority on human-computer interaction (HCI). He was also known for his work on individual differences associated with media multitasking. Nass was the Thomas M. Storke Professor at Stanford and held courtesy appointments in Computer Science, Education, Law, and Sociology. He was also affiliated with the programs in Symbolic Systems and Science, Technology, and Society.

Kanianthra Mani Chandy is the Simon Ramo Professor of Computer Science at the California Institute of Technology (Caltech). He has been the Executive Officer of the Computer Science Department twice, and he has been a professor at Caltech since 1989. He also served as Chair of the Division of Engineering and Applied Science at the California Institute of Technology.

Michel Talagrand French mathematician (born 1952)

Michel Pierre Talagrand is a French mathematician. Docteur ès sciences since 1977, he has been, since 1985, Directeur de Recherches at CNRS and a member of the Functional Analysis Team of the Institut de Mathématique of Paris. Talagrand was elected as correspondent of the Académie des sciences of Paris in March 1997, and then as a full member in November 2004, in the Mathematics section.

In mathematical optimization, ordinal optimization is the maximization of functions taking values in a partially ordered set ("poset"). Ordinal optimization has applications in the theory of queuing networks.

Neil J. Gunther American computer scientist

Neil Gunther is a computer information systems researcher best known internationally for developing the open-source performance modeling software Pretty Damn Quick and developing the Guerrilla approach to computer capacity planning and performance analysis. He has also been cited for his contributions to the theory of large transients in computer systems and packet networks, and his universal law of computational scalability.

Lajos Takács was a Hungarian mathematician, known for his contributions to probability theory and in particular, queueing theory. He wrote over two hundred scientific papers and six books.

Onno Johan Boxma is a Dutch mathematician, and Professor at the Eindhoven University of Technology, known for several contributions to queueing theory and applied probability theory.

In queueing theory, a discipline within the mathematical theory of probability, quasireversibility is a property of some queues. The concept was first identified by Richard R. Muntz and further developed by Frank Kelly. Quasireversibility differs from reversibility in that a stronger condition is imposed on arrival rates and a weaker condition is applied on probability fluxes. For example, an M/M/1 queue with state-dependent arrival rates and state-dependent service times is reversible, but not quasireversible.

Applied mathematics Application of mathematical methods to other fields

Applied mathematics is the application of mathematical methods by different fields such as physics, engineering, medicine, biology, finance, business, computer science, and industry. Thus, applied mathematics is a combination of mathematical science and specialized knowledge. The term "applied mathematics" also describes the professional specialty in which mathematicians work on practical problems by formulating and studying mathematical models.

In queueing theory, a discipline within the mathematical theory of probability, a fluid queue is a mathematical model used to describe the fluid level in a reservoir subject to randomly determined periods of filling and emptying. The term dam theory was used in earlier literature for these models. The model has been used to approximate discrete models, model the spread of wildfires, in ruin theory and to model high speed data networks. The model applies the leaky bucket algorithm to a stochastic source.

The following outline is provided as an overview of and topical guide to computing:

References

  1. ↑ The Mathematics Genealogy Project
  2. ↑ Computer Measurement Group A. A. Michelson Award Archived 2007-02-03 at the Wayback Machine
  3. ↑ Allen, Arnold O. (1990). Probability, Statistics, and Queueing Theory with Computer Science Applications, 2nd ed . Academic Press. ISBN   978-0-12-051051-1.
  4. ↑ Allen, Arnold O. (1994). "Introduction". Computer Performance Analysis with Mathematica. Academic Press. p. 1. ISBN   978-0-12-051070-2.
  5. ↑ Shaw, George Bernard (1903). "Maxims for Revolutionists". Man and Superman. Penguin Classics (2001). p. 251. ISBN   978-0-14-043788-1.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.