Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
16,181
Online Hard Real-Time Scheduling for Hypercube Multiprocessors
, 1993
"... Scheduling sporadic tasks is a formidable problem in hard real-time systems, particularly multiprocessor systems. Until now little research has addressed this problem for hypercube multiprocessors. In this paper we study two online scheduling algorithms - Buddy/RT and Stacking, for hard real-time ..."
Abstract
- Add to MetaCart
Scheduling sporadic tasks is a formidable problem in hard real-time systems, particularly multiprocessor systems. Until now little research has addressed this problem for hypercube multiprocessors. In this paper we study two online scheduling algorithms - Buddy/RT and Stacking, for hard real-time
Focusing on Some (Hard) Real-Time Scheduling Algorithms
, 1993
"... this paper we will consider a general classification based on the specification of the assumptions made for each algorithm. The characteristics considered are shown in figure 1. In particular, we will consider static a scheduling algorithm that generates the schedule in advance before the system is ..."
Abstract
- Add to MetaCart
is run or that at least has its parameters fixed in advance, so that it will have a behaviour known a priori (e.g. it uses fixed priorities). In all other cases we will have a dynamic algorithm. - 2 - Static Real-Time Scheduling Dynamic Preemptive Non-Preemptive Shared Resources No Shared Resources
A survey of hard real-time scheduling for multiprocessor systems
- ACM COMPUTING SURVEYS
, 2011
"... This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960s to the latest research published in late 2009. The survey outlines fundamental results ab ..."
Abstract
-
Cited by 99 (9 self)
- Add to MetaCart
This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960s to the latest research published in late 2009. The survey outlines fundamental results
Hard-real-time scheduling of data-dependent tasks in embedded streaming applications
- in Proceedings of the 9th ACM International Conference on Embedded Software, ser. EMSOFT ’11
"... Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to modern embedded streaming applications. This is because a modern streaming appli-cation is typically modeled as a directed gr ..."
Abstract
-
Cited by 9 (4 self)
- Add to MetaCart
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to modern embedded streaming applications. This is because a modern streaming appli-cation is typically modeled as a directed
A Weakly Hard Real-Time Schedule Algorithm Based on Cutting Down
"... Abstract: Existing weakly hard real-time scheduling algorithms can not guarantee the meeting ratio of executing sequence of which the length islarger than fixed window-size. Therefore, this paper, based on the), ( pm constraint, proposes an algorithm which is named as CDBS (cut-down based schedulin ..."
Abstract
- Add to MetaCart
Abstract: Existing weakly hard real-time scheduling algorithms can not guarantee the meeting ratio of executing sequence of which the length islarger than fixed window-size. Therefore, this paper, based on the), ( pm constraint, proposes an algorithm which is named as CDBS (cut-down based
Survey of Weakly-Hard Real Time Schedule Theory and Its Application
- In Proc. International Symposium on Distributed Computing and Applications to Business. Engineering and Science (DCABES
, 2002
"... Normally, tasks are classified into real time and non real time according to temporal constraints for the processing and transmitting of these tasks, consequently the worst-case response time and average performance should be focused on them. However, in practical engineering context, partly violate ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
extent, it can't include the permitted distribution of violation. For completely solving the problem, weakly-hard real time schedule theory or window-constraint real time schedule theory, which is used to investigate the problem related to allowing violation of instances over a finite range
Managing latency in embedded streaming applications under hard-real-time scheduling
- In Proceedings of the 8th IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis
, 2012
"... In this paper, we consider the problem of hard-real-time scheduling of embedded streaming applications, modeled us-ing dataflow graphs, while minimizing the application la-tency. Recently, it has been shown that the actors in an acyclic Cyclo-Static Dataflow (CSDF) graph can be sched-uled as a set o ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
In this paper, we consider the problem of hard-real-time scheduling of embedded streaming applications, modeled us-ing dataflow graphs, while minimizing the application la-tency. Recently, it has been shown that the actors in an acyclic Cyclo-Static Dataflow (CSDF) graph can be sched-uled as a set
A Survey of Hard Real-Time Scheduling Algorithms and Schedulability Analysis Techniques 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 from its origins in the late 1960’s to the latest research published in late 2009. The survey outlines fundamental results a ..."
Abstract
-
Cited by 28 (1 self)
- Add to MetaCart
This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960’s to the latest research published in late 2009. The survey outlines fundamental results
Semi-partitioned hard real-time scheduling with restricted migrations upon identical multiprocessor platforms
- Cornell University Library Archives
, 2010
"... Algorithms based on semi-partitioned scheduling have been proposed as a viable alternative between the two extreme ones based on global and partitioned scheduling. In particular, allowing migration to occur only for few tasks which cannot be assigned to any individual processor, while most tasks are ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
of hard real-time systems composed of sporadic constrained-deadline tasks upon identical multiprocessor platforms. We propose a new algorithm and a schedul-ing paradigm based on the concept of semi-partitioned scheduling with restricted migrations in which jobs are not allowed to migrate, but two
Hard Real-Time Scheduling for Low-Energy Using Stochastic Data and DVS Processors
"... The work presented in this paper addresses scheduling for reduced energy of hard real-time tasks with fixed priorities assigned in a rate monotonic or deadline monotonic manner. The approach we describe can be exclusively implemented in the RTOS. It targets energy consumption reduction by using both ..."
Abstract
- Add to MetaCart
The work presented in this paper addresses scheduling for reduced energy of hard real-time tasks with fixed priorities assigned in a rate monotonic or deadline monotonic manner. The approach we describe can be exclusively implemented in the RTOS. It targets energy consumption reduction by using
Results 1 - 10
of
16,181
