Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “task scheduling”

Task Scheduling

Peter Späth, Iuliana Cosmina, Rob Harrop et al. · Apress eBooks · 2023

Task scheduling is a common feature in enterprise applications. Task scheduling is composed mainly of three parts:

Cited by 0

Task Scheduling

Iuliana Cosmina, Rob Harrop, Chris Schaefer et al. · Apress eBooks · 2017

Task scheduling is a common feature in enterprise applications. Task scheduling is composed mainly of three parts: the task (which is the piece of business logic needed to run at a specific time or on a regular basis), the trigger (which specifies the condition under which the task should be executed), and the scheduler (which executes the task based on the information from the trigger). Specifically, this chapter covers the following topics

Cited by 0

Task Scheduling

Sakshi Patni, Deepika Saxena, Ashutosh K. Singh · 2025

Cited by 0

Task Scheduling

Robert La Lau · Apress eBooks · 2021

To keep the work interesting and to save time, it is important to automate repetitive and recurring tasks as much as possible. The most important and most commonly used application to do this on Unix systems is cron.

Cited by 0

Task Scheduling

See Profile, Xiuyi Zhou, Jun Yang et al. · 2016

All in-text\treferences\tunderlined\tin\tblue\tare\tlinked\tto\tpublications\ton\tResearchGate, letting you\taccess\tand\tread\tthem\timmediately.

Cited by 0

Task Scheduling

Oliver Sinnen · 2006

This chapter contains sections titled: Fundamentals With Communication Costs Without Communication Costs Task Graph Properties Concluding Remarks Exercises

Cited by 4

Task Scheduling

Richard Blewett, Andrew Clymer · Apress eBooks · 2013

You saw in Chapter 6 how, when creating a continuation, you can pass a scheduler on which to execute the task. The example in the chapter used the out-of-the-box SynchronizationContextTaskScheduler to push task execution on to the UI thread. It turns out, however, that there is nothing special about the SynchronizationContextTaskScheduler; the task scheduler is a pluggable component. .NET 4.5 introduced another specialized scheduler, but beyond that you can write task schedulers yourself. This chapter looks at the new scheduler introduced in .NET 4.5 and how to write a custom task scheduler. Writing custom task schedulers can be fairly straightforward, but there are some of the issues that you need to be aware of.

Cited by 0

Task Scheduling Model

G. Umarani Srikanth, V. Maheswari, A. P. Shanthi et al. · Indian Journal of Science and Technology · 2015

To design and implement a task scheduling modelwhich predicts a schedule for a newtask setwithout actually running a task scheduling algorithm. Generating an optimal schedule of tasks for an application is critical for obtaining high performance in a heterogeneous computing environment and it is a hard problem. This work attempts to optimize on the scheduling time by designing a task scheduling model. The task scheduling algorithm used in this work is based on ACO, a swarm intelligence model. The prediction is done after the training phase of the model. The model is validated by comparing the predicted schedule with the actual schedule obtained by running the ACO scheduling algorithm on the new task set. The parameters used for comparison are waiting time of tasks, average processor utilization and the scheduling time. The predicted schedule is comparable to the actual schedule with respect to waiting time of tasks and average processor utilization. The scheduling time is significantly reduced and the reduction in the scheduling time increases with the increase in the task set size.Keywords: ACO (Ant Colony Optimization), Ant Systems, Clustering, Heterogeneous Multiprocessors, Optimization Techniques, Task Scheduling

Cited by 5Open access

Advanced Task Scheduling

Oliver Sinnen · 2006

This chapter contains sections titled: Insertion Technique Node Duplication Heterogeneous Processors Complexity Results Genetic Algorithms Concluding Remarks Exercises

Cited by 0

Multiprocessor Task Scheduling

Mumin Kurtulus · 1999

Scheduling problems are concerned with how to optimally allocate the limited resources to tasks over time. Since classical models become inadequate in most of the practical areas, such as semiconductor circuit design team workforce planning where a team of people are working on semiconductor circuit design (each task can be assigned to a set of people working simultaneously on that particular task), recent scheduling research concentrate on extending available models into more general ones. Most of the research done in scheduling field assume that a job can be processed by only one machine at a given time, whereas the models constructed assuming this 1-job-on1 -machine assumption may become inadequate in practice. That is, one job can be processed simultaneously by several machines. Such problems are called 1-job-on-multiple machine pattern (multiprocessor task scheduling) problems. The following paper briefly describes the the problem of 1-job-on-r-machine and some of it...

Cited by 0

USNavalResearchLaboratory/task-scheduling: v0.1.4

Paul Rademacher, kevinwagner0505 · Zenodo (CERN European Organization for Nuclear Research) · 2022

Stable release for submission of "Markov Decision Process Design for Imitation of Optimal Task Schedulers" to IEEE Signal Processing Letters

Cited by 0Open access