A survey of hard real-time scheduling for multiprocessor systems
This survey covers hard real-time scheduling algorithms and schedulability analysis
techniques for homogeneous multiprocessor systems. It reviews the key results in this field …
techniques for homogeneous multiprocessor systems. It reviews the key results in this field …
A first estimation of the proportion of cybercriminal entities in the bitcoin ecosystem using supervised machine learning
HS Yin, R Vatrapu - 2017 IEEE international conference on big …, 2017 - ieeexplore.ieee.org
Bitcoin, a peer-to-peer payment system and digital currency, is often involved in illicit
activities such as scamming, ransomware attacks, illegal goods trading, and thievery. At the …
activities such as scamming, ransomware attacks, illegal goods trading, and thievery. At the …
Improved schedulability analysis of EDF on multiprocessor platforms
Multiprocessor hardware platforms are now being considered for embedded systems, due to
their high computational power and little additional cost when compared to single processor …
their high computational power and little additional cost when compared to single processor …
On spin locks in AUTOSAR: Blocking analysis of FIFO, unordered, and priority-ordered spin locks
A Wieder, BB Brandenburg - 2013 IEEE 34th Real-Time …, 2013 - ieeexplore.ieee.org
Motivated by the widespread use of spin locks in embedded multiprocessor real-time
systems, the worst-case blocking in spin locks is analyzed using mixed-integer linear …
systems, the worst-case blocking in spin locks is analyzed using mixed-integer linear …
The limited-preemption uniprocessor scheduling of sporadic task systems
S Baruah - 17th euromicro conference on real-time systems …, 2005 - ieeexplore.ieee.org
Although preemptive uniprocessor scheduling algorithms are able to successfully schedule
some systems that cannot be scheduled by any non-preemptive scheduling algorithm, the …
some systems that cannot be scheduled by any non-preemptive scheduling algorithm, the …
Processor pipelines and static worst-case execution time analysis
J Engblom - 2002 - diva-portal.org
ABSTRACT Engblom, J. 2002: Processor Pipelines and Static Worst-Case Execution Time
Analysis. Acta Universitatis Upsaliensis. Uppsala dissertations from the Faculty of Science …
Analysis. Acta Universitatis Upsaliensis. Uppsala dissertations from the Faculty of Science …
A schedulability compatible multiprocessor resource sharing protocol--MrsP
Lock-based resource sharing protocols for single processor systems are well understood
and supported in programming languages and in Real-Time Operating Systems. In contrast …
and supported in programming languages and in Real-Time Operating Systems. In contrast …
Partitioned scheduling with shared resources on imprecise mixed-criticality multiprocessor systems
Both resource access protocols and real-time scheduling algorithms have been extensively
studied in classic embedded real-time systems. However, there has been relatively little …
studied in classic embedded real-time systems. However, there has been relatively little …
An extensible framework for multicore response time analysis
In this paper, we introduce a multicore response time analysis (MRTA) framework, which
decouples response time analysis from a reliance on context-independent WCET values …
decouples response time analysis from a reliance on context-independent WCET values …
Resource sharing in global fixed-priority preemptive multiprocessor scheduling
In this paper we consider global fixed-priority preemptive multiprocessor scheduling of
constrained-deadline sporadic tasks that share resources in a non-nested manner. We …
constrained-deadline sporadic tasks that share resources in a non-nested manner. We …