Filters








2,374 Hits in 6.9 sec

Workload assignment for global real-time scheduling on unrelated multicore platforms

Antoine Bertout, Joël Goossens, Emmanuel Grolleau, Xavier Poczekajlo
2020 Proceedings of the 28th International Conference on Real-Time Networks and Systems  
We extend fundamental global scheduling results on unrelated processors to results on unrelated multicore platforms, a more realistic model.  ...  We also discuss the practical limitations of the global scheduling approach on unrelated platforms and argue that it is still worth investigating considering modern MPSoCs.  ...  LP-Feas and LP-CFeas In [6] , author presents a LP-Feas, a LP model for assigning the workload on an unrelated real-time multiprocessor platform.  ... 
doi:10.1145/3394810.3394823 dblp:conf/rtns/BertoutGGP20 fatcat:stqwxoned5a7jjunrk3l4b2lse

A Fully Preemptive Multiprocessor Semaphore Protocol for Latency-Sensitive Real-Time Applications

Bjorn B. Brandenburg
2013 2013 25th Euromicro Conference on Real-Time Systems  
The OMIP is the first independence-preserving, real-time, suspension-based locking protocol for clustered job-level fixed-priority scheduling.  ...  Independence preservation, a property in real-time locking protocols that isolates latency-sensitive tasks from delays due to unrelated critical sections, is identified, formalized, and studied in detail  ...  ) of global and partitioned scheduling where tasks are statically assigned to non-overlapping subsets (or clusters) of processors, and each cluster is scheduled using a global policy.  ... 
doi:10.1109/ecrts.2013.38 dblp:conf/ecrts/Brandenburg13 fatcat:yot6uog37rbhrnzblpgdjcefly

Multiprocessor real-time scheduling with arbitrary processor affinities: from practice to theory

Arpan Gujarati, Felipe Cerqueira, Björn B. Brandenburg
2014 Real-time systems  
Concerning the more general case of joblevel dynamic priorities, it is shown that global and clustered scheduling are equivalent to multiprocessor real-time scheduling with arbitrary processor affinities  ...  However, to date, the lack of schedulability analysis for such systems prevents the use of arbitrary processor affinities in predictable hard real-time systems.  ...  In the following, let τ be the real-time workload under consideration, which is to be scheduled on a multiprocessor platform π.  ... 
doi:10.1007/s11241-014-9205-9 fatcat:inmf6r42inektjhm63dxegnyti

An experimental comparison of different real-time schedulers on multicore systems

Juri Lelli, Dario Faggioli, Tommaso Cucinotta, Giuseppe Lipari
2012 Journal of Systems and Software  
in global, partitioned and clustered mode.  ...  In this work, an experimental comparison among the Rate Monotonic (RM) and Earliest Deadline First (EDF) multiprocessor real-time schedulers is performed, with a focus on soft real-time systems.  ...  Clustered schedulers reside somewhat in the middle, where the available processors are partitioned into clusters to which tasks are statically assigned, but in each cluster tasks are globally scheduled  ... 
doi:10.1016/j.jss.2012.05.048 fatcat:v6juqylp4bekfjqzinkzalpwxy

Multiprocessor Real-Time Locking Protocols: A Systematic Review [article]

Björn B. Brandenburg
2019 arXiv   pre-print
We systematically survey the literature on analytically sound multiprocessor real-time locking protocols from 1988 until 2018, covering the following topics: progress mechanisms that prevent the lock-holder  ...  A special focus is placed on the suspension-oblivious and suspension-aware analysis approaches for semaphore protocols, their respective notions of priority inversion, optimality criteria, lower bounds  ...  J is not scheduled at time t, and 3. fewer than c equal-or higher-priority jobs of tasks assigned to cluster C are scheduled on processors belonging to τ i 's assigned cluster C.  ... 
arXiv:1909.09600v1 fatcat:tmqcpiuxfbbd5jrcecgvoeanpm

Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling

Vincenzo Bonifaci, Gianlorenzo DAngelo, Alberto Marchetti-Spaccamela
2017 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)  
For the makespan minimization objective, the model generalizes classical scheduling problems such as unrelated parallel machine scheduling, as well as novel ones such as semi-partitioned and clustered  ...  We propose a model for scheduling jobs in a parallel machine setting that takes into account the cost of migrations by assuming that the processing time of a job may depend on the specific set of machines  ...  Then each job can either be run globally (i.e., freely migrated) on M with processing time p M j , or assigned locally to a specific machine i ∈ M , with processing time p ij ≤ p M j . • Clustered scheduling  ... 
doi:10.1109/ipdps.2017.22 dblp:conf/ipps/BonifaciDM17 fatcat:aqf5so6qvfalfi62ouxnpkj6g4

Multiprocessor Feasibility Analysis of Recurrent Task Systems with Specified Processor Affinities

Sanjoy Baruah, Bjorn Brandenburg
2013 2013 IEEE 34th Real-Time Systems Symposium  
Given a real-time task system consisting of a collection of implicit-deadline sporadic tasks with an affinity mask specified for each task that is to be implemented upon an identical multiprocessor platform  ...  In many current multiprocessor real-time operating systems, programmers have the ability to set affinity masks that pin a process to a specified subset of the processors in the system.  ...  under global scheduling upon an unrelated multiprocessor platform can be solved in polynomial time 1 .  ... 
doi:10.1109/rtss.2013.24 dblp:conf/rtss/BaruahB13 fatcat:rvidyg2uj5htvi3fxgbt6ghch4

