Task (computing)

About: Task (computing) is a research topic. Over the lifetime, 9718 publications have been published within this topic receiving 129364 citations.

Fast and High Quality Topology-Aware Task Mapping

Abstract: Considering the large number of processors and the size of the interconnection networks on exactable-capable supercomputers, mapping concurrently executable and communicating tasks of an application is complex problem that needs to be dealt with care. For parallel applications, the communication overhead can be a significant bottleneck on scalability. Topology-aware task-mapping methods that map the tasks tithe processors~(i.e., cores) by exploiting the underlying network information are very effective to avoid, or at worst bend, this limitation. We propose novel, efficient, and effective task mapping algorithms employing a graph model. The experiments show that the methods are faster than the existing approaches proposed for the same task, and on 4096 processors, the algorithms improve the communication hops and link contentions by 16% and 32%, respectively, on the average. In addition, they improve the average execution time of a parallel Spiv kernel and a communication-only application by 9% and 14%, respectively.

Action alignment for event planning, project management and process structuring

Abstract: An action alignment system for event planning and execution searches out web sites relating to event planning and, based on web site content, constructs a database of various tasks that might be desired for different events (tasks can also be manually added to the database). The tasks have associated tags which allow a task search engine to match a user query representing a proposed event to potential tasks. This list of potential tasks is presented to the user who may then select the tasks as desired to customize the event plan. Vendors can provide pre-packaged deals for the tasks, and this information can be included with the task database, selected by the user, and added to the event plan. A scheduler and alert engine then inserts appropriate entries into the user's calendar, and sends timely alerts to the user which include links that simplify event management.

Method and means for the detection of deadlock among waiting tasks in a multiprocessing, multiprogramming CPU environment

Abstract: The wait relations among N tasks in a multiprocessing, multiprogramming CPU environment are conformed to a vector of N+1 fields recording which tasks in a system are active and upon what other task any given task directly waits. The vector may be stored in a global register. Positions 1 through N are assigned to the N tasks such that a value p in position r means that task r is waiting directly on task p. One value j of the possible values 0,1,2, . . . , N+1 is designated to indicate an active task. Position j always shows the value j. Without loss of generality and to facilitate the discussion j is assumed to be 0. Thus, the value 0 in register position r means that task r is not waiting and position 0 always has the value 0. The presence of any deadlocks (closures) among the wait relations can always be detected by the computing system by making repeated translations of the vector fields within and upon themselves in no more than log 2 (N+1) iterations. In this regard, log 2 (N+1) denotes the smallest integer equal to or greater than the base 2 logarithm. The translation of fields within and upon themselves means that for each global register position r containing pointer p, then the contents g of register position p are substituted as the new contents of position r for the iteration 0≦r, p, g≦N.

Interactive computerized performance support system and method

Abstract: An interactive computerized support system provides performance support using a remote user device connected via a network to a database having multiple objects stored as knowledge clusters. User tasks are organized according to a process model having one or more sub-tasks. The knowledge required to perform each of the tasks is organized according to a reference information model that includes the data and information that correlates with a particular task in the process model. Knowledge clusters are generated to represent fundamental building blocks of knowledge accessible through the reference information model. Server side hardware interfaces to the network and receives user device requests (810) for data and retrieves the process model data (820), reference information model data (870), and knowledge clusters (850) and links the information together and transmits the information to the user device for display (830, 860, 880, 890).

A Cross-Task Analysis of Text Span Representations

Abstract: Many natural language processing (NLP) tasks involve reasoning with textual spans, including question answering, entity recognition, and coreference resolution While extensive research has focused on functional architectures for representing words and sentences, there is less work on representing arbitrary spans of text within sentences In this paper, we conduct a comprehensive empirical evaluation of six span representation methods using eight pretrained language representation models across six tasks, including two tasks that we introduce We find that, although some simple span representations are fairly reliable across tasks, in general the optimal span representation varies by task, and can also vary within different facets of individual tasks We also find that the choice of span representation has a bigger impact with a fixed pretrained encoder than with a fine-tuned encoder