| 1. |
- Abdullah, Syed Md Jakaria, et al.
(author)
-
Towards Implementation of Virtual-Clustered Multiprocessor Scheduling in Linux
- 2013
-
In: Proceedings of the 8th IEEE International Symposium on Industrial Embedded Systems, SIES 2013. - 9781479906581 ; , s. 97-100
-
Conference paper (peer-reviewed)abstract
- Cluster based multiprocessor scheduling can be seen as a hybrid approach combining benefits of both partitioned and global scheduling. Virtual clustering further enhances it by providing dynamic cluster resource allocation and applying hierarchical scheduling techniques. Over the years, the study of virtual cluster scheduling has been limited to theoretical analysis. In this paper, we present our initial ideas about implementing virtual cluster scheduling in Linux. The purpose of this implementation is twofold: (i) we would like to demonstrate the feasibility of its implementation in an operating system, without modifying the kernel source code, (ii) we present practical insights on the overhead of implementing this framework.
|
|
| 2. |
- Afshar, Sara, et al.
(author)
-
Flexible spin-lock model for resource sharing in multiprocessor real-time systems
- 2014
-
In: Proc. IEEE Int. Symp. Ind. Embedded Syst., SIES. - 9781479940233 ; , s. 41-51
-
Conference paper (peer-reviewed)abstract
- Various approaches can be utilized upon resource locking for mutually exclusive resource access in multiprocessor platforms. So far two conventional approaches exist for dealing with tasks that are blocked on a global resource in a multi-processor platform. Either the blocked task performs a busy wait, i.e. spins, at the highest priority level until the resource is released, or it is suspended. Although both approaches provide mutually exclusive access to resources, they can introduce long blocking delays to tasks, which may be unacceptable for many industrial applications. In this paper, we propose a general spin-based model for resource sharing in multiprocessor platforms in which the priority of the blocked tasks during spinning can be selected arbitrarily. Moreover, we provide the analysis for two selected spin-lock priorities and we show by means of a general comparison as well as specific examples that these solutions may provide a better performance for higher priority tasks.
|
|
| 3. |
- Afshar, Sara, et al.
(author)
-
Integrating independently developed real-time applications on a shared multi-core architecture
- 2013
-
In: ACM SIGBED Review, v. 10, n. 3. - : Association for Computing Machinery (ACM). ; , s. 49-56
-
Conference paper (peer-reviewed)abstract
- The shift towards multi-core platforms has become inevitable from an industry perspective, therefore proper techniques are needed to deal with challenges related to this migration from single core architectures to a multi-core architecture. One of the main concerns for the system developers in this context is the migration of legacy real-time systems to multi-core architectures. To address this concern and to simplify migration, independently developed subsystems are abstracted with an interface, such that when working with multiple independently-developed subsystems to be integrated on a shared platform, one does not need to be aware of information or policies used in other subsystems in order to determine subsystem-level schedulability. Instead schedulability can be checked through their interfaces at the time of integration on a shared multi-core architecture. In this paper we propose a solution for the case where some of the independently-developed subsystems are distributed over more than one processor and we propose an approach to generate interfaces of subsystems that may share mutually exclusive resources.
|
|
| 4. |
- Afshar, Sara, et al.
(author)
-
Intra-component Resource Sharing on a Virtual Multiprocessor Platform
- 2016
-
In: ACM SIGBED Review. - : Association for Computing Machinery (ACM). - 1551-3688. ; , s. 31-32
-
Conference paper (peer-reviewed)abstract
- Component-based software development facilitates the development process of large and complex software systems. By the advent of multiprocessors, the independently developed components can be integrated on a multi-core platform to achieve an efficient use of system hardware and a decrease in system power consumption and costs. In this paper, we consider a virtual multiprocessor platform where each component can be dynamically allocated to any set of processors of the platform with a maximum concurrency level. Global-EDF is used for intra-component scheduling. The existing analysis for such systems have assumed that tasks are independent. In this paper, we enable intra-component resource sharing for this platform. We investigate using a spin-based resource sharing protocol with the accompanying analysis that extends the existing analysis for independent tasks. We briefly illustrate and evaluate our initial results with an example.
|
|
| 5. |
- Afshar, Sara, et al.
(author)
-
Resource sharing in a hybrid partitioned/global scheduling framework for multiprocessors
- 2015
-
In: IEEE International Conference on Emerging Technologies and Factory Automation, ETFA. - 9781467379298
-
Conference paper (peer-reviewed)abstract
- For resource-constrained embedded real-time systems, resource-efficient approaches are very important. Such an approach is presented in this paper, targeting systems where a critical application is partitioned on a multi-core platform and the remaining capacity on each core is provided to a noncritical application using resource reservation techniques. To exploit the potential parallelism of the non-critical application, global scheduling is used for its constituent tasks. Previously, we enabled intra-application resource sharing for such a framework, i.e. each application has its own dedicated set of resources. In this paper, we enable inter-application resource sharing, in particular between the critical application and the non-critical application. This effectively enables resource sharing in a hybrid partitioned/global scheduling framework on multiprocessors. For resource sharing, we use a spin-based synchronization protocol. We derive blocking bounds and extend existing schedulability analysis for such a system.
|
|
| 6. |
- Afshar, Sara, et al.
(author)
-
Resource Sharing Under Global Scheduling with Partial Processor Bandwidth
- 2015
-
In: 2015 10th IEEE International Symposium on Industrial Embedded Systems, SIES 2015 - Proceedings. - 9781467377119 ; , s. 195-206
-
Conference paper (peer-reviewed)abstract
- Resource efficient approaches are of great importance for resource constrained embedded systems. In this paper, we present an approach targeting systems where tasks of a critical application are partitioned on a multi-core platform and by using resource reservation techniques, the remaining bandwidth capacity on each core is utilized for one or a set of non-critical application(s). To provide a resource efficient solution and to exploit the potential parallelism of the extra applications on the multi-core processor, global scheduling is used to schedule the tasks of the non-critical applications. Recently a specific instantiation of such a system has been studied where tasks do not share resources other than the processor. In this paper, we enable semaphore-based resource sharing among tasks within critical and non-critical applications using a suspension-based synchronization protocol. Tasks of non-critical applications have partial access to the processor bandwidth. The paper provides the systems schedulability analysis where blocking due to resource sharing is bounded. Further, we perform experimental evaluations under balanced and unbalanced allocation of tasks of a critical application to cores.
|
|
| 7. |
- Afshar, Sara, et al.
(author)
-
Semi-partitioning under a Blocking-Aware Task Allocation
- 2015
-
In: Proceedings - Real-Time Systems Symposium. - 9781467395076 ; , s. 379-379
-
Conference paper (peer-reviewed)abstract
- Semi-partitioned scheduling is a resource efficient scheduling approach compared to the conventional multiprocessor scheduling approaches in terms of system utilization and migration overhead. Semi-partitioned scheduling can better utilize processor bandwidth compared to the partitioned scheduling while introducing less overhead compared to the global scheduling. Various techniques have been proposed to schedule tasks in a semi-partitioned environment, however, they have used blockingagnostic allocation mechanisms in presence of resource sharing protocols. Since, the allocation mechanism can highly affect the system schedulability, in this paper we provide a blocking-aware allocation mechanism for semi-partitioned scheduling framework under a suspension-based resource sharing protocol. We have applied new heuristics for sorting the tasks in the algorithm that shows improvements upon system schedulability. Finally, we present our preliminary results.
|
|
| 8. |
- Afshar, Sara Zargari, et al.
(author)
-
An optimal spin-lock priority assignment algorithm for real-time multi-core systems
- 2017
-
In: The 23th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications RTCSA'17.
-
Conference paper (peer-reviewed)abstract
- Support for exclusive access to shared (global) resources is instrumental in the context of embedded real-time multi-core systems, and mechanisms for achieving such access must be deterministic and efficient. There exist two traditional approaches for multiprocessors when a task requests a global resource that is locked by a task on a remote core: a spin-based approach, i.e. non-preemptive busy waiting for the resource to become available, and a suspension-based approach, i.e. the task relinquishes the processor. A suspension-based approach can be viewed as a spin-based approach where the lowest priority on a core is used during spinning, similar to a non-preemptive spin-based approach where the highest priority on a core is used. By taking such a view, we previously provided a general model for spinning, where any arbitrary priority can be used for spinning, i.e. from the lowest to the highest priority on a core. Targeting partitioned fixed-priority preemptive scheduled multiprocessors and spin-based approaches that use a fixed priority for spinning per core for all tasks, we aim at increasing the schedulability of multiprocessor systems by using the spin-lock priority per core as parameter. In this paper, we present (i) a generalization of the traditional worst-case response-time analysis for non-preemptive spin-based approaches addressing an arbitrary but fixed spin-lock priority per core, (ii) an optimal spin-lock priority assignment (OSPA) algorithm per core, i.e. an algorithm that will find a fixed spin-lock priority per core that will make the system schedulable, whenever such an assignment exists and, (iii) comparative evaluations of the OSPA algorithm with the spin-based and suspension-based approaches where OSPA showed up to 38% improvement compared to both approaches.
|
|
| 9. |
- Aglianò, Simone, et al.
(author)
-
Resource Management and Control in Virtualized SDN Networks
- 2018
-
In: CSI International Symposium on Real-Time and Embedded Systems and Technologies REST'18. - 9781538614754 ; , s. 47-53
-
Conference paper (peer-reviewed)abstract
- Software defined networking and network virtual-ization are widely considered promising techniques for reducing the complexity of network management in many contexts that require high Quality of Service (QoS) and the support for heterogeneous architectures. In this paper we address a network architecture, here called a virtualized SDN network, that combines the benefits of SDN and virtualization. To cope with the demand for efficiently sharing a platform among several services, here a resource management mechanism to reserve and control network resources among various services in the virtualized SDN networks is proposed. The mechanism is implemented on an SDN controller and a set of experiments show the effectiveness of the proposed approach.
|
|
| 10. |
- Al-Dulaimy, Auday, et al.
(author)
-
Fault Tolerance in Cloud Manufacturing : An Overview
- 2023
-
In: Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST. - : Springer Science and Business Media Deutschland GmbH. - 9783031318900 ; , s. 89-101
-
Conference paper (peer-reviewed)abstract
- Utilizing edge and cloud computing to empower the profitability of manufacturing is drastically increasing in modern industries. As a result of that, several challenges have raised over the years that essentially require urgent attention. Among these, coping with different faults in edge and cloud computing and recovering from permanent and temporary faults became prominent issues to be solved. In this paper, we focus on the challenges of applying fault tolerance techniques on edge and cloud computing in the context of manufacturing and we investigate the current state of the proposed approaches by categorizing them into several groups. Moreover, we identify critical gaps in the research domain as open research directions. © 2023, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.
|
|
