SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Behnam Moris) "

Sökning: WFRF:(Behnam Moris)

  • Resultat 1-10 av 233
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Abdullah, Syed Md Jakaria, et al. (författare)
  • Towards Implementation of Virtual-Clustered Multiprocessor Scheduling in Linux
  • 2013
  • Ingår i: Proceedings of the 8th IEEE International Symposium on Industrial Embedded Systems, SIES 2013. - 9781479906581 ; , s. 97-100
  • Konferensbidrag (refereegranskat)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. (författare)
  • Flexible spin-lock model for resource sharing in multiprocessor real-time systems
  • 2014
  • Ingår i: Proc. IEEE Int. Symp. Ind. Embedded Syst., SIES. - 9781479940233 ; , s. 41-51
  • Konferensbidrag (refereegranskat)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. (författare)
  • Integrating independently developed real-time applications on a shared multi-core architecture
  • 2013
  • Ingår i: ACM SIGBED Review, v. 10, n. 3. - : Association for Computing Machinery (ACM). ; , s. 49-56
  • Konferensbidrag (refereegranskat)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. (författare)
  • Intra-component Resource Sharing on a Virtual Multiprocessor Platform
  • 2016
  • Ingår i: ACM SIGBED Review. - : Association for Computing Machinery (ACM). - 1551-3688. ; , s. 31-32
  • Konferensbidrag (refereegranskat)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 (författare)
  • Lock-Based Resource Sharing for Real-Time Multiprocessors
  • 2017
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • Embedded systems are widely used in the industry and are typically resource constrained, i.e., resources such as processors, I/O devices, shared buffers or shared memory might be limited in the system. Hence, techniques that can enable an efficient usage of processor bandwidths in such systems are of great importance. Locked-based resource sharing protocols are proposed as a solution to overcome resource limitation by allowing the available resources in the system to be safely shared. In recent years, due to a dramatic enhancement in the functionality of systems, a shift from single-core processors to multi-core processors has become inevitable from an industrial perspective to tackle the raised challenges due to increased system complexity. However, the resource sharing protocols are not fully mature for multi-core processors. The two classical multi-core processor resource sharing protocols, spin-based and suspension-based protocols, although providing mutually exclusive access to resources, can introduce long blocking delays to tasks, which may be unacceptable for many industrial applications. In this thesis we enhance the performance of resource sharing protocols for partitioned scheduling, which is the de-facto scheduling standard for industrial real-time multi-core processor systems such as in AUTOSAR, in terms of timing and memory requirements. A new scheduling approach uses a resource efficient hybrid approach combining both partitioned and global scheduling where the partitioned scheduling is used to schedule the major number of tasks in the system. In such a scheduling approach applications with critical task sets use partitioned scheduling to achieve higher level of predictability. Then the unused bandwidth on each core that is remained from partitioning is used to schedule less critical task sets using global scheduling to achieve higher system utilization. These scheduling schema however lacks a proper resource sharing protocol since the existing protocols designed for partitioned and global scheduling cannot be directly applied due to the complex hybrid structure of these scheduling frameworks. In this thesis we propose a resource sharing solution for such a complex structure. Further, we provide the blocking bounds incurred to tasks under the proposed protocols and enhance the schedulability analysis, which is an essential requirement for real-time systems, with the provided blocking bounds.
  •  
6.
  • Afshar, Sara (författare)
  • Lock-Based Resource Sharing in Real-Time Multiprocessor Platforms
  • 2014
  • Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • Embedded systems are typically resource constrained, i.e., resources such as processors, I/O devices, shared buffers or shared memory can be limited for tasks in the system. Therefore, techniques that enable an efficient usage of such resources are of great importance.In the industry, typically large and complex software systems are divided into smaller parts (applications) where each part is developed independently. Migration towards multiprocessor platforms has become inevitable from an industrial perspective. Due to such migration and to efficient use of system resources, these applications eventually may be integrated on a shared multiprocessor platform. In order to facilitate the integration phase of the applications on a shared platform, the timing and resource requirements of each application can be provided in an interface when the application is developed. The system integrator can benefit from such provided information in the interface of each application to ease the integration process. In this thesis, we have provided the resource and timing requirements of each application in their interfaces for applications that may need several processors to be allocated on when they are developed.Although many scheduling techniques have been studied for multiprocessor systems, these techniques are usually based on the assumption that tasks are independent, i.e. do not share resources other than the processors. This assumption is typically not true. In this thesis, we provide an extension to such systems to handle sharing of resources other than processor among tasks. Two traditional approaches exist for multiprocessor systems to schedule tasks on processors. A recent scheduling approach for multiprocessors has combined the two traditional approaches and achieved a hybrid more efficient approach compared to the two previous one. Due to the complex nature of this scheduling approach the conventional approaches for resource sharing could not be used straight forwardly. In this thesis, we have modified resource sharing approaches such that they can be used in such hybrid scheduling systems. A second concern is that enabling resource sharing in the systems can cause unpredictable delays and variations in response time of tasks which can degrade system performance. Therefore, it is of great significance to improve the resource handling techniques to reduce the effect of imposed delays caused by resource sharing in a multiprocessor platform. In this thesis we have proposed alternative techniques for resource handling that can improve system performance for special setups.
  •  
