SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Nolte Thomas) "

Sökning: WFRF:(Nolte Thomas)

  • Resultat 31-40 av 411
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
31.
  • 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.
  •  
32.
  • 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.
  •  
33.
  • Afshar, Sara, et al. (författare)
  • Resource Sharing among Prioritized Real-Time Applications on Multiprocessors
  • 2015
  • Ingår i: ACM SIGBED Review - Special Issue on the 6th International Workshop on Compositional Theory and Technology for Real-Time Embedded Systems. - : Association for Computing Machinery (ACM). ; , s. 46-55
  • Konferensbidrag (refereegranskat)abstract
    • In this paper, we propose a new protocol for handling resource sharing among prioritized real-time applications composed on a multiprocessor platform. We propose an optimal priority assignment algorithm which assigns unique priorities to the applications based on information in their interfaces. We have performed experimental evaluations to compare the proposed protocol (called MSOS-Priority) to the current state of the art locking protocols under multiprocessor partitioned scheduling, i.e., MPCP, MSRP, FMLP, MSOS, and OMLP. The valuations show that MSOS-Priority mostly performs significantly better than alternative approaches.
  •  
34.
  • 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.
  •  
35.
  • 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.
  •  
36.
  • Afshar, Sara, et al. (författare)
  • Resource Sharing under Multiprocessor Semi-Partitioned Scheduling
  • 2012
  • Ingår i: 18th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'12). - : IEEE. - 9781467330176 - 9780769548241 ; , s. 290-299
  • Konferensbidrag (refereegranskat)abstract
    • Semi-partitioned scheduling has become the subject of recent interest for multiprocessors due to better utilization results, compared to conventional global and partitioned scheduling algorithms. 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. Various task assigning techniques have recently been proposed in a semi-partitioned environment. However, a synchronization mechanism for resource sharing among tasks in semi-partitioned scheduling has not yet been investigated. In this paper we propose and evaluate two methods for handling resource sharing under semi-partitioned scheduling in multiprocessor platforms. The main challenge addressed in this paper is to serve the resource requests of tasks that are assigned to different processors.
  •  
37.
  • Afshar, Sara, et al. (författare)
  • Semi-partitioning under a Blocking-Aware Task Allocation
  • 2015
  • Ingår i: Proceedings - Real-Time Systems Symposium. - 9781467395076 ; , s. 379-379
  • Konferensbidrag (refereegranskat)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.
  •  
38.
  • Afshar, Sara, et al. (författare)
  • Towards Resource Sharing under Multiprocessor Semi-Partitioned Scheduling
  • 2012
  • Ingår i: 7th IEEE International Symposium on Industrial Embedded Systems (SIES'12). - : IEEE. - 9781467326834 - 9781467326858 ; , s. 315-318
  • Konferensbidrag (refereegranskat)abstract
    • Semi-partitioned scheduling has been the subject of recent interest, compared with conventional global and partitioned scheduling algorithms for multiprocessors, due to better utilization results. In semi-partitioned scheduling most tasks are assigned to fixed processors while a low number of tasks are split up and allocated to different processors. Various techniques have recently been proposed to assign tasks in a semi-partitioned environment. However, an appropriate resource sharing mechanism for handling the resource requests between tasks in semi-partitioned scheduling has not yet been investigated. In this paper we propose two methods for handling resource sharing under semi-partitioned scheduling in multiprocessor platforms. The main challenge is to handle the resource requests of tasks that are split over multiple processors.
  •  
39.
  • Afshar, Sara Zargari, et al. (författare)
  • An optimal spin-lock priority assignment algorithm for real-time multi-core systems
  • 2017
  • Ingår i: The 23th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications RTCSA'17.
  • Konferensbidrag (refereegranskat)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.
  •  
40.
  • Al-Dulaimy, Auday, et al. (författare)
  • Fault Tolerance in Cloud Manufacturing : An Overview
  • 2023
  • Ingår i: 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
  • Konferensbidrag (refereegranskat)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.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 31-40 av 411
Typ av publikation
konferensbidrag (269)
tidskriftsartikel (81)
licentiatavhandling (19)
rapport (16)
doktorsavhandling (12)
bokkapitel (8)
visa fler...
annan publikation (3)
bok (1)
proceedings (redaktörskap) (1)
forskningsöversikt (1)
visa färre...
Typ av innehåll
refereegranskat (351)
övrigt vetenskapligt/konstnärligt (60)
Författare/redaktör
Nolte, Thomas (346)
Behnam, Moris (129)
Mubeen, Saad (32)
Almeida, Luis (30)
Papadopoulos, Alessa ... (30)
Sjödin, Mikael (29)
visa fler...
Åsberg, Mikael (26)
Liu, Meng (25)
Papadopoulos, Alessa ... (23)
Ashjaei, Mohammad (22)
Becker, Matthias (22)
Behnam, Moris, 1973- (21)
Gieger, Christian (20)
van der Harst, Pim (19)
Loos, Ruth J F (18)
Boerwinkle, Eric (18)
Norström, Christer (17)
Chasman, Daniel I. (16)
van Duijn, Cornelia ... (16)
Pedreiras, Paulo (16)
Uitterlinden, André ... (16)
Hayward, Caroline (16)
Feitosa, Mary F. (16)
Rudan, Igor (15)
Wareham, Nicholas J. (15)
Ridker, Paul M. (15)
Metspalu, Andres (15)
Sandström, Kristian (15)
Harris, Tamara B (15)
Kleber, Marcus E. (15)
Shin, Insik (15)
Hansson, Hans (14)
Nemati, Farhang, Sen ... (14)
Munroe, Patricia B. (14)
Gudnason, Vilmundur (14)
Esko, Tõnu (14)
Vollenweider, Peter (14)
Lind, Lars (13)
Campbell, Harry (13)
Afshar, Sara (13)
Nolte, Thomas, Profe ... (13)
J. Bril, Reinder (13)
Kuusisto, Johanna (13)
Laakso, Markku (13)
Boehnke, Michael (13)
Verweij, Niek (13)
Strauch, Konstantin (13)
Froguel, Philippe (13)
Wilson, James F. (13)
van der Most, Peter ... (13)
visa färre...
Lärosäte
Mälardalens universitet (355)
Lunds universitet (22)
Örebro universitet (20)
Kungliga Tekniska Högskolan (14)
Uppsala universitet (14)
Karolinska Institutet (14)
visa fler...
RISE (13)
Göteborgs universitet (10)
Umeå universitet (9)
Högskolan Dalarna (3)
Högskolan i Halmstad (2)
Linköpings universitet (2)
Mittuniversitetet (2)
Stockholms universitet (1)
Chalmers tekniska högskola (1)
Karlstads universitet (1)
Blekinge Tekniska Högskola (1)
Sveriges Lantbruksuniversitet (1)
visa färre...
Språk
Engelska (411)
Forskningsämne (UKÄ/SCB)
Teknik (177)
Naturvetenskap (104)
Medicin och hälsovetenskap (35)

Å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