Analysis of Dependence Tracking Algorithms for Task Dataflow Execution

Processor architectures has taken a turn towards many-core processors, which integrate multiple processing cores on a single chip to increase overall performance, and there are no signs that this trend will stop in the near future. Many-core processors are harder to program than multi-core and single-core processors due to the need of writing parallel or concurrent programs with high degrees of parallelism. Moreover, many-cores have to operate in a mode of strong scaling because of memory bandwidth constraints. In strong scaling increasingly finer-grain parallelism must be extracted in order to keep all processing cores busy.

Task dataflow programming models have a high potential to simplify parallel program- ming because they alleviate the programmer from identifying precisely all inter-task de- pendences when writing programs. Instead, the task dataflow runtime system detects and enforces inter-task dependences during execution based on the description of memory each task accesses. The runtime constructs a task dataflow graph that captures all tasks and their dependences. Tasks are scheduled to execute in parallel taking into account dependences specified in the task graph.

Several papers report important overheads for task dataflow systems, which severely limits the scalability and usability of such systems. In this paper we study efficient schemes to manage task graphs and analyze their scalability. We assume a programming model that supports input, output and in/out annotations on task arguments, as well as commutative in/out and reductions. We analyze the structure of task graphs and identify versions and generations as key concepts for efficient management of task graphs. Then, we present three schemes to manage task graphs building on graph representations, hypergraphs and lists. We also consider a fourth edge-less scheme that synchronizes tasks using integers. Analysis using micro-benchmarks shows that the graph representation is not always scalable and that the edge-less scheme introduces least overhead in nearly all situations.

