Filters








1,371 Hits in 4.9 sec

Preemptive Scheduling of Parallel Jobs on Multiprocessors

Xiaotie Deng, Nian Gu, Tim Brecht, Kaicheng Lu
2000 SIAM journal on computing (Print)  
We study the problem of processor scheduling for n parallel jobs applying the method of competitive analysis.  ...  We prove that for jobs with a single phase of parallelism, a preemptive scheduling algorithm without information about job execution time can achieve a mean completion time within 2 − 2 n+1 times the optimum  ...  A similar argument can be applied to parallel job scheduling on multiprocessors. Theorem 5.2.  ... 
doi:10.1137/s0097539797315598 fatcat:b6ssuxwfanawnhjg7n5e74xwx4

Energy-efficient scheduling and routing via randomized rounding

Evripidis Bampis, Alexander Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko
2016 Journal of Scheduling  
We first consider the energy minimization problem of scheduling a set of jobs on a set of parallel speed-scalable processors in a fully heterogeneous setting.  ...  Furthermore, we show that our approach allows to obtain a constant-factor approximation algorithm for the power-aware preemptive job shop scheduling problem.  ...  In the migratory case each job may be executed by more than one processors, without allowing parallel execution of a job. We also focus on the non-preemptive single processor case.  ... 
doi:10.1007/s10951-016-0500-2 fatcat:b2bqtbc6drchbj7z5ce3ie6xaq

Scheduling on a Constant Number of Machines [chapter]

F. Afrati, E. Bampis, C. Kenyon, I. Milis
1999 Lecture Notes in Computer Science  
We consider the problem of scheduling independent jobs on a constant number of machines.  ...  We illustrate two important approaches for obtaining polynomial time approximation schemes for two different variants of the problem, more precisely the multiprocessor-job and the unrelated-machines models  ...  transformation of a preemptive schedule to a non-preemptive one.  ... 
doi:10.1007/978-3-540-48413-4_28 fatcat:7n2fbdszwvamvbrw3b3yoxljfa

Speed-scaling with no Preemptions [article]

Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli
2014 arXiv   pre-print
We revisit the non-preemptive speed-scaling problem, in which a set of jobs have to be executed on a single or a set of parallel speed-scalable processor(s) between their release dates and deadlines so  ...  For the multiprocessor case, we present an approximation algorithm of ratio B̃_α((1+ϵ)(1+w_/w_))^α improving the best known result by a factor of (5/2)^α-1(w_/w_)^α.  ...  A challenging question left open in this work is the existence of a constant approximation ratio algorithm for the multiprocessor case.  ... 
arXiv:1407.7654v1 fatcat:7xpmyzbnajhuhcesftg62egp54

Speed-Scaling with No Preemptions [chapter]

Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli
2014 Lecture Notes in Computer Science  
We revisit the non-preemptive speed-scaling problem, in which a set of jobs have to be executed on a single or a set of parallel speed-scalable processor(s) between their release dates and deadlines so  ...  For the multiprocessor case, we present an approximation algorithm of ratioB α ((1 + ǫ)(1 + wmax wmin )) α improving the best known result by a factor of ( 5 2 ) α−1 ( wmax wmin ) α .  ...  A challenging question left open in this work is the existence of a constant approximation ratio algorithm for the multiprocessor case.  ... 
doi:10.1007/978-3-319-13075-0_21 fatcat:nxhrvpa3xvgq5lmbjsc2u3iy3i

On the Soft Real-Time Optimality of Global EDF on Multiprocessors: From Identical to Uniform Heterogeneous

Kecheng Yang, James H. Anderson
2015 2015 IEEE 21st International Conference on Embedded and Real-Time Computing Systems and Applications  
In the non-preemptive case, it is shown that no work-conserving scheduler, including GEDF, can be SRT-optimal on uniform multiprocessors, even if the number of processors is limited to two. *  ...  on identical multiprocessors.  ...  On uniform multiprocessors, we prove that the preemptive GEDF scheduler is SRT-optimal on platforms of only two processors.  ... 
doi:10.1109/rtcsa.2015.14 dblp:conf/rtcsa/YangA15 fatcat:o43etob5jbaxzdxuc35dlqnyyi

OM Algorithm for Multi-level Queue Scheduling

Manupriya Hasija, Akhil Kaushik, Parveen Kumar
2013 2013 International Conference on Machine Intelligence and Research Advancement  
There are a lot of well-known scheduling algorithms for job allocation on uniprocessor system but they may not fit well under the system having multiple processors.  ...  Today is the time of multitasking as well as multiprocessing. The scheduling of processes or tasks have taken a whirlwind after the concept of multiprocessing.  ...  Multiprocessor Scheduling Multiprocessor scheduling is an innovative approach to allocate several jobs to numerous processors at same time.  ... 
doi:10.1109/icmira.2013.118 fatcat:ltvkbi4dxjeq7ojzw3almwhgvq

Minimizing Total Completion Time in Multiprocessor Job Systems with Energy Constraint [chapter]

Alexander Kononov, Yulia Kovalenko
2021 Lecture Notes in Computer Science  
Each multiprocessor job requires more than one processor at the same moment of time. Processors may operate at variable speeds.  ...  We consider the problem of scheduling multiprocessor jobs to minimize the total completion time under the given energy budget.  ...  Introduction We investigate the problem of non-preemptive scheduling a set of jobs J = {1, . . . , n} on m speed scalable parallel processors.  ... 
doi:10.1007/978-3-030-77876-7_18 fatcat:ug5mk52advee3jvy65s6giem4e

Feasibility Intervals for Fixed-Priority Real-Time Scheduling on Uniform Multiprocessors

Liliana Cucu, Joel Goossens
2006 2006 IEEE Conference on Emerging Technologies and Factory Automation  
In this paper we study the global scheduling of periodic task systems upon uniform multiprocessor platforms.  ...  We first show two very general properties which are wellknown for uniprocessor platforms and which remain for multiprocessor one: (i) under few and not so restrictive assumptions, we show that any feasible  ...  The problem of scheduling periodic task systems on identical parallel processors was originally proposed in [2] .  ... 
doi:10.1109/etfa.2006.355388 dblp:conf/etfa/CucuG06 fatcat:rvdhzntr35hafjl4erjdggjtuq

Assessment of Possible Survey in Parallel Scheduling Using Non-Convex DEA

Hamed Hosseini
2013 Research Journal of Applied Sciences Engineering and Technology  
This study will illustrate how DEA works on parallel scheduling problem and select the most efficient solution within which the objective is to minimize completion time and to minimize the number of tardy  ...  jobs.  ...  Scheduling on multiprocessors in parallel is the problem of mapping jobs on processors with satisfying criteria like mean weighted flow time, completion time, mean weighted tardy jobs and so on.  ... 
doi:10.19026/rjaset.5.4523 fatcat:7wxyrf5inzeotncp3hfijkefe4

Page 639 of The Journal of the Operational Research Society Vol. 47, Issue 5 [page]

1996 The Journal of the Operational Research Society  
Lar (1988) Preemptive scheduling of independent jobs on a hypercube. Informat. Process. Lett. 28, 201-206. . Y. Zou and M. Anusa (1990) Preemptive job scheduling on a hypercube.  ...  In Proceeding of the 1990 International Conference On Parallel Processing pp 1-301-I-304. . P. E. Krugcer, T. Lat AND V. RaptyA (1990) Processor allocation vs. job scheduling on hypercube computers.  ... 

Exact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms

Liliana Cucu-Grosjean, Joël Goossens
2011 Journal of systems architecture  
In this paper, we study the global scheduling of periodic task systems on unrelated multiprocessor platforms.  ...  Finally, we provide an exact schedulability test as well for the job-level fixed-priority Earliest Deadline First (EDF) scheduler, for which such an upper bound is unknown.  ...  In contrast, for multiprocessor parallel machines, the problem of meeting timing constraints is a relatively new research area.  ... 
doi:10.1016/j.sysarc.2011.02.007 fatcat:6ut7ybzvefaibltumkpgrbvyau

Feasibility Intervals for Multiprocessor Fixed-Priority Scheduling of Arbitrary Deadline Periodic Systems

Liliana Cucu, Joel Goossens
2007 2007 Design, Automation & Test in Europe Conference & Exhibition  
In this paper we study the global scheduling of periodic task systems with arbitrary deadlines upon identical multiprocessor platforms.  ...  feasible schedule of arbitrary deadline periodic task systems is periodic from some point and (ii) for the specific case of synchronous periodic task systems, we show that the schedule repeats from the  ...  In contrast for multiprocessor parallel machines the problem of meeting timing constraints is a relatively new research area.  ... 
doi:10.1109/date.2007.364536 fatcat:qbnwgapg4fhhxnawl5pzo7ejji

Approximate Schedules for Non-Migratory Parallel Jobs in Speed-Scaled Multiprocessor Systems [article]

Alexander Kononov, Yulia Kovalenko
2018 arXiv   pre-print
We consider a problem of scheduling rigid parallel jobs on variable speed processors so as to minimize the total energy consumption.  ...  Each job is specified by its processing volume and the required number of processors.  ...  Further research might address the approaches to the problems with more complex structure, where processors are heterogeneous and jobs have alternative execution modes with different characteristics.  ... 
arXiv:1811.11595v1 fatcat:xavyt2alm5fdffrllueflbjlwa

Simulation-based evaluations of DAG scheduling in hard real-time multiprocessor systems

Manar Qamhieh, Serge Midonnet
2015 ACM SIGAPP Applied Computing Review  
The scheduling of parallel real-time tasks on multiprocessor systems is more complicated than the one of independent sequential tasks, specially for the Directed Acyclic Graph (DAG) model.  ...  The trivial DAG scheduling approach is to directly apply common real-time scheduling algorithms on DAGs despite their lack of compatibility with the parallel model.  ...  CONCLUSION In this paper, we described two main scheduling approaches for global preemptive parallel real-time DAG tasks on multiprocessor systems.  ... 
doi:10.1145/2724928.2724931 fatcat:xwiwksllyraf5jhm6rmlbjoscq
« Previous Showing results 1 — 15 out of 1,371 results