4,308 research outputs found
[Letter from Mendel N. Fisher to Max H. Nathan - January 7, 1937]
No full textLetter from Mendel N. Fisher to Max H. Nathan discussing United Palestine Appeal joining the Jewish Community Council of Metropolita
Dr. Nathan Nobis, Morehouse College, August 2011
No full textThis video is a conversation with Dr. Nathan Nobis. Dr. Nobis talks about his paper, "The Harmful, Nontherapeutic use of Animals in Research is Morally Wrong." Brad Ost, AUC Woodruff Library, is the interviewer
Power-Aware Real-Time Scheduling: Models, Open Problems, and Practical Considerations
No full textPower-related issues have received considerable research attention from the real-time community in the past decade. In our talk, we introduce a recent model and set of assumptions made in the recent real-time literature on energy and thermal issues; suggest two high-level open problems for power-aware real-time scheduling: {em peak-temperature minimization} and {em energy-minimization with temperature as a constraint}; and discuss practical considerations that should be considered in proposed solutions
L'Éducation Montessori, par Mme Fisher. Paris, Nathan, éditeur
No full textL'Éducation Montessori, par Mme Fisher. Paris, Nathan, éditeur. In: La revue pédagogique, tome 70, Janvier-Juin 1917. pp. 227-228
L'Éducation Montessori, par Mme Fisher. Paris, Nathan, éditeur
No full textL'Éducation Montessori, par Mme Fisher. Paris, Nathan, éditeur. In: La revue pédagogique, tome 70, Janvier-Juin 1917. pp. 227-228
The Explicit Preemption Placement Problem for Real-Time Conditional Code
No full textIn this abstract, we propose specific open problems towardsextending the EPP approach of Bertogna et al. for handlinggeneral conditional code. Furthermore, our objective is toobtain a solution that retains the efficient running time of thenon-branching version of the problem. We believe that suchextensions are absolutely necessary for the EPP approach tobe widely applicable and useful to a real-time system designer
Fisher and Friends
No full textAbstract
What do famous statisticians really get up to at conferences? The answer, it seems, is crosswords, exchanging bedrooms and holding up mice. Nathan Keyfitz offers a rare glimpse of R. A. Fisher and company at what could loosely be described as work.</jats:p
Letter from Nathan Bankhead, Bankhead and Henderson, to Carl Hayden
No full textLetter from Nathan Bankhead to Carl Hayden concerning his sheep and the accusations of Horace M. Albright
NPM-BUNDLE: Non-Preemptive Multitask Scheduling for Jobs with BUNDLE-Based Thread-Level Scheduling
No full textThe BUNDLE and BUNDLEP scheduling algorithms are cache-cognizant thread-level scheduling algorithms and associated worst case execution time and cache overhead (WCETO) techniques for hard real-time multi-threaded tasks. The BUNDLE-based approaches utilize the inter-thread cache benefit to reduce WCETO values for jobs. Currently, the BUNDLE-based approaches are limited to scheduling a single task. This work aims to expand the applicability of BUNDLE-based scheduling to multiple task multi-threaded task sets.
BUNDLE-based scheduling leverages knowledge of potential cache conflicts to selectively preempt one thread in favor of another from the same job. This thread-level preemption is a requirement for the run-time behavior and WCETO calculation to receive the benefit of BUNDLE-based approaches. This work proposes scheduling BUNDLE-based jobs non-preemptively according to the earliest deadline first (EDF) policy. Jobs are forbidden from preempting one another, while threads within a job are allowed to preempt other threads.
An accompanying schedulability test is provided, named Threads Per Job (TPJ). TPJ is a novel schedulability test, input is a task set specification which may be transformed (under certain restrictions); dividing threads among tasks in an effort to find a feasible task set. Enhanced by the flexibility to transform task sets and taking advantage of the inter-thread cache benefit, the evaluation shows TPJ scheduling task sets fully preemptive EDF cannot
- …
