Robert A. Allen
- Allen, Robert A., "The Importance of Users' Perceptions of Response Time in Computer System Design," Proceedings ACM Southeast Regional Conference, Birmingham, AL, 1987.Google Scholar
- Allen, Robert A., Nowaczyk, R., and Goodwin, R., "Perceiving the Average Temporal Duration of Sequentially Presented Stimuli," presented at the Annual Meeting of the Southeastern Psychological Assoc., New Orleans, Louisiana, March, 1988.Google Scholar
- Allen, Robert B., "Cognitive Factors in Human Interaction with Computers," Behaviour and Information Technology, 1982, Vol 1, No. 3, 257-278.Google ScholarCross Ref
- Bailey, Robert W., Human Performance Engineering: A Guide for System Designers, Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1982. Google ScholarDigital Library
- Barber, Raymond E., Lucas, Henry C. Jr., "System Response Time Operator Productivity, and Job Satisfaction," Communications of the ACM, Vol. 26, No. 11, November 1983. Google ScholarDigital Library
- Best, J., B., Cognitive Psychology, West publishing Company, St. Paul, Minnesota, 1986.Google Scholar
- Geist, Robert, "Student-Down System Design," Proceedings of IEEE National Educational Computer Conference, June 1983.Google Scholar
- Geist, Robert, "Perception based configuration design of computer systems," Information Processing Letters, 18, 1984.Google Scholar
- Kuhlmann, Hans W., "A CPU Priority Scheduling Algorithm Incorporating User's Think Time," Proceedings ACM Southeast Regional Conference, Atlanta, GA, 1989.Google Scholar
- Maekawa, Mamour, Oldehoeft, Arthur E., Oldehoeft, Rodney R., Operating Systems Advanced Concepts, The Benjamin/Cummings Publishing Co. Lie., Menlo Park, CA, 1987. Google ScholarDigital Library
- Monk, Andrew, Editor, Fundamentals of Human-Computer Interaction, Academic Press, New York, New York, 1985. Google ScholarDigital Library
- Nowaczyk, Ronald H., Allen, Robert A., "User Perception of Computer Response Time During a Cognitive Task," Presented at The Annual meeting of the Southeastern Psychological Association, Washington, DC, 1989.Google Scholar
- Nowaczyk, R., and Beresh, C., "The role of variability in the perception of computer system response time," Presented at The Annual meeting of the Midwestern Psychological Association, Chicago, Illinois, 1986.Google Scholar
- Peterson, James L., Silberschatz, Abraham, Operating System Concepts, 2nd Edition, Addison-Wesley Publishing Co. Inc., Menlo Park, CA, 1985. Google ScholarDigital Library
- Rushinek, A., and Rushinek, S., "What makes users happy?," CACM, 29, 1986. Google ScholarDigital Library
- Shneiderman, Ben, Software Psychology: Human Factors in Computer and Information Systems, Winthrop Publishers, Inc., 1980. Google ScholarDigital Library
- Shneiderman, Ben, "Response Time and Display Rate in Human Performance with Computers," Computing Surveys, Vol. 16, No. 3, September 1984. Google ScholarDigital Library
- Card, Stuart K., Moran, Thomas P., Newell, Allen, The psychology of human-computer interaction, Hillsdale, NJ, L. Erlbaum Associates, 1983. Google ScholarDigital Library
Index Terms
- The first class of “think time oriented” CPU scheduling algorithms
Recommendations
A class of on-line scheduling algorithms to minimize total completion time
We consider the problem of scheduling jobs on-line on a single machine and on identical machines with the objective to minimize total completion time. We assume that the jobs arrive over time. We give a general 2-competitive algorithm for the single ...
Efficient algorithms for average completion time scheduling
IPCO'10: Proceedings of the 14th international conference on Integer Programming and Combinatorial OptimizationWe analyze the competitive ratio of algorithms for minimizing (weighted) average completion time on identical parallel machines and prove that the well-known shortest remaining processing time algorithm (SRPT) is 5/4-competitive w.r.t. the average ...
Approximation algorithms for scheduling real-time jobs with multiple feasible intervals
Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible intervals. A job fails if the job remains incomplete at the end of the last feasible ...
Comments