Learn More
This thesis deals with the problem of scheduling a set of tasks to meet deadlines on a computer with multiple processors. Static-priority scheduling is considered, that is, a task is assigned a priority number that never changes and at every moment the highestpriority tasks that request to be executed are selected for execution. The performance metric used(More)
While the real-time systems community has developed very valuable approaches to timing and scheduling analysis for processors and buses over the last four decades, another very relevant issue has received only limited attention: end-to-end timing. Most of the known work poses restrictions on specific task activation and communication mechanisms, e.g.(More)
Traditional multiprocessor real-time scheduling partitions a task set and applies uniprocessor scheduling on each processor. By allowing a task to resume on another processor than the task was preempted on, some task sets can be scheduled where the partitioned method fails. We address fixed-priority preemptive scheduling of periodically arriving tasks on m(More)
Both longitudinal and cross-sectional analyses on a large and recent Swedish data set demonstrate that, compared to children in intact families, children who have experienced family dissolution or reconstitution show lower educational attainment at age 16. Time constraints do not seem to be an important mechanism behind the negative effect of separation.(More)
In the sociological literature on social mobility, the long-standing convention has been to assume that intergenerational reproduction takes one of two forms: a categorical form that has parents passing on a big-class position to their children or a gradational form that has parents passing on their socioeconomic standing. These approaches ignore in their(More)
Real-time scheduling theory has developed powerful tools for translating conditions on aggregate system utilization into per-task schedulability guarantees. The main breakthrough has been Liu and Layland’s utilization bound for schedulability of periodic tasks. In 2001 this bound was generalized by Abdelzaher and Lu to the aperiodic task case. In this(More)
In this paper we present work that deals with the problem of mapping datajow graphs onto multiprocessor systems with regular or irregular topologies in such a way that the following goals are achieved (in order of priority): deterministic latency and throughput, maximum throughput, and minimum latency. A practical method which takes resource contention into(More)