Showing papers on "Task (computing) published in 1979"

Measurement of Workload by Secondary Tasks

Abstract: The post-1965 literature on the use of secondary tasks in the assessment of operator workload was surveyed. Twelve classes of tasks were identified; the most frequently used were choice reaction time, memory, monitoring, and tracking. The literature review did not suggest a single best task or class of tasks for the measurement of workload. Limitations in using secondary tasks are discussed, and directions for future research are presented.

A display oriented programmer's assistant

Abstract: This paper continues and extends previous work by the author in developing systems which provide the user with various forms of explicit and implicit assistance, and in general co-operate with the user in the development of his programs. The system described in this paper makes extensive use of a bit map display and pointing device (a mouse) to significantly enrich the user's interactions with the system, and to provide capabilities not possible with terminals that essentially emulate hard copy devices. For example, any text that is displayed on the screen can be pointed at and treated as input, exactly as though it were typed, i.e. the user can say use this expression or that value, and then simply point. The user views his programming environment through a collection of display windows, each of which corresponds to a different task or context. The user can manipulate the windows, or the contents of a particular window, by a combination of keyboard inputs or pointing operations. The technique of using different windows for different tasks makes it easy for the user to manage several simultaneous tasks and contexts, e.g. defining programs, testing programs, editing, asking the system for assistance, sending and receiving messages, etc. and to switch back and forth between these tasks at his convenience.

Digital energy monitor

Abstract: A digital apparatus for generating an energy log for instant recall and display comprising a microcomputer including microprocessor with interrupt capability, programmable timer, keyboard and digital output. The apparatus is permanently programmed in read-only memory with a task to continuously update data and time information stored in read/write memory, a task to process each interrupt corresponding to pulsed signals indicative of energy usage and to add a unit to one memory location corresponding to that type of energy usage on a given date and a task to select and display time and date and to select and display functions of the contents of the memory locations corresponding to energy usage. The tasks are entirely interrupt activated.

The interrelationships among some associative learning tasks

Abstract: The purpose of this study was to determine if associative learning tasks involve two or more relatively independent factors (as suggested by an earlier study). To that end, 12 tasks were constructed; 3 were “standard” (paired associate, free recall, serial), and the others represented transition tasks between the standard tasks. The purpose was to see if factors (as determined by a factor analysis) changed in a meaningful way as the transition was made from one task to another. Some response units were single words, some were word triads; some of the word triads were meaningless, some formed sentences. Paired associate lists also differed in terms of the number of response terms to be associated with a single stimulus term. The 12 tasks were learned by 97 subjects. Two relatively stable highly correlated factors emerged, one involving free recall and serial tasks, the other involving paired associate tasks. This does not confirm the earlier work; the reason for this discrepancy is not known. Again, however, the data emphasized the importance of individual differences in associative learning in contrast to the relatively minor role of the Subject by Task interaction.

An internetwork message structure

Abstract: The focus of this paper is the provision of computer-aided message services between users of computers in a multinetwork environment. An assembly of interconnected networks is called an internetwork. The task at hand is to provide an internetwork computer message service.It can be expected that a large number of message services will arise with some general aspects of equivalent functionality and some will have a few unusual, possibly unique, features. Certainly there will be many distinct user interface models for the human interaction with message systems.For these reasons the internetwork message system suggested here is based on the assumption of a standard for the internal machine-oriented representation of a message and the assumption that a variety of user interface programs will be available.The proposed system provides for the transmission of messages composed of a rigidly defined and structured set of command information fields and an arbitrarily defined and structured message content. Within the content may be transmitted text, facsimile, graphics, or voice data.This paper is based on a more detailed proposal for an internetwork message system [1].

Operation and control system of data processing system

Abstract: PURPOSE:To keep the operating condition to a value close to the objective value, by providing the analysis function for processing utilized condition analyzing the operating condition of the processors, and by controlling the execution of jobs externally depending on the result of analysis, in the system having the data processors in multiplex processing for a number of programs CONSTITUTION:The data processor 1 is provided with the waiting table 6 for job start and the table 7 for job execution waiting, and the master scheduler 5 referencing the content of the both tables 6 and 7 and managing the job start processing and waiting execution Further, the unit 1 is provided with the hardware monitor 2 periodically sampling the operating condition of the unit 1 and the utilized condition analysis function 3 of the unit 1 analyzing the operating condition of the unit 1 based on the sampled result by the monitor 2 Depending on the analysis of the function 3 resulted, to the scheduler 5 of the unit 1, the hold request and release are made with the predetermined task and the start request of job

Multiplex processor system

Abstract: PURPOSE:To increase the ratio of cost to performance, by executing the task represented for the priority having the highest priority by the processor designated with the processor designated information. CONSTITUTION:The system consists of the main memory 1, first and second processor 2, 3, and input and output channel unit 4 connected to I/O 5, and the process control block information used for the control of processor usage right is stored in the unit 1. Further, the porcessor 2 consists of the sequential control section 31, interruption control section 32, semaphore control section 33, control section 34 selecting the task to be executed, memory access circuit 35, operation circuit 36 and register 37, and control sections 31 and 32 requests the start of the control operation with the control section 34 while relating to the contrl sections 33, and if there is no task under execution with the processor 2, the task having the highest priority among the task group possible for execution is found and the task corresponding is out of linkage from the queue by rolling in it.

Reflections on the Concept of Operator Workload

Abstract: In the context of our research at Riso on the data processing functions of human operators in automated, modern process plants, the concept of operator work load seems to be a rather qualitative, ambiguous characteristic of a work situation rather than a measure of the amount of work implied in a task.

Synchronization under a commercial operating system

Abstract: Mutual exclusion and general synchronization of concurrent processes (‘tasks’) are well-known principles for constructing reliable real-time systems. This paper shows how to implement these principles under a typical commercial operating system which provides incomplete synchronization operations. The problem of synchronizing erroneous tasks is discussed briefly.