3,599 Hits in 3.6 sec

Resource sharing under server-based multiprocessor scheduling

Sara Afshar, Moris Behnam
2013 ACM SIGBED Review  
In this paper, we investigate a mechanism for handling resource sharing among tasks under a server-based scheduling technique in multiprocessor platforms, which combines partitioned and global scheduling  ...  INTRODUCTION Semi-partitioned scheduling for multiprocessors benefits from both conventional global and partitioned approaches such that most tasks are assigned statically to processors similar to partitioned  ...  ., they do not share any resource. In this paper, we propose a resource sharing protocol for the case when tasks under the SDS multi-core hierarchical scheduling share resources with each other.  ... 
doi:10.1145/2518148.2518173 fatcat:p7dyirf2ajg5topjtf7x5kplqy

Investigation of implementing a synchronization protocol under multiprocessors hierarchical scheduling

Farhang Nemati, Moris Behnam, Thomas Nolte, Reinder J. Bril
2009 2009 IEEE Conference on Emerging Technologies & Factory Automation  
In practice a typical real-time system usually share logical resources among tasks. However, synchronization in the multiprocessor area has not received enough attention.  ...  In the multi-core and multiprocessor domain, there has been considerable work done on scheduling techniques assuming that real-time tasks are independent.  ...  The shared resources are classified as either (i) local resources that are shared among tasks assigned to the same processor, or (ii) global resources that are shared by tasks assigned to different processors  ... 
doi:10.1109/etfa.2009.5347221 dblp:conf/etfa/NematiBNB09 fatcat:zgnp6kc4ovegho3m5afr63rqra

Towards resource sharing under multiprocessor semi-partitioned scheduling

Sara Afshar, Farhang Nemati, Thomas Nolte
2012 7th IEEE International Symposium on Industrial Embedded Systems (SIES'12)  
In this paper we propose two methods for handling resource sharing under semi-partitioned scheduling in multiprocessor platforms.  ...  Semi-partitioned scheduling has been subject of recent interest, compared with conventional global and partitioned scheduling algorithms for multiprocessors, due to better utilization results.  ...  In the second algorithm, more than one subtask of a split task may share resources with other tasks in the system.  ... 
doi:10.1109/sies.2012.6356605 dblp:conf/sies/AfsharNN12 fatcat:3zlwnwslzzgrnnaord55ile55e

Multiprocessor Synchronization and Hierarchical Scheduling

Farhang Nemati, Moris Behnam, Thomas Nolte
2009 2009 International Conference on Parallel Processing Workshops  
However, synchronization of dependent tasks executing on multi-cores has not received as much attention, even though typical real-time systems in practice include tasks that share resources.  ...  The presented protocol groups dependent tasks that directly or indirectly share mutually exclusive resources into independent components.  ...  System model and background This paper focuses on synchronization of tasks that share mutually exclusive resources in a multiprocessor system consisting of m identical processors.  ... 
doi:10.1109/icppw.2009.44 dblp:conf/icppw/NematiBN09 fatcat:5clzfh6hofcs7pefpoysxzameq

Response-time analysis of arbitrarily activated tasks in multiprocessor systems with shared resources

M. Negrean, S. Schliecker, R. Ernst
2009 2009 Design, Automation & Test in Europe Conference & Exhibition  
multiprocessor system with shared resources.  ...  Furthermore, we derive an improved bound on the blocking time in this setup for the case where the shared resources are protected according to the Multiprocessor Priority Ceiling Protocol (MPCP).  ...  Multiprocessor response time analysis In this section, we provide the schedulability condition for tasks under the partitioned multiprocessor static priority preemptive scheduling with shared resources  ... 
doi:10.1109/date.2009.5090720 dblp:conf/date/NegreanSE09 fatcat:mpdsospdfvdqjlvkaaaapuao3m

A flexible tool for evaluating scheduling, synchronization and partitioning algorithms on multiprocessors

F Nemati, T Nolte
2010 2010 IEEE 15th Conference on Emerging Technologies & Factory Automation (ETFA 2010)  
Heuristic algorithms have been developed for partitioning a task set on multiprocessor platforms.  ...  As the multi-cores are becoming the defacto processors, the need for new scheduling and resource sharing protocols has arisen.  ...  The heuristic partitions a system (task set) on an identical shared memory single-chip multiprocessor (multi-core) platform.  ... 
doi:10.1109/etfa.2010.5641282 dblp:conf/etfa/NematiN10 fatcat:inzlicp2qffgli5eqpa6sz4rfa

Resource Sharing under Multiprocessor Semi-partitioned Scheduling

Sara Afshar, Farhang Nemati, Thomas Nolte
2012 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications  
In this paper we propose and evaluate two methods for handling resource sharing under semipartitioned scheduling in multiprocessor platforms.  ...  Under semi-partitioned scheduling, a major group of tasks are assigned to fixed processors while a low number of tasks are allocated to more than one processor.  ...  priority higher than τ j that share global resources other than R q . 2) Tasks with higher priority: A task τ i assigned to processor P k which gets blocked on R q has to wait for all higher priority  ... 
doi:10.1109/rtcsa.2012.25 dblp:conf/rtcsa/AfsharNN12 fatcat:w2ibqp5zaratjgljopvk6363zq

Resource-Oriented Partitioning for Multiprocessor Systems with Shared Resources

