Results 201 to 210 of about 44,881 (264)
A Multi-Strategy Siberian Tiger Optimization Algorithm for Task Scheduling in Remote Sensing Data Batch Processing. [PDF]
Biomimetics (Basel)Liu Z +6 more
europepmc +1 more source
Deep reinforcement learning task scheduling method based on server real-time performance. [PDF]
PeerJ Comput SciWang J, Li S, Zhang X, Wu F, Xie C.
europepmc +1 more source
Multi-objective and multi constrained task scheduling framework for computational grids. [PDF]
Sci RepHegde SN +5 more
europepmc +1 more source
Advancements in heuristic task scheduling for IoT applications in fog-cloud computing: challenges and prospects. [PDF]
PeerJ Comput SciAlsadie D.
europepmc +1 more source
Integral-Valued Pythagorean Fuzzy-Set-Based Dyna Q+ Framework for Task Scheduling in Cloud Computing. [PDF]
Sensors (Basel)Krishnamurthy B, Shiva SG.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
INFORMS Journal on Computing, 1996
We consider the problem of nonpreemptively scheduling periodic tasks on a minimum number of processors, assuming that the tasks have to be executed strictly periodically. We show that the problem is NP-complete in the strong sense, even in the case of a single processor, but that it is solvable in polynomial time if the periods and execution times are
Korst, J.H.M. +2 more
openaire +3 more sources
We consider the problem of nonpreemptively scheduling periodic tasks on a minimum number of processors, assuming that the tasks have to be executed strictly periodically. We show that the problem is NP-complete in the strong sense, even in the case of a single processor, but that it is solvable in polynomial time if the periods and execution times are
Korst, J.H.M. +2 more
openaire +3 more sources
SIAM Journal on Discrete Mathematics, 1997
Summary: Scheduling a set of tasks on a set of machines so as to yield an efficient schedule is a basic problem in computer science and operations research. Most of the research on this problem incorporates the potentially unrealistic assumption that communication between the different machines is instantaneous.
Cynthia A. Phillips +2 more
openaire +3 more sources
Summary: Scheduling a set of tasks on a set of machines so as to yield an efficient schedule is a basic problem in computer science and operations research. Most of the research on this problem incorporates the potentially unrealistic assumption that communication between the different machines is instantaneous.
Cynthia A. Phillips +2 more
openaire +3 more sources
Journal of Computer Science and Technology, 1997
This paper describes a PVM task scheduler designed and implemented by the authors. The scheduler supports selecting idle workstations, scheduling pool tasks and dynamically produced subtasks. It can improve resource utilization, reduce job response time and simplify programming.
Jiubin Ju, Yong Wang, Yu Yin
openaire +2 more sources
This paper describes a PVM task scheduler designed and implemented by the authors. The scheduler supports selecting idle workstations, scheduling pool tasks and dynamically produced subtasks. It can improve resource utilization, reduce job response time and simplify programming.
Jiubin Ju, Yong Wang, Yu Yin
openaire +2 more sources
ACM SIGOPS Operating Systems Review, 1996
This paper describes a PVM task scheduler designed and implemented by the authors. The scheduler supports selecting idle workstations, scheduling pool tasks and dynamically produced subtasks. It can improve resource utilization, reduce job response time and simplize programming.
Jiubin Ju, Yong Wang
openaire +1 more source
This paper describes a PVM task scheduler designed and implemented by the authors. The scheduler supports selecting idle workstations, scheduling pool tasks and dynamically produced subtasks. It can improve resource utilization, reduce job response time and simplize programming.
Jiubin Ju, Yong Wang
openaire +1 more source