Results 301 to 310 of about 106,211 (332)
Some of the next articles are maybe not open access.
Online deadline scheduling with preemption penalties
Computers & Industrial Engineering, 2011This paper presents a study of the problem of online deadline scheduling under the preemption penalty model of Zheng, Xu, and Zhang (2007). In that model, each preemption incurs a penalty of @r times the weight of the preempted job, where @r>=0 is the preemption penalty parameter.
Feifeng Zheng +4 more
openaire +1 more source
Scheduling with Deadlines and Loss Functions
Management Science, 1959The problem of this paper is that of scheduling several one-stage tasks on several processors, which are capable of handling the tasks with varying degrees of efficiency, to minimize the total loss, which is a sum of losses associated with the individual tasks.
openaire +1 more source
Online deadline scheduling on faster machines
Information Processing Letters, 2003Online deadline scheduling is to determine which jobs are accepted or rejected, where jobs have the deadline by which they must finish their processing and they arrive in the online fashion. The slack of a job is the gap between its arrival time and the last time when it can first be scheduled to meet its deadline.
Jae-Hoon Kim 0001, Kyung-Yong Chwa
openaire +2 more sources
2004
The deadline-driven scheduler of Liu and Layland [85] is considered in this chapter. The main idea of the scheduler was given in Chap. 1. The correctness proof for the deadline-driven scheduler will be carried out carefully to illustrate that the proof theory of the previous two chapters can manage a nontrivial proof.
Zhou Chaochen, Michael R. Hansen
openaire +1 more source
The deadline-driven scheduler of Liu and Layland [85] is considered in this chapter. The main idea of the scheduler was given in Chap. 1. The correctness proof for the deadline-driven scheduler will be carried out carefully to illustrate that the proof theory of the previous two chapters can manage a nontrivial proof.
Zhou Chaochen, Michael R. Hansen
openaire +1 more source
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, 2003
We study the competitiveness of online deadline scheduling problems. It is assumed that jobs are non-preemptive and we want to maximize, in an online manner, the sum of the length of jobs completed before their deadlines. When there is a single machine, Goldwasser [4] showed that the optimal deterministic competitiveness of this problem is 2+1/k, where
openaire +1 more source
We study the competitiveness of online deadline scheduling problems. It is assumed that jobs are non-preemptive and we want to maximize, in an online manner, the sum of the length of jobs completed before their deadlines. When there is a single machine, Goldwasser [4] showed that the optimal deterministic competitiveness of this problem is 2+1/k, where
openaire +1 more source
Batching earliest deadline first scheduling
Proceedings. Fifth International Workshop on Object-Oriented Real-Time Dependable Systems, 2003Investigates the trade-off in the dynamic scheduling of real-time tasks, between the frequency at which the scheduling algorithm is invoked, the size of the task set to which the scheduling (prioritization) policy is applied at every invocation, and the quality of the resulting schedules in terms of deadline compliance.
Maryam Moghaddas, Babak Hamidzadeh
openaire +1 more source
Secondary Job Scheduling in the Cloud with Deadlines
2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum, 2011The highly dynamic nature of the cloud environment leads to a time-varying resource utilization and the cloud provider can potentially accommodate secondary jobs with the remaining resource. To better implement the idea of resource reutilization in the cloud environment, the problem of secondary job scheduling with deadlines under time-varying resource
Shiyao Chen +4 more
openaire +1 more source
Application-level scheduling with deadline constraints
IEEE INFOCOM 2014 - IEEE Conference on Computer Communications, 2014Opportunistic scheduling of delay-tolerant traffic has been shown to substantially improve spectrum efficiency. To encourage users to adopt delay-tolerant scheduling for capacityimprovement, it is critical to provide guarantees in terms of completion time.
Huasen Wu +3 more
openaire +1 more source
MapReduce delay scheduling with deadline constraint
Concurrency and Computation: Practice and Experience, 2013SUMMARYMapReduce programming paradigm has been widely applied to solve large‐scale data‐intensive problems. Intensive studies of MapReduce scheduling have been carried out to improve MapReduce system performance. Delay scheduling is a common way to achieve high data locality and system performance.
Hongliang Li 0003 +3 more
openaire +1 more source
Scheduling Hadoop Jobs to Meet Deadlines
2010 IEEE Second International Conference on Cloud Computing Technology and Science, 2010User constraints such as deadlines are important requirements that are not considered by existing cloud-based data processing environments such as Hadoop. In the current implementation, jobs are scheduled in FIFO order by default with options for other priority based schedulers.
Kamal Kc, Kemafor Anyanwu
openaire +1 more source