Maolin Yang, Wen-Hung Huang, Jian-Jia Chen
2018 IEEE transactions on computers  
In this paper, we show that the proposed Resource-Oriented Partitioned (ROP) scheduling with a distributed resource sharing policy, originating from the concept of the Distributed Priority Ceiling Protocol  ...  However, it remains arguable as to whether there exists a preferable approach for resource sharing in multiprocessor systems.  ...  ACKNOWLEDGMENTS We would like to thank Zewei Chen for conducting the experiments on SET-MARTS, and we appreciate the anonymous reviewers for their valuable comments and suggestions, which significantly  ... 
doi:10.1109/tc.2018.2889985 fatcat:wnj5syppibckbnw5lokwge5oy4

Efficient partitioning of sporadic real-time tasks with shared resources and spin locks

Alexander Wieder, Bjorn B. Brandenburg
2013 2013 8th IEEE International Symposium on Industrial Embedded Systems (SIES)  
Behnam, "Partitioning real-time systems on multiprocessors with shared resources," in Proc. OPODIS, 2010.  ...  With shared resources, optimal partitioning matters! Potential left wasted!  ... 
doi:10.1109/sies.2013.6601470 dblp:conf/sies/WiederB13 fatcat:xdd6ps3aabebdlx6cvdr4mcemy

Supporting Multiprocessor Resource Synchronization Protocols in RTEMS [article]

Junjie Shi, Jan Duy Thien Pham, Malte Münch, Jan Viktor Hafemeister, Jian-Jia Chen, Kuan-Hsun Chen
2022 arXiv   pre-print
When considering recurrent tasks in real-time systems, concurrent accesses to shared resources, can cause race conditions or data corruptions.  ...  Such a problem has been extensively studied since the 1990s, and numerous resource synchronization protocols have been developed for both uni-processor and multiprocessor real-time systems, with the assumption  ...  For example, in DPCP and ROP-PCP, shared resources are assigned on processors, the critical sections have to be executed on the corresponding processors, where may not be the same as the original partition  ... 
arXiv:2104.06366v2 fatcat:32pdizdhbrbhzcoaplvf5qcqum

A Correlation Framework for different Resource Access Protocol in Real Time System

Leena Das, Susmita Saha
2014 International Journal of Modern Education and Computer Science  
This paper is mainly focusing on the different types of resource access protocols and their comparisons. are local jobs on P 1 and J 3 is local job on P 2 .  ...  But for share non preemptable resources those algorithm cannot satisfactorily be used.  ...  Due to which we are able to come out with this result. We thank our family members and one and all whose well wishes made us to reach our goal.  ... 
doi:10.5815/ijmecs.2014.04.05 fatcat:kzcfvwbs5netlm5ywzh4j6zy6e

Robust partitioning for real-time multiprocessor systems with shared resources

Frédéric Fauberteau, Serge Midonnet
2011 Proceedings of the 2011 ACM Symposium on Research in Applied Computation - RACS '11  
In this paper, we focus on the temporal robustness in the hard real-time multiprocessor systems. This robustness is the capacity to tolerate faults in such a way that no deadlines are missed.  ...  Our contribution is to propose a partitioning algorithm which assigns the tasks to processors in order to maximize the robustness of the system to Worst Case Execution Time (WCET) overruns faults or Minimum  ...  The local resources are only shared by jobs on the same processor whilst global ones are shared by jobs which can be assigned on several processors.  ... 
doi:10.1145/2103380.2103394 dblp:conf/racs/FauberteauM11 fatcat:2is3wmxc4fe6laumdaut6hvqyu

Scheduling Sporadic Tasks on Multiprocessors with Mutual Exclusion Constraints

Arvind Easwaran, Björn Andersson
2009 2009 International Conference on Parallel Processing Workshops  
Consider the problem of scheduling sporadic tasks on a multiprocessor platform under mutual exclusion constraints.  ...  scheduling (Failure) Figure 5 . 5 Global multiprocessor scheduling (Success)Algorithm 1 Global scheduling with resource sharing 1: n assigned ← 0 2: for each ready job J in priority order (based on  ...  Introduction Typically, a real-time system is comprised of several tasks that execute on a shared computing platform comprised of (i) one or more processors and (ii) other shared resources (such as shared  ... 
doi:10.1109/icppw.2009.59 dblp:conf/icppw/EaswaranA09 fatcat:xo5n45ho6rfmfkd2jwj42gikby

Energy-Efficient Task Partitioning for Real-Time Scheduling on Multi-Core Platforms

Manal A. El Sayed, El Sayed M. Saad, Rasha F. Aly, Shahira M. Habashy
2021 Computers  
This paper deals with the problem of energy-aware static partitioning of periodic, dependent real-time tasks on a homogenous multi-core platform.  ...  Concurrent access of the tasks to shared resources by multiple tasks running on different cores induced a higher blocking time, which increases the worst-case execution time (WCET) of tasks and can cause  ...  The proposed BABP algorithm assigns a task set to the processor of a single-chip multiprocessor (multicore) with shared memory.  ... 
doi:10.3390/computers10010010 fatcat:serhkrztfzgvbdg6dqngawz5wm

Partitioning Real-Time Systems on Multiprocessors with Shared Resources [chapter]

Farhang Nemati, Thomas Nolte, Moris Behnam
2010 Lecture Notes in Computer Science  
In this paper we propose a blocking-aware partitioning algorithm which allocates a task set on a multiprocessor (multi-core) platform in a way that the overall amount of blocking times of tasks are decreased  ...  The comparison criteria includes both number of schedulable systems as well as processor reduction performance. of the tasks. On the other hand, with the smaller size of tasks, the blocking parame-  ...  The heuristic partitions a system (task set) on an identical shared memory single-chip multiprocessor platform.  ... 
doi:10.1007/978-3-642-17653-1_20 fatcat:7iplv2w2nbgnxejtmhmhhsx7pq
« Previous Showing results 1 — 15 out of 3,599 results