A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We consider a version of multiprocessor scheduling with the special feature that jobs may be rejected at a certain penalty. ... The objective is to minimize the makespan of the schedule for accepted jobs plus the sum of the penalties of rejected jobs. ... We thank Giorgio Gallo for having drawn our attention to this scheduling problem. We thank the anonymous referees for numerous helpful comments. ...doi:10.1137/s0895480196300522 fatcat:olpoaiah4vb7fbopqleifmwzoa
The problem of online multiprocessor scheduling with rejection was introduced by Bartal et al. (SIAM J. Discrete Math. 13 (1) (2000) 64 -78). ... A modiÿed model of multiprocessor scheduling with rejection is presented where preemption is allowed. For this model, it is shown that better performance is possible. ... The goal is to ÿnd an algorithm with minimal competitive ratio. We call this problem Multiprocessor Scheduling with Rejection or MSR for short  . ...doi:10.1016/s0304-3975(00)00288-7 fatcat:rfggluibr5ervig24obecd6eoi
In multiprocessor scheduling with rejection the jobs are characterized by a processing time and a penalty and it is possible to reject the jobs. ... The goal is to minimize the makespan of the schedule for the accepted jobs plus the sum of the penalties of the rejected jobs. In this paper we present a new online algorithm for the problem. ... Considering the problem of multiprocessor scheduling with rejection, it is a straightforward idea to reject the jobs where the penalty is smaller than the load. ...doi:10.14232/actacyb.19.1.2009.8 fatcat:dgu7grrr55gvzb2hl5vegkziv4
Proceedings of the 2015 International Conference on Education, Management, Information and Medicine
Objective To propose an approximate for the scheduling with rejection on uniform machines. Methods Design an on-line algorithm. Results We prove the competitive ratio of the algorithm. ... For set , SJ () RS is the total rejected cost in S, namely () solution produced by the on-line algorithm SRUM (scheduling with rejection on uniform multiprocessors), A refers to the set of accepted jobs ... In this paper, we consider an on-line scheduling problem with rejection .The job can be processed, or be rejected, but to pay a certain penalties. ...doi:10.2991/emim-15.2015.29 fatcat:dnm7paiggvhpfn4wg4wgu2v5v4
<p>This paper deals with multiprocessor scheduling with rejection technique where each job is provided with processing time and a given penalty cost. ... Our objective is to minimize the makespan of the scheduled job and to minimize the sum of the penalties of rejected jobs. ... In  the authors introduced a new version of multiprocessor scheduling with the special feature where the proposed jobs might be rejected at a certain penalty. ...doi:10.11591/ijece.v5i3.pp477-482 fatcat:ht3az2gnyre6vkiu6xyvwhoujq
2007 Design, Automation & Test in Europe Conference & Exhibition
The evaluation results reveal that our proposed algorithms could derive effective solutions of the energy-efficient scheduling problem with task rejection considerations. ... This research explores real-time systems composed of homogeneous multiple processors with the capability of dynamic voltage scaling (DVS), in which a given task can be rejected with a specified value of ... Hardness analysis Since most previous studies on multiprocessor energy-efficient scheduling did not take task rejection penalty into considerations, the schedulability of the derived schedules cannot be ...doi:10.1109/date.2007.364535 fatcat:tcw6jajh2fezpnryo6rgawb4x4
In this paper we have proposed an integrated approach with a new algorithm, called SASA (Sorting And Sequential Assignment) which maps the real time task assignment with task schedule and fault tolerance ... EDF) etc.All the current approaches deal with either fault tolerance or criticality in real time. ... Section 2 describes the task splitting on multiprocessors with an algorithm SASA.Section 3 discusses the task execution on each multiprocessor along with an algorithm. ...arXiv:1001.3727v1 fatcat:t3py6kfuyrgctmy6d4flbejybi
It provides the summary of schedulability analysis and well-known attributes. ... Finally, the analysis and evaluation of the mentioned methods are shown based on the schedulability of task sets and efficiency. ... GFTS method improves the task rejection ratio and average fitness value of schedule in comparison with traditional schemes TFTS and other GAs algorithms. ...doi:10.5120/ijca2015907656 fatcat:na7u3dgqsjhphl253ecd22jkau
IEEE Transactions on Computers
RMGT isa multiprocessor scheduling technique developed by Burchard et al. in . ... Furthermore, specifically for multiprocessor techniques developed 2. Indeed, we tested RMGT with first-fit and next-fit partitioning and observed that first-fit always has better performance ...
The aim of this paper is to analyse a method making use of two task copies when on-line scheduling tasks on multiprocessor systems. ... It is shown that the exhaustive search is not necessary for efficient fault-tolerant scheduling and that the latter search significantly reduces the computation complexity, which is interesting for embedded ... It was observed that for a multiprocessor system the both techniques achieve similar rejection rate. ...doi:10.1109/dasip.2018.8597044 dblp:conf/dasip/DobiasCS18 fatcat:pt3aoah55zcrfd5upvurrnxkey
However, there has been no study on optimal fault-tolerant scheduling of realtime multiprocessor systems which process aperiodic and non-preemptive tasks with deadlines. ... In this article, we present a formal method of designing an optimal fault-tolerant scheduler for realtime multiprocessor systems with non-preemptive and aperiodic tasks based on supervisory control theory ...doi:10.1080/00207170802047425 fatcat:mcjjdeezlbdaldkkrdo7ajvlsm
To achieve our objective a variable processing power is assigned to the task under consideration over its deadline to satisfy its timing requirements instead of rejecting it if a constant processing power ... Scheduling real time applications on multiprocessor and distributed platforms is achieved using a two-level hierarchical scheduler: 1) A high level scheduler (partitioning algorithm) which is concerned ... The first category deals with non real time applications and the second deals with real time applications. ...doi:10.5120/8473-2401 fatcat:mx6xznzkirftdcfbx23ebuqfry
Multiprocessor task scheduling is a well known NP-hard problem and numerous methods have been proposed to optimally solve it. ... Simulated Annealing (SA) has been considered a very good tool for complex nonlinear optimization problem, such as multiprocessor task scheduling. ... INRTRODUCTION Multiprocessor task scheduling has been well known as one of the hardest combinatorial optimization problems  . ...doi:10.1109/iitsi.2010.137 dblp:conf/iitsi/HoushmandSSAD10 fatcat:lnq4gjpvtbfutd5qy4i36kcq74
Task scheduling for multiprocessors is a job-sequencing problem generally classified as NP-complete or NP-hard. ... Task allocation is a restricted case of task scheduling where the tasks have no precedence relations with others and the priority order of execution is ignored. ... The computing model is assumed to be a simple multiprocessor system with the number of nodes selectable from 2 to 10. ...doi:10.11113/jt.v25.1009 fatcat:ffguolcmrjezjeoga4nseo2dse
scheduling with rejection. ... Summary: “We consider a version of multiprocessor scheduling with the special feature that jobs may be rejected at a certain penalty. ...
« Previous Showing results 1 — 15 out of 2,084 results