Learn More
This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept of semi-partitioned scheduling, in which most tasks are fixed to specific processors, while a few tasks migrate across processors. Particularly, we design the algorithm so that(More)
Trisomy 21 results in Down's syndrome, but little is known about how a 1.5-fold increase in gene dosage produces the pleiotropic phenotypes of Down's syndrome. Here we report that two genes, DSCR1 and DYRK1A , lie within the critical region of human chromosome 21 and act synergistically to prevent nuclear occupancy of NFATc transcription factors, which are(More)
Elucidating the neural and genetic factors underlying psychiatric illness is hampered by current methods of clinical diagnosis. The identification and investigation of clinical endophenotypes may be one solution, but represents a considerable challenge in human subjects. Here we report that mice heterozygous for a null mutation of the alpha-isoform of(More)
Serotonergic antidepressant drugs have been commonly used to treat mood and anxiety disorders, and increasing evidence suggests potential use of these drugs beyond current antidepressant therapeutics. Facilitation of adult neurogenesis in the hippocampal dentate gyrus has been suggested to be a candidate mechanism of action of antidepressant drugs, but this(More)
This paper presents real-time scheduling techniques for reducing the response time of aperiodic tasks scheduled with real-time periodic tasks on multiprocessor systems. Two problems are addressed in this paper: (i) the scheduling of aperiodic tasks that can be dispatched to any processors when they arrive, and (ii) the scheduling of aperi-odic tasks that(More)
A semi-partitioning technique is presented for efficient scheduling of sporadic task systems on multiprocessors. The presented technique performs in the same manner as the traditional partitioning, as long as tasks are successfully partitioned, but a task is allowed to be shared among multiple processors for its execution, if a spare capacity of every(More)
In this paper, we consider a multicore real-time scheduling algorithm incorporating benefits of both fixed-priority and dynamic-priority disciplines. Specifically, the algorithm first assigns globally-effective priorities to real-time tasks statically, based on the well-known Rate-Monotonic scheduling policy. It may however change the task priorities at(More)