Topology-aware job mapping

Yiannis Georgiou, Emmanuel Jeannot, Guillaume Mercier, Adèle Villiermet
2017 The international journal of high performance computing applications  
in a real cluster.  ...  Its main intelligence relies on resource selection techniques to find the most adapted resources to schedule the users' jobs.  ...  Only the standard batch scheduler algorithm is used (assigning the job to the best sub-tree).  ... 
doi:10.1177/1094342017727061 fatcat:35fnfho4wje4nmlgi3wv7wbilu

A Cloud Computing Infrastructure on Heterogeneous Computing Resources

Baomin XU, Ning Wang, Chunyan Li
2011 Journal of Computers  
The main intention of HCCloud is to decrease the configuration scale of the cluster system through heterogeneous workloads, while increasing the number of requests for parallel workload by provisioning  ...  With HCCloud, users no longer have to manually setup machine, or determine where and when to schedule their tasks.  ...  The Information Collector interacts with AC Monitor and provides real time job monitoring information. Back-end Server runs on front-end of each cluster.  ... 
doi:10.4304/jcp.6.8.1789-1796 fatcat:phvo6x24yvc5tp6hr75yztplr4

A novel energy-driven computing paradigm for e-health scenarios

Marina Zapater, Patricia Arroba, José L. Ayala, José M. Moya, Katzalin Olcoz
2014 Future generations computer systems  
Node Coordinator Cloud infrastructure Resource allocation Resource Management (RM) & Configuration Application/Compiler Architecture Global resource allocation WBSN adaptation [23] ECG algorithms [11]  ...  The novel computing concept, and the multilayer top-down energy-optimization methodology, obtain promising results in a realistic scenario for cardiovascular tracking and analysis, making the Home Assisted  ...  Figure 15 provides an insight on the workload coming into the data center for three different scenarios and how that workload is scheduled by SLURM in an Intel 160-core homogeneous cluster.  ... 
doi:10.1016/j.future.2013.12.012 fatcat:vdhpnj7oz5hivo4ugpqjmx7gum

Apache Hadoop YARN

Vinod Kumar Vavilapalli, Siddharth Seth, Bikas Saha, Carlo Curino, Owen O'Malley, Sanjay Radia, Benjamin Reed, Eric Baldeschwieler, Arun C. Murthy, Chris Douglas, Sharad Agarwal, Mahadev Konar (+4 others)
2013 Proceedings of the 4th annual Symposium on Cloud Computing - SOCC '13  
the scheduler.  ...  In this paper, we summarize the design, development, and current state of deployment of the next generation of Hadoop's compute platform: YARN.  ...  This makes it possible to tightly enforce global scheduling properties (different schedulers in YARN focus on different global properties, such as capacity or fairness), but it requires the scheduler to  ... 
doi:10.1145/2523616.2523633 dblp:conf/cloud/VavilapalliMDAKEGLSSSCORRB13 fatcat:q4w4dykyxrhnpolmydw27hp3fi

Scheduling streaming applications on a complex multicore platform

Tudor David, Mathias Jacquelin, Loris Marchal
2011 Concurrency and Computation  
This allows us to thoroughly test our scheduling strategies on the real platform.  ...  Scheduling complex streaming applications on a complex multicore platform  ...  real platform that on the model.  ... 
doi:10.1002/cpe.1874 fatcat:pc5emr3kmjg7hlrdimn6d33nay

Minimizing the stretch when scheduling flows of biological requests

Arnaud Legrand, Alan Su, Frédéric Vivien
2006 Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '06  
We first explain the relationship between this model and the preemptive uni-processor one.  ...  In this paper, we consider the problem of scheduling comparisons of motifs against biological databanks. This problem lies in the divisible load framework with negligible communication costs.  ...  The results of these tests indicate that the scheduling time for a 15-minute workload was on average under 0.28 s for any of our on-line heuristics, and 0.54 s for the off-line optimal algorithm (with  ... 
doi:10.1145/1148109.1148124 dblp:conf/spaa/LegrandSV06 fatcat:7suagcixlvdizidvxt2c7rrg7a

Resource overbooking and application profiling in a shared Internet hosting platform

Bhuvan Urgaonkar, Prashant Shenoy, Timothy Roscoe
2009 ACM Transactions on Internet Technology  
In this article, we present techniques for provisioning CPU and network resources in shared Internet hosting platforms running potentially antagonistic third-party applications.  ...  We then propose techniques to overbook cluster resources in a controlled fashion.  ...  nature of this soft real-time application).  ... 
doi:10.1145/1462159.1462160 fatcat:ylilcpsbbra75lpcu6wdbgk3yy

Optimization of Data Assignment for Parallel Processing in a Hybrid Heterogeneous Environment Using Integer Linear Programming

Tomasz Boiński, Paweł Czarnul
2021 Computer journal  
For an exemplary workload based on solving systems of equations of various sizes with various compute-to-communication ratios we demonstrate that using an integer linear programming solver (lp_solve) with  ...  We show that theoretical results from our model are close to real results as differences do not exceed 5% for larger data sizes, with up to 16.7% for smaller data sizes.  ...  In [5] , authors formulated an MILP model for an unrelated parallel machines scheduling problem with consideration of penalty cost of makespan and time varying electricity cost.  ... 
doi:10.1093/comjnl/bxaa187 fatcat:m2wl52tugra2dfbspjareteuvu
« Previous Showing results 1 — 15 out of 2,374 results