Partitioning Based Scheduling of OpenMP Task Systems with Tied Tasks

Author(s):  
Yang Wang ◽  
Xu Jiang ◽  
Nan Guan ◽  
Zhishan Guo ◽  
Xue Liu ◽  
...  
Keyword(s):  
2007 ◽  
Vol 104 (4) ◽  
pp. 123-128 ◽  
Author(s):  
Wolfgang Bein ◽  
Lawrence L. Larmore ◽  
John Noga

Algorithmica ◽  
2011 ◽  
Vol 63 (4) ◽  
pp. 763-780 ◽  
Author(s):  
Vincenzo Bonifaci ◽  
Alberto Marchetti-Spaccamela

Author(s):  
Manfred Borovcnik

Elementarisation is a legitimate didactical strategy, especially in a subject area such as inferential statistics, which is considered to be extremely difficult. Here one can also refer to Varga’s position on the didactics of mathematics and examine, which orientation results from it. For this purpose, Varga’s approach to mathematics didactics as a whole is summarised, which can best be characterised by the term complexity. Varga tries to make the complexity teachable by presenting suitable task systems and developing comprehensive handouts for guided-discovery learning. The core of the presentation is a system of tasks by Varga for inferential statistics for primary school, which Varga also supplements by comments on an experimental class for nine-year-olds (!). Varga introduces heuristically and playfully to the significance test and to p values. Finally, we discuss how to continue the learning paths from these heuristic considerations to the full field of inferential statistics. Classification: K10, K70, K50, D20. Keywords: Stochastic teaching, elementarisation, task systems, Statistical inference, Bayes inference, Varga’s approach.


2012 ◽  
Vol 1 (4) ◽  
pp. 88-131 ◽  
Author(s):  
Hamza Gharsellaoui ◽  
Mohamed Khalgui ◽  
Samir Ben Ahmed

Scheduling tasks is an essential requirement in most real-time and embedded systems, but leads to unwanted central processing unit (CPU) overheads. The authors present a real-time schedulability algorithm for preemptable, asynchronous and periodic reconfigurable task systems with arbitrary relative deadlines, scheduled on a uniprocessor by an optimal scheduling algorithm based on the earliest deadline first (EDF) principles and on the dynamic reconfiguration. A reconfiguration scenario is assumed to be a dynamic automatic operation allowing addition, removal or update of operating system’s (OS) functional asynchronous tasks. When such a scenario is applied to save the system at the occurrence of hardware-software faults, or to improve its performance, some real-time properties can be violated. The authors propose an intelligent agent-based architecture where a software agent is used to satisfy the user requirements and to respect time constraints. The agent dynamically provides precious technical solutions for users when these constraints are not verified, by removing tasks according to predefined heuristic, or by modifying the worst case execution times (WCETs), periods, and deadlines of tasks in order to meet deadlines and to minimize their response time. They implement the agent to support these services which are applied to a Blackberry Bold 9700 and to a Volvo system and present and discuss the results of experiments.


Sign in / Sign up

Export Citation Format

Share Document