7.
  • Afshar, Sara, et al. (författare)
  • Per Processor Spin-Lock Priority for Partitioned Multiprocessor Real-Time Systems
  • 2014
  • Rapport (övrigt vetenskapligt/konstnärligt)abstract
    • Two traditional approaches exist for a task that is blocked on a global resource; a task either performs a non-preemptive busy wait, i.e., spins, or suspends and releases the processor. Previously, we have shown that both approaches can be viewed as spinning either at the highest priority HP or at the lowest priority on the processor LP, respectively. Based on this view, previously we have generalized a task's blocking behavioral model, as spinning at any arbitrary priority level. In this paper, we focus on a particular class of spin-lock protocols from the introduced flexible spin-lock model where spinning is performed at a priority equal to or higher than the highest local ceiling of the global resources accessed on a processor referred to as CP spin-lock approach. In this paper, we assume that all tasks of a specific processor are spinning on the same priority level. Given this class and assumption, we show that there exists a spin-lock protocol in this range that dominates the classic spin-lock protocol which tasks spin on highest priority level (HP). However we show that this new approach is incomparable with the CP spin-lock approach. Moreover, we show that there may exist an intermediate spin-lock approach between the priority used by CP spin-lock approach and the new introduced spin-lock approach that can make a task set schedulable when those two cannot. We provide an extensive evaluation results comparing the HP, CP and the new proposed approach.
  •  
8.
  • Afshar, Sara, et al. (författare)
  • Per Processor Spin-Lock Priority for Partitioned Multiprocessor Real-Time Systems
  • 2017
  • Ingår i: Leibniz Transactions on Embedded Systems. - 2199-2002. ; :2
  • Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)abstract
    • Two traditional approaches exist for a task that is blocked on a global resource; a task either performs a non-preemptive busy wait, i.e., spins, or suspends and releases the processor. Previously, we have shown that both approaches can be viewed as spinning either at the highest priority HP or at the lowest priority on the processor LP, respectively. Based on this view, previously we have generalized a task's blocking behavioral model, as spinning at any arbitrary priority level. In this paper, we focus on a particular class of spin-lock protocols from the introduced flexible spin-lock model where spinning is performed at a priority equal to or higher than the highest local ceiling of the global resources accessed on a processor referred to as CP spin-lock approach. In this paper, we assume that all tasks of a specific processor are spinning on the same priority level. Given this class and assumption, we show that there exists a spin-lock protocol in this range that dominates the classic spin-lock protocol which tasks spin on highest priority level (HP). However we show that this new approach is incomparable with the CP spin-lock approach. Moreover, we show that there may exist an intermediate spin-lock approach between the priority used by CP spin-lock approach and the new introduced spin-lock approach that can make a task set schedulable when those two cannot. We provide an extensive evaluation results comparing the HP, CP and the new proposed approach.
  •  
9.
  • Afshar, Sara, et al. (författare)
  • Resource sharing in a hybrid partitioned/global scheduling framework for multiprocessors
  • 2015
  • Ingår i: IEEE International Conference on Emerging Technologies and Factory Automation, ETFA. - 9781467379298
  • Konferensbidrag (refereegranskat)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.
  •  
10.
  • Afshar, Sara, et al. (författare)
  • Resource Sharing Under Global Scheduling with Partial Processor Bandwidth
  • 2015
  • Ingår i: 2015 10th IEEE International Symposium on Industrial Embedded Systems, SIES 2015 - Proceedings. - 9781467377119 ; , s. 195-206
  • Konferensbidrag (refereegranskat)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.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 233
Typ av publikation
konferensbidrag (173)
tidskriftsartikel (28)
rapport (11)
licentiatavhandling (9)
doktorsavhandling (8)
annan publikation (2)
visa fler...
bokkapitel (2)
visa färre...
Typ av innehåll
refereegranskat (201)
övrigt vetenskapligt/konstnärligt (32)
Författare/redaktör
Behnam, Moris (155)
Nolte, Thomas (148)
Behnam, Moris, 1973- (70)
Mubeen, Saad (26)
Almeida, Luis (26)
Liu, Meng (24)
visa fler...
Sjödin, Mikael (22)
Ashjaei, Mohammad (21)
Becker, Matthias (19)
J. Bril, Reinder (17)
Shin, Insik (16)
Pedreiras, Paulo (13)
Becker, Matthias, 19 ... (13)
Ashjaei, Seyed Moham ... (11)
Afshar, Sara (11)
Sjödin, Mikael, 1971 ... (11)
Danielsson, Jakob (11)
Sandström, Kristian (10)
Dasari, Dakshina (10)
Åsberg, Mikael (10)
Bril, Reinder J. (9)
Bruhn, Fredrik (9)
Tsog, Nandinbaatar (9)
Khalilzad, Nima (8)
Nemati, Farhang, Sen ... (8)
Moghaddami Khalilzad ... (7)
Almeida, L. (7)
Papadopoulos, Alessa ... (7)
Carlson, Jan (6)
Inam, Rafia, 1974- (6)
Bril, Reinder (6)
Nolte, Thomas, Profe ... (5)
Santos, Rui (5)
Bucaioni, Alessio, 1 ... (5)
Marau, Ricardo (5)
Ashjaei, Mohammad, 1 ... (4)
van den Heuvel, Mart ... (4)
Nolin, Mikael, 1971- (4)
Capannini, Gabriele (4)
Inam, Rafia (3)
Behnam, Moris, Senio ... (3)
Nemati, Farhang (3)
Afshar, Sara Zargari (3)
Lo Bello, Lucia (3)
Begum, Shahina (3)
Papadopoulos, Alessa ... (3)
Pedreiras, P. (3)
Balasubramanian, S.M ... (3)
Lukkien, Johan (3)
Nolin, Mikael (3)
visa färre...
Lärosäte
Mälardalens universitet (231)
Kungliga Tekniska Högskolan (11)
Örebro universitet (9)
Luleå tekniska universitet (2)
Umeå universitet (1)
RISE (1)
visa fler...
Högskolan Dalarna (1)
Blekinge Tekniska Högskola (1)
visa färre...
Språk
Engelska (233)
Forskningsämne (UKÄ/SCB)
Teknik (131)
Naturvetenskap (58)
Samhällsvetenskap (1)

År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy