Results 21 to 30 of about 1,231,038 (365)
Scheduling with Outliers [PDF]
, 2009 In classical scheduling problems, we are given jobs and machines, and have to schedule all the jobs to minimize some objective function. What if each job has a specified profit, and we are no longer required to process all jobs? Instead, we can schedule any subset of jobs whose total profit is at least a (hard) target profit requirement, while still ...
Anupam Gupta +3 more
openaire +2 more sources
Design of Optimal Scheduler for Process Scheduling [PDF]
International Journal of Engineering and Advanced Technology, 2020 CPU Scheduling takes plays an important role in multiprogramming systems. There are several programs present in memory. It is the responsibility of operating systems to select the process and assign it to CPU. There are various algorithms available for CPU Scheduling.
P. Harshavardhan Reddy +7 more
openaire +2 more sources
Fast divide-and-conquer algorithms for preemptive scheduling problems with controllable processing times – A polymatroid optimization approach [PDF]
, 2008 We consider a variety of preemptive scheduling problems with controllable processing times on a single machine and on identical/uniform parallel machines, where the objective is to minimize the total compression cost.
A. Federgruen +20 more
core +1 more source
Mapping, Scheduling, and Schedulability Analysis
, 2022 This chapter presents how the P-SOCRATES framework addresses the issue of scheduling multiple real-time tasks (RT tasks), made of multiple and concurrent non-preemptable task parts. In its most generic form, the scheduling problem in the architectural framework is a dual problem: scheduling task-to-threads, and scheduling thread-to-core replication.
Burgio P. +4 more
openaire +2 more sources
Analyzing logic programs with dynamic scheduling [PDF]
, 1994 Traditional logic programming languages, such as Prolog, use a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, usually provide more flexible scheduling in which computation generally proceeds leftto- right but in ...
García de la Banda, M. +2 more
core +2 more sources
IEEE Access, 2022 The relentless technology scaling has provided a significant increase in processor performance, but on the other hand, it has led to adverse impacts on system reliability.
Sepideh Safari +8 more
doaj +1 more source
Journal of Combinatorial Theory, Series A, 2016 We introduce the notion of a scheduling problem which is a boolean function $S$ over atomic formulas of the form $x_i \leq x_j$. Considering the $x_i$ as jobs to be performed, an integer assignment satisfying $S$ schedules the jobs subject to the constraints of the atomic formulas. The scheduling counting function counts the number of solutions to $S$.
Caroline J. Klivans, Felix Breuer
openaire +2 more sources
IEEE Open Journal of the Communications Society, 2022 The ever advances in wireless communication and mobile networks have brought novel workflow-formed applications, such as virtual reality and live-streaming, to our daily life. Arousing a growing need for workflow execution efficiency.
Kaige Zhu +3 more
doaj +1 more source
A comparison of classical scheduling approaches in power-constrained block-test scheduling [PDF]
, 2000 Classical scheduling approaches are applied here to overcome the problem of unequal-length block-test scheduling under power dissipation constraints. List scheduling-like approaches are proposed first as greedy algorithms to tackle the fore mentioned ...
Muresan, Valentin +3 more
core +1 more source
From Instantaneous Schedulability to Worst Case Schedulability: A Significant Moment Approach [PDF]
arXiv, 2021 The method of significant moment analysis has been employed to derive instantaneous schedulability tests for real-time systems. However, the instantaneous schedulability can only be checked within a finite time window. On the other hand, worst-case schedulability guarantees schedulability of systems for infinite time.
arxiv