Practical aspects of slot-based task- splitting dispatching in its schedulability analysis

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a tasksplitting scheduling algorithm. Task-splitting (also called semipartitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A certain type of task-splitting algorithms, called slot-based task-splitting, is of particular interest because of its ability to schedule tasks at high processor utilizations. We present a new schedulability analysis for slot-based task-splitting scheduling algorithms that takes the overhead into account and also a new task assignment algorithm.

Unified overhead-aware schedulability analysis for slot-based task-splitting

Hard real- time multiprocessor scheduling has seen, in recent years, the flourishing of semi-partitioned scheduling algorithms. This category of scheduling schemes combines elements of partitioned and global scheduling for the purposes of achieving efficient utilization of the system’s processing resources with strong schedulability guarantees and with low dispatching overheads. The sub-class of slot-based “task-splitting” scheduling algorithms, in particular, offers very good trade-offs between schedulability guarantees (in the form of high utilization bounds) and the number of preemptions/migrations involved. However, so far there did not exist unified scheduling theory for such algorithms; each one was formulated in its own accompanying analysis. This article changes this fragmented landscape by formulating a more unified schedulability theory covering the two state-of-the-art slot-based semi-partitioned algorithms, S-EKG and NPS-F (both fixed job-priority based). This new theory is based on exact schedulability tests, thus also overcoming many sources of pessimism in existing analysis. In turn, since schedulability testing guides the task assignment under the schemes in consideration, we also formulate an improved task assignment procedure. As the other main contribution of this article, and as a response to the fact that many unrealistic assumptions, present in the original theory, tend to undermine the theoretical potential of such scheduling schemes, we identified and modelled into the new analysis all overheads incurred by the algorithms in consideration. The outcome is a new overhead-aware schedulability analysis that permits increased efficiency and reliability. The merits of this new theory are evaluated by an extensive set of experiments.

Nietzsche's children : a physiological analysis of the scholar's task

Throughout Nietzsche's writings we find discussions of the proper relationship of the scholar/scientist to the philosopher, wi th the scholar of ten being presented in a derogatory light. In this thesis, I examine Nietzsche's por t rai t of the scholar through the lens of his physiological or clinical perspective as articulated by Dr. Daniel R. Ahern in his monograph entitled Nietzsche as Cultural Physician. My aim in doing so is to grasp the affirmative, creative aspect of this seemingly destructive polemic against scholars. I begin wi th a detailed discussion of Nietzsche's por t rai t of the scholar in Beyond Good and Evil. This includes an explication of Ahern's position, followed by an application of the diagnostic perspective to Nietzsche's discussion of the objective type, the skeptic, and the critic. I then look at how the characteristics of all three types are present in the Nietzschean 'free spirit.' I also discuss the physiological basis of esotericism in Nietzsche's work, as well as Nietzsche's revaluation of the scholarly vi r tue known as Red/ichkeit (or 'honesty'). I conclude wi th comments on the free spirit's relationship to the future.

Quantitative analysis of research mediums' consious experiences during a discarnate reading versus a control task : a pilot study

Mediums claim to be able to report accurate and specific information about the deceased loved ones (termed discarnates) of living people (termed sitters) even without any prior knowledge about the sitters or the discarnates and in the complete absence of any sensory feedback. Despite recent proof-focused experimental research investigating this phenomenon (e.g., Beischel & Schwartz, 2007), no published studies have attempted to quantify the phenomenological effects of discarnate readings. The aim of the present study was, thus, to investigate experimentally the phenomenological differences that arose psychologically in accordance with the demands of a discarnate reading task versus a control task. Seven mediums were administered counter-balanced sequences of a discarnate reading and control condition. The discarnate reading condition consisted of a phone reading including questions about a discarnate where only a blinded medium and a blinded experimenter were on the phone. The control condition consisted of a phone conversation between the medium and the same experimenter in which the medium was asked similar questions regarding a living person s/he (i.e., the medium) knew. Mediums’ phenomenology during each condition was retrospectively assessed using the Phenomenology of Consciousness Inventory (PCI). Phenomenology associated with the discarnate reading condition appeared to be significantly different from phenomenology associated with the control condition. Future research might use the PCI to address whether the phenomenology reported by mediums during discarnate readings is quantitatively different from their experiences during psychic telepathy readings for the living.

Procedural learning deficits in specific language impairment (SLI): a meta-analysis of serial reaction time task performance

Meta-analysis and meta-regression were used to evaluate whether evidence to date demonstrates deficits in procedural memory in individuals with specific language impairment (SLI), and to examine reasons for inconsistencies of findings across studies. The Procedural Deficit Hypothesis (PDH) proposes that SLI is largely explained by abnormal functioning of the frontal-basal ganglia circuits that support procedural memory. It has also been suggested that declarative memory can compensate for at least some of the problems observed in individuals with SLI. A number of studies have used Serial Reaction Time (SRT) tasks to investigate procedural learning in SLI. In this report, results from eight studies that collectively examined 186 participants with SLI and 203 typically-developing peers were submitted to a meta-analysis. The average mean effect size was .328 (CI95: .071, .584) and was significant. This suggests SLI is associated with impairments of procedural learning as measured by the SRT task. Differences among individual study effect sizes, examined with meta-regression, indicated that smaller effect sizes were found in studies with older participants, and in studies that had a larger number of trials on the SRT task. The contributions of age and SRT task characteristics to learning are discussed with respect to impaired and compensatory neural mechanisms in SLI.

Analysis of slow- and fast-alpha band asymmetry during performance of a saccadic eye movement task: Dissociation between memory- and attention-driven systems

This study aimed at analyzing the relationship between slow- and fast-alpha asymmetry within frontal cortex and the planning, execution and voluntary control of saccadic eye movements (SEM), and quantitative electroencephalography (qEEG) was recorded using a 20-channel EEG system in 12 healthy participants performing a fixed (i.e., memory-driven) and a random SEM (i.e., stimulus-driven) condition. We find main effects for SEM condition in slow- and fast-alpha asymmetry at electrodes F3-F4, which are located over premotor cortex, specifically a negative asymmetry between conditions. When analyzing electrodes F7-F8, which are located over prefrontal cortex, we found a main effect for condition in slow-alpha asymmetry, particularly a positive asymmetry between conditions. In conclusion, the present approach supports the association of slow- and fast-alpha bands with the planning and preparation of SEM, and the specific role of these sub-bands for both, the attention network and the coordination and integration of sensory information with a (oculo)-motor response. (C) 2011 Elsevier B.V. All rights reserved.

Analysis of eye and head coordination in a visual peripheral recognition task

Coordinated eye and head movements simultaneously occur to scan the visual world for relevant targets. However, measuring both eye and head movements in experiments allowing natural head movements may be challenging. This paper provides an approach to study eye-head coordination: First, we demonstra- te the capabilities and limits of the eye-head tracking system used, and compare it to other technologies. Second, a beha- vioral task is introduced to invoke eye-head coordination. Third, a method is introduced to reconstruct signal loss in video- based oculography caused by cornea reflection artifacts in order to extend the tracking range. Finally, parameters of eye- head coordination are identified using EHCA (eye-head co- ordination analyzer), a MATLAB software which was developed to analyze eye-head shifts. To demonstrate the capabilities of the approach, a study with 11 healthy subjects was performed to investigate motion behavior. The approach presented here is discussed as an instrument to explore eye-head coordination, which may lead to further insights into attentional and motor symptoms of certain neurological or psychiatric diseases, e.g., schizophrenia.

Task granularity analysis in logic programs

While logic programming languages offer a great deal of scope for parallelism, there is usually some overhead associated with the execution of goals in parallel because of the work involved in task creation and scheduling. In practice, therefore, the "granularity" of a goal, i.e. an estimate of the work available under it, should be taken into account when deciding whether or not to execute a goal concurrently as a sepárate task. This paper describes a method for estimating the granularity of a goal at compile time. The runtime overhead associated with our approach is usually quite small, and the performance improvements resulting from the incorporation of grainsize control can be quite good. This is shown by means of experimental results.

DAEDALUS at SemEval-2014 Task 9: Comparing approaches for sentiment analysis in twitter

This paper describes our participation at SemEval- 2014 sentiment analysis task, in both contextual and message polarity classification. Our idea was to com- pare two different techniques for sentiment analysis. First, a machine learning classifier specifically built for the task using the provided training corpus. On the other hand, a lexicon-based approach using natural language processing techniques, developed for a ge- neric sentiment analysis task with no adaptation to the provided training corpus. Results, though far from the best runs, prove that the generic model is more robust as it achieves a more balanced evaluation for message polarity along the different test sets.

Improved commercial vehicle conspicuity and signalling systems. Task I: accident analysis and functional requirements. Interim report.

National Highway Traffic Safety Administration, Washington, D.C.

Automatic audio signing - literature survey analysis. Interim report, phase 1, task A.

Federal Highway Administration, Washington, D.C.