scispace - formally typeset
Search or ask a question
Topic

Task (computing)

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


Papers
More filters
Journal ArticleDOI
01 Dec 2007
TL;DR: Tasks such as question answering, summarization, novelty detection, and information provenance make use of a sentence-retrieval module as a preprocessing step, and may benefit from sentence retrieval to build a training corpus, or as a post-processing step.
Abstract: Sentence Retrieval is the task of retrieving a relevant sentence in response to a query, a question, or a reference sentence. Tasks such as question answering, summarization, novelty detection, and information provenance make use of a sentence-retrieval module as a preprocessing step. The performance of these systems is dependent on the quality of the sentence-retrieval module. Other tasks such as information extraction and machine translation operate on sentences, either using them as training data, or as the unit of input or output (or both), and may benefit from sentence retrieval to build a training corpus, or as a post-processing step.

70 citations

Patent
Christopher D. Metcalf1
20 Sep 2010
TL;DR: In this paper, the operating system determines whether one or more potential errors in execution of other processes other than the first process executing on the first core would be caused by disabling the predetermined task of an operating system.
Abstract: Managing processes in a computing system comprising one or more cores includes receiving a request for a first process on a first core to execute with at least one predetermined task of an operating system disabled on the first core. In response to the request, the operating system determines whether one or more potential errors in execution of one or more processes other than the first process executing on the first core would be caused by disabling the predetermined task on the first core. The operating system grants the request or rejects the request in response to determining whether one or more potential errors in execution of one or more processes other than the first process executing on the first core would be caused by disabling the predetermined task on the first core.

69 citations

Journal Article
TL;DR: In this paper, the authors present a runtime environment that partially reconfigures and executes hardware tasks on Xilinx Virtex FPGA's reconfigurable surface is split into a varying number of variable-sized vertical task slots that can accommodate the hardware tasks.
Abstract: We present a runtime environment that partially reconfigures and executes hardware tasks on Xilinx Virtex To that end, the FPGA's reconfigurable surface is split into a varying number of variable-sized vertical task slots that can accommodate the hardware tasks A bus-based communication infrastructure allows for task communication and I/O We discuss the design of the runtime system and its prototype implementation on an reconfigurable board architecture that was specifically tailored to reconfigurable hardware operating system research

69 citations

01 Jan 1996
TL;DR: A new allocation strategy is introduced, the Bold strategy, which outperforms other strategies suggested in the literature in a number of simulations and is shown to achieve a small expected overall finishing time.
Abstract: We study a scheduling or allocation problem with the following characteristics: The goal is to execute a number of unspecified tasks on a parallel machine in any order and as quickly as possible. The tasks are maintained by a central monitor that will hand out batches of a variable number of tasks to requesting processors. A processor works on the batch assigned to it until it has completed all tasks in the batch, at which point it returns to the monitor for another batch. The time needed to execute a task is assumed to be a random variable with known mean and variance, and the execution times of distinct tasks are assumed to be independent. Moreover, each time a processor obtains a new batch from the monitor, it suffers a fixed delay. The challenge is to allocate batches to processors in such a way as to achieve a small expected overall finishing time. We introduce a new allocation strategy, the Bold strategy, and show that it outperforms other strategies suggested in the literature in a number of simulations.

69 citations

Patent
20 Jun 2005
TL;DR: In this article, a system for coordination for quality of service in multi-layer storage virtualization environments includes a first, second and third storage entity at a respective first and second layer of virtualized storage.
Abstract: A system for coordination for quality of service in multi-layer storage virtualization environments includes a first, second and third storage entity at a respective first, second and third layer of virtualized storage. The first storage entity sends a request for an I/O task to the second storage entity. In response to the request, the second storage entity may be configured to cooperate with the third storage entity to perform one or more I/O operations to satisfy one or more quality of service requirements associated with the I/O task.

69 citations


Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202210
2021695
2020712
2019784
2018721
2017565