Filters








23,001 Hits in 2.8 sec

Multiprocessor Global Scheduling on Frame-Based DVFS Systems [article]

Vandy Berten, Joël Goossens
2008 arXiv   pre-print
More precisely, we consider global scheduling algorithms for frame-based multiprocessor stochastic DVFS (Dynamic Voltage and Frequency Scaling) systems.  ...  In this ongoing work, we are interested in multiprocessor energy efficient systems, where task durations are not known in advance, but are know stochastically.  ...  As far as we know, global scheduling algorithm on multiprocessor system using stochastic tasks, and a limited number of available frequencies, has not been considered so far.  ... 
arXiv:0809.4082v1 fatcat:2jxabiejn5ajpjq3xzadjgpnku

Fair scheduling of dynamic task systems on multiprocessors

Anand Srinivasan, James H. Anderson
2005 Journal of Systems and Software  
In this paper, we extend their work by considering fair-scheduled multiprocessors.  ...  We show that their conditions are sufficient on M processors, under any deadline-based Pfair scheduling algorithm, if the utilization of every subset of M − 1 tasks is at most one.  ...  In this paper, we consider the problem of scheduling such task systems on multiprocessors.  ... 
doi:10.1016/j.jss.2003.12.041 fatcat:f32oqqs4e5donhoftsidpmufje

Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors

Björn Andersson, Konstantinos Bletsas, Sanjoy Baruah
2008 2008 Real-Time Systems Symposium  
A new algorithm is proposed for scheduling preemptible arbitrary-deadline sporadic task systems upon multiprocessor platforms, with interprocessor migration permitted.  ...  Simulationbased evaluation indicates that this algorithm offers a significant improvement on the ability to schedule arbitrarydeadline sporadic task systems as compared to the contemporary state-of-art  ...  Algorithms for scheduling sporadic task systems on multiprocessors have traditionally been categorized as partitioned or global.  ... 
doi:10.1109/rtss.2008.44 dblp:conf/rtss/AnderssonBB08 fatcat:bw4ugrmlmbgtzp6ocmqk4kpk2q

Multi-rate fluid scheduling of mixed-criticality systems on multiprocessors

Saravanan Ramanathan, Arvind Easwaran, Hyeonjoong Cho
2017 Real-time systems  
In this paper we consider the problem of mixed-criticality (MC) scheduling of implicit-deadline sporadic task systems on a homogenous multiprocessor platform.  ...  Focusing on dual-criticality systems, algorithms based on the fluid scheduling model have been proposed in the past.  ...  Acknowledgement We would like to thank Jaewoo Lee for providing motivation for this work through discussions on the sub-optimality of dual-rate fluid scheduling.  ... 
doi:10.1007/s11241-017-9296-1 fatcat:chmyrlrauvcqlkpwvzdcxcq2na

A WEAKLY HARD SCHEDULING APPROACH OF PARTITIONED SCHEDULING ON MULTIPROCESSOR SYSTEMS

Habibah Ismail, Dayang N. A. Jawawi
2015 Jurnal Teknologi  
As real-time application systems increasingly come to be implemented upon multiprocessor environments, thus, this study applies multiprocessor scheduling approach for verification of weakly hard real-time  ...  Real-time systems or tasks can be classified into three categories, based on the "seriousness" of deadline misses – hard, soft and weakly hard real-time tasks.  ...  Later on, Baruah studied the partitioned EDF scheduling of sporadic task systems on identical multiprocessor platforms [19] .  ... 
doi:10.11113/jt.v77.6204 fatcat:2enfmudg7rewnje3ttsqhjip6a

Semi-partitioned Scheduling of Sporadic Task Systems on Multiprocessors

Shinpei Kato, Nobuyuki Yamasaki, Yutaka Ishikawa
2009 2009 21st Euromicro Conference on Real-Time Systems  
This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms.  ...  The algorithm is based on the concept of semi-partitioned scheduling, in which most tasks are fixed to specific processors, while a few tasks migrate across processors.  ...  The research on real-time systems has been therefore renewed for those multiprocessor platforms, especially in the context of real-time scheduling.  ... 
doi:10.1109/ecrts.2009.22 dblp:conf/ecrts/KatoYI09 fatcat:ise7egyz4jg5xlim6nt44glwpi

Scheduling arbitrary number of malleable tasks on multiprocessor systems

M.S. Barketau, M.Y. Kovalyov, J. Węglarz, M. Machowiak
2014 Bulletin of the Polish Academy of Sciences: Technical Sciences  
The problem of scheduling n tasks in a multiprocessor system with m processors to minimize the makespan is studied.  ...  Tasks are malleable, which means that a task can be executed by several processors at a time, its processing speed depends on the number of allocated processors, and a set of processors allocated to the  ...  Scheduling arbitrary number of malleable tasks on multiprocessor systems Proof. Since functions f j (r) are continuous and set D is a bounded polyhedron, set U is a bounded closed set.  ... 
doi:10.2478/bpasts-2014-0025 fatcat:h3p7r72dbrguzku56fyd4mvili

Temperature-aware test scheduling for multiprocessor systems-on-chip

