D
David Ferry
Researcher at Washington University in St. Louis
Publications - 11
Citations - 1624
David Ferry is an academic researcher from Washington University in St. Louis. The author has contributed to research in topics: Scheduling (computing) & Myocardial infarction. The author has an hindex of 10, co-authored 11 publications receiving 1547 citations.
Papers
More filters
Journal ArticleDOI
Outcomes in patients with acute non-Q-wave myocardial infarction randomly assigned to an invasive as compared with a conservative management strategy. Veterans Affairs Non-Q-Wave Infarction Strategies in Hospital (VANQWISH) Trial Investigators
William E. Boden,Robert A. O'Rourke,Michael H. Crawford,Alvin Blaustein,Prakash Deedwania,Robert G. Zoble,Laura F. Wexler,Robert E. Kleiger,Carl J. Pepine,David Ferry,Bruce K. Chow,Philip W. Lavori +11 more
TL;DR: Patients assigned to the invasive strategy had worse clinical outcomes during the first year of follow-up, and patients assigned to a conservative strategy had better clinical outcomes During an average follow- up of 23 months.
Journal ArticleDOI
Outcomes in Patients with Acute Non-Q-Wave Myocardial Infarction Randomly Assigned to an Invasive as Compared with a Conservative Management Strategy
William E. Boden,Robert A. OʼROURKE,Michael H. Crawford,Alvin Blaustein,Prakash Deedwania,Robert G. Zoble,Laura F. Wexler,Robert E. Kleiger,Carl J. Pepine,David Ferry,Bruce K. Chow +10 more
TL;DR: Most patients with non-Q-wave myocardial infarction do not benefit from routine, early invasive management consisting of coronary angiography and revascularization, and a conservative, ischemia-guided initial approach is both safe and effective.
Journal ArticleDOI
Parallel Real-Time Scheduling of DAGs
TL;DR: This paper addresses the problem of realtime scheduling for a general model of deterministic parallel tasks, where each task is represented as a directed acyclic graph (DAG) with nodes having arbitrary execution requirements, and proves processor-speed augmentation bounds for both preemptive and nonpreemptive real- time scheduling for general DAG tasks on multi-core processors.
Proceedings ArticleDOI
A real-time scheduling service for parallel tasks
TL;DR: This work describes the design and implementation of a scheduler and runtime dispatcher for a new concurrency platform, RT-OpenMP, whose goal is the execution of real-time workloads with intra-task parallelism.
Journal ArticleDOI
Mixed-criticality federated scheduling for parallel real-time tasks
TL;DR: This paper proposes a novel mixed-criticality federated scheduling (MCFS) algorithm for parallel tasks modeled by a directed acyclic graph based on federated intuition for scheduling parallel real-time tasks and presents an implementation of a MCFS runtime system in Linux that supports parallel programs written in OpenMP.