David R. Bild, Sanchit Misra, Thidapat Chantemy, Prabhat Kumar, Robert P. Dick, X. Sharon Huy, Li Shangz, Alok Choudhary
2008 2008 IEEE/ACM International Conference on Computer-Aided Design  
Our results improve on the test schedule time of the best existing algorithm by 10.8% on average for a packaged IC thermal environment.  ...  Second, we present an optimal formulation for minimal-duration temperature-constrained test scheduling.  ...  In the second part of this paper, we develop and analyze a temperature-aware multiprocessor systems-on-chip (MPSoC) test scheduling algorithm.  ... 
doi:10.1109/iccad.2008.4681552 dblp:conf/iccad/BildMCKDHSC08 fatcat:4rtenrwglzaqjbehp6txaqx5gi

Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms

M. Bertogna, M. Cirinei, G. Lipari
2009 IEEE Transactions on Parallel and Distributed Systems  
First, a general method to derive schedulability conditions for multiprocessor real-time systems will be presented.  ...  This paper addresses the schedulability problem of periodic and sporadic real-time task sets with constrained deadlines preemptively scheduled on a multiprocessor platform composed by identical processors  ...  schedulability test valid for task systems scheduled with work-conserving global scheduling policies on multiprocessor platforms.  ... 
doi:10.1109/tpds.2008.129 fatcat:fznu2hfjbvba3jleihhaui2ilq

Performance Analysis of List Scheduling on Homogeneous Multiprocessors System

Sunita Kushwaha, Sanjay Kumar
2016 International Journal of Computer Applications  
This paper evaluates the performance of homogeneous multiprocessor system on the basis of Throughput. General Terms List heuristic scheduling  ...  Hence, there is a necessity for developing efficient scheduling algorithms. Therefore, various researches have been done in different areas of scheduling of multiprocessor system.  ...  In multiprocessor system scheduling became more challenging than uniprocessor system due to presence of more processing unit. Mapping of processes on processor is difficult.  ... 
doi:10.5120/ijca2016911897 fatcat:kpafj6thuzgbhe2mppl6rcyxai

Deadline-based scheduling of periodic task systems on multiprocessors

Anand Srinivasan, Sanjoy Baruah
2002 Information Processing Letters  
We consider the problem of scheduling periodic task systems on multiprocessors and present a deadline-based scheduling algorithm for solving this problem.  ...  We show that our algorithm successfully schedules on m processors any periodic task system with utilization at most m 2 /(2m − 1).  ...  Identical multiprocessor platform. In this paper, we study the scheduling of periodic task systems on m ( 1) identical multiprocessors.  ... 
doi:10.1016/s0020-0190(02)00231-4 fatcat:qapiinoxnvfwtfcyiumjpe3mc4

Mixed-criticality scheduling on multiprocessors

Sanjoy Baruah, Bipasa Chattopadhyay, Haohan Li, Insik Shin
2013 Real-time systems  
The scheduling of mixed-criticality implicit-deadline sporadic task systems on identical multiprocessor platforms is considered.  ...  Two approaches, one for global and another for partitioned scheduling, are described.  ...  Mixed-criticality systems are increasingly being implemented on multiprocessor platforms.  ... 
doi:10.1007/s11241-013-9184-2 fatcat:zcmrimsndjhmxaxfzgmuu364me

Nearly on-line scheduling of multiprocessor systems with memories

Ten-Hwang Lai, Sartaj Sahni
1983 Journal of Algorithms  
We show that no multiprocessor system that contains at least one processor with memory size smaller than at least two other processors can be scheduled nearly on line to minimize the finish time.  ...  Finally, we review the complexity of some other scheduling problems for multiprocessor systems with memories.  ...  Conclusions We have obtained a sharp boundary between the multiprocessor systems for which nearly on line scheduling algorithms that minimize C max exist and those for which such algorithms do not exist  ... 
doi:10.1016/0196-6774(83)90016-0 fatcat:bsuchjtlj5cu3gdkovxe4lyddi

Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems [article]

Liliana Cucu-Grosjean, Joël Goossens
2009 arXiv   pre-print
The multiprocessor Fixed-Job Priority (FJP) scheduling of real-time systems is studied.  ...  A convenient consequence is the fact that any FJP schedulers are predictable on uniform multiprocessors.  ...  main property, the predictability of FJP schedulers on unrelated multiprocessors which is based on the following lemma.  ... 
arXiv:0908.3519v1 fatcat:qwgz6oeg2jcrvpcnwmzcwpnn6q

Scalable Hierarchical Scheduling for Malleable Parallel Jobs on Multiprocessor-based Systems [article]

Yangjie Cao, Hongyang Sun, Depei Qian, Weiguo Wu
2014 arXiv   pre-print
In this paper, we study hierarchical scheduling for malleable parallel jobs on multiprocessor-based systems, which appears in many distributed and multilayered computing environments.  ...  The proliferation of multi-core and multiprocessor-based computer systems has led to explosive development of parallel applications and hence the need for efficient schedulers.  ...  Compared to the previous work, we present a general hierarchical scheduling paradigm for multiprocessor-based systems, which provides a flexible approach to hierarchically allocating computing resources  ... 
arXiv:1412.4213v1 fatcat:y34ra3wokzcztahlrjqhuxjfia
« Previous Showing results 1 — 15 out of 23,001 results