scispace - formally typeset
Search or ask a question
Author

James H. Anderson

Bio: James H. Anderson is an academic researcher from University of North Carolina at Chapel Hill. The author has contributed to research in topics: Scheduling (computing) & Multiprocessor scheduling. The author has an hindex of 59, co-authored 267 publications receiving 11790 citations. Previous affiliations of James H. Anderson include University of Maryland, College Park & University of North Carolina at Charlotte.


Papers
More filters
Book
27 Apr 2004
TL;DR: This book discusses Real-Time Scheduling Problems, Scheduling Models, Stochastic Scheduling, and Online Deterministic Scheduling as well as some basic Scheduling Algorithms and Complexity.
Abstract: Introduction Introduction and Notation, Joseph Y-T. Leung A Tutorial on Complexity, Joseph Y-T. Leung Some Basic Scheduling Algorithms, Joseph Y-T. Leung Classical Scheduling Problems Elimination Rules for Job-shop Scheduling Problem: Overview and Extensions, Jacques Carlier, Laurent Peridy, Eric Pinson, and David Rivreau Flexible Hybrid Flowshops, George Vairaktarakis Open Shop Scheduling, Teofilo F. Gonzalez Cycle Shop Scheduling, Vadim G. Timkovsky Reducibility among Scheduling Classes, Vadim G. Timkovsky Parallel Scheduling for Early Completion, Bo Chen Minimizing the Maximum Lateness, Hans Kellerer Approximation Algorithms for Minimizing Average Weighted Completion Time, Chandra Chekuri and Sanjeev Khanna Minimizing the Number of Tardy Jobs, Marjan van den Akker and Han Hoogeveen Branch-and-Bound Algorithms for Total Weighted Tardiness, Antoino Jouglet, Philippe Baptiste, and Jacques Carlier Scheduling Equal Processing Time Jobs, Philippe Baptiste and Peter Brucker Online Scheduling, Kirk Pruhs, Jiri Sgall, and Eric Torng Convex Quadratic Relaxations in Scheduling, Jay Sethuraman Other Scheduling Models The Master/Slave Scheduling Model, Sartaj Sahni and George Vairaktarakis Scheduling in Bluetooth Networks, Yong Man Kim and Ten H. Lai Fair Sequences, Wieslaw Kubiak Due-Date Quotation Models and Algorithms, Philip Kaminsky and Dorit Hochbaum Scheduling with Due-Date Assignment, Valery S. Gordon, Jean-Marie Proth, and Vitaly A. Strusevich Machine Scheduling with Availability Constraints, Chung-Yee Lee Scheduling with Discrete Resource Constraints, J. B_lazewicz, N. Brauner, and G. Finke Scheduling with Resource Constraints-Continuous Resources, Joanna J'ozefowska and Jan Weglarz Scheduling Parallel Tasks-Algorithms and Complexity, M. Drozdowski Scheduling Parallel Tasks Approximation Algorithms, Pierre-Franc' ois Dutot, Gr'egory Mouni'e, and Denis Trystram Real-Time Scheduling The Pinwheel: A Real-Time Scheduling Problem, Deji Chen and Aloysivs Mok Scheduling Real-Time Tasks: Algorithms and Complexity, Sanjay Baruah and Joael Goossens Real Time Synchronization Protocols, Lui Sha and Marco Caccamo Fair Scheduling of Real-Time Tasks on Multiprocessors, James Anderson, Philip Holman, and Anand Srinivasan A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms, John Carpenter, Shelby Funk, Philip Holman, Anand Srinivasan, James Anderson, and Sanjoy Baruah Approximation Algorithms for Scheduling Time-Critical Jobs on Multiprocessor System, Sudarshan K. Dhall Scheduling Overloaded Real-Time Systems with Competitive/Worst Case Guarantees, Gilad Koren and Dennis Shasha Minimizing TotalWeighted Error for Imprecise Computation Tasks and Related Problems, Joseph Y-T. Leung Dual Criteria Optimization Problems for Imprecise Computation Tasks, Kevin I-J Ho Periodic Reward-Based Scheduling and Its Application to Power-Aware Real-Time Systems, Hakan Aydin, Rami Melhem, and Daniel Mosse Routing Real-Time Messages on Networks, G. Young Stochastic Scheduling and Queueing Networks Offline Deterministic Scheduling, Stochastic Scheduling, and Online Deterministic Scheduling: A Comparative Overview, Michael Pinedo Stochastic Scheduling with Earliness and Tardiness Penalties, Xiaoqiang Cai and Xian Zhou Developments in Queueing Networks with Tractable Solutions, Xiuli Chao Scheduling in Secondary Storage Systems, Alexander Thomasian Selfish Routing on the Internet, Artur Czumaj Applications Scheduling of Flexible Resources in Professional Service Firms, Yalcin Akcay, Anantaram Balakrishnan, and Susan H. Xu Novel Metaheuristic Approaches to Nurse Rostering Problems in Belgian Hospitals, Edmund Kieran Burke, Patrick De Causmaecker and Greet Vanden Berghe University Timetabling, Sanja Petrovic and Edmund Burke Adapting the GATES Architecture to Scheduling Faculty, R. P. Brazile and K. M. Swigger Constraint Programming for Scheduling, John J. Kanet, Sanjay L. Ahire, and Michael F. Gorman Batch Production Scheduling in the Process Industries, Karsten Gentner, Klaus Neumann, Christoph Schwindt, and Norbert Trautmann A Composite Very-Large-Scale Neighborhood Search Algorithm for the Vehicle Routing Problem, Richa Agarwal, Ravinder K. Ahuja, Gilbert Laporte, and Zuo-Jun "Max" Shen Scheduling Problems in the Airline Industry, Xiangtong Qi, Jian Yang and Gang Yu Bus and Train Driver Scheduling, Raymond S. K. Kwan Sports Scheduling, Kelly Easton, George Nemhauser, and Michael Trick Index

1,003 citations

Journal ArticleDOI
TL;DR: In this article, the authors investigated an outbreak of abscesses due to MRSA among members of a professional football team and examined the transmission and microbiologic characteristics of the outbreak strain.
Abstract: background Methicillin-resistant Staphylococcus aureus (MRSA) is an emerging cause of infections outside of health care settings. We investigated an outbreak of abscesses due to MRSA among members of a professional football team and examined the transmission and microbiologic characteristics of the outbreak strain. methods We conducted a retrospective cohort study and nasal-swab survey of 84 St. Louis Rams football players and staff members. S. aureus recovered from wound, nasal, and environmental cultures was analyzed by means of pulsed-field gel electrophoresis (PFGE) and typing for resistance and toxin genes. MRSA from the team was compared with other community isolates and hospital isolates. results During the 2003 football season, eight MRSA infections occurred among 5 of the 58 Rams players (9 percent); all of the infections developed at turf-abrasion sites. MRSA infection was significantly associated with the lineman or linebacker position and a higher body-mass index. No MRSA was found in nasal or environmental samples; however, methicillin-susceptible S. aureus was recovered from whirlpools and taping gel and from 35 of the 84 nasal swabs from players and staff members (42 percent). MRSA from a competing football team and from other community clusters and sporadic cases had PFGE patterns that were indistinguishable from those of the Rams’ MRSA; all carried the gene for Panton–Valentine leukocidin and the gene complex for staphylococcal-cassette-chromosome mec type IVa resistance (clone USA300-0114). conclusions We describe a highly conserved, community-associated MRSA clone that caused abscesses among professional football players and that was indistinguishable from isolates from various other regions of the United States.

723 citations

01 Jan 2004
TL;DR: This chapter analyzes the trade-offs involved in scheduling independent, periodic real-time tasks on a multiprocessor.
Abstract: Real-time multiprocessor systems are now commonplace. Designs range from single-chip architectures, with a modest number of processors, to large-scale signal-processing systems, such as synthetic-aperture radar systems. For uniprocessor systems, the problem of ensuring that deadline constraints are met has been widely studied: effective scheduling algorithms that take into account the many complexities that arise in real systems (e.g., synchronization costs, system overheads, etc.) are well understood. In contrast, researchers are just beginning to understand the trade-offs that exist in multiprocessor systems. In this chapter, we analyze the trade-offs involved in scheduling independent, periodic real-time tasks on a multiprocessor.

347 citations

Proceedings ArticleDOI
05 Dec 2006
TL;DR: This paper is the first attempt by anyone to compare partitioned and global real-time scheduling approaches using empirical data.
Abstract: We present a real-time, Linux-based testbed called LITMUS^RT, which we have developed for empirically evaluating multiprocessor real-time scheduling algorithms. We also present the results from such an evaluation, in which partitioned earliest-deadline-first (EDF) scheduling, preemptive and nonpreemptive global EDF scheduling, and two variants of the global PD^2 Pfair algorithm were considered. The tested algorithms were compared based on both raw performance and schedulability (with real overheads considered) assuming either hard- or soft-real-time constraints. To our knowledge, this paper is the first attempt by anyone to compare partitioned and global real-time scheduling approaches using empirical data.

300 citations

Proceedings ArticleDOI
21 Aug 2007
TL;DR: A new flexible multiprocessor locking scheme is presented that can be applied under both partitioning and global scheduling and allows unrestricted critical-section nesting, but has been designed to deal with the common case of short non-nested accesses efficiently.
Abstract: Real-time scheduling algorithms for multiprocessor systems have been the subject of considerable recent interest. For such an algorithm to be truly useful in practice, support for semaphore-based locking must be provided. However, for many global scheduling algorithms, no such mechanisms have been proposed. Furthermore, in the partitioned case, most prior semaphore schemes are either inefficient or restrict critical sections considerably. In this paper, a new flexible multiprocessor locking scheme is presented that can be applied under both partitioning and global scheduling. This scheme allows unrestricted critical-section nesting, but has been designed to deal with the common case of short non-nested accesses efficiently.

259 citations


Cited by
More filters
Book
01 Jan 1996
TL;DR: This book familiarizes readers with important problems, algorithms, and impossibility results in the area, and teaches readers how to reason carefully about distributed algorithms-to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures.
Abstract: In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers, and researchers. Distributed Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automata-theoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election, global snapshots, and many others. The material is organized according to the system model-first by the timing model and then by the interprocess communication mechanism. The material on system models is isolated in separate chapters for easy reference. The presentation is completely rigorous, yet is intuitive enough for immediate comprehension. This book familiarizes readers with important problems, algorithms, and impossibility results in the area: readers can then recognize the problems when they arise in practice, apply the algorithms to solve them, and use the impossibility results to determine whether problems are unsolvable. The book also provides readers with the basic mathematical tools for designing new algorithms and proving new impossibility results. In addition, it teaches readers how to reason carefully about distributed algorithms-to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures. Table of Contents 1 Introduction 2 Modelling I; Synchronous Network Model 3 Leader Election in a Synchronous Ring 4 Algorithms in General Synchronous Networks 5 Distributed Consensus with Link Failures 6 Distributed Consensus with Process Failures 7 More Consensus Problems 8 Modelling II: Asynchronous System Model 9 Modelling III: Asynchronous Shared Memory Model 10 Mutual Exclusion 11 Resource Allocation 12 Consensus 13 Atomic Objects 14 Modelling IV: Asynchronous Network Model 15 Basic Asynchronous Network Algorithms 16 Synchronizers 17 Shared Memory versus Networks 18 Logical Time 19 Global Snapshots and Stable Properties 20 Network Resource Allocation 21 Asynchronous Networks with Process Failures 22 Data Link Protocols 23 Partially Synchronous System Models 24 Mutual Exclusion with Partial Synchrony 25 Consensus with Partial Synchrony

4,340 citations

Journal ArticleDOI
TL;DR: These guidelines discuss the management of a variety of clinical syndromes associated with MRSA disease, including skin and soft tissue infections (SSTI), bacteremia and endocarditis, pneumonia, bone and joint infections, and central nervous system infections.
Abstract: Evidence-based guidelines for the management of patients with methicillin-resistant Staphylococcus aureus (MRSA) infections were prepared by an Expert Panel of the Infectious Diseases Society of America (IDSA). The guidelines are intended for use by health care providers who care for adult and pediatric patients with MRSA infections. The guidelines discuss the management of a variety of clinical syndromes associated with MRSA disease, including skin and soft tissue infections (SSTI), bacteremia and endocarditis, pneumonia, bone and joint infections, and central nervous system (CNS) infections. Recommendations are provided regarding vancomycin dosing and monitoring, management of infections due to MRSA strains with reduced susceptibility to vancomycin, and vancomycin treatment failures.

3,370 citations

Journal ArticleDOI
TL;DR: This review comprehensively covers the epidemiology, pathophysiology, clinical manifestations, and management of S. aureus as a leading cause of bacteremia and infective endocarditis as well as osteoarticular, skin and soft tissue, pleuropulmonary, and device-related infections.
Abstract: Staphylococcus aureus is a major human pathogen that causes a wide range of clinical infections. It is a leading cause of bacteremia and infective endocarditis as well as osteoarticular, skin and soft tissue, pleuropulmonary, and device-related infections. This review comprehensively covers the epidemiology, pathophysiology, clinical manifestations, and management of each of these clinical entities. The past 2 decades have witnessed two clear shifts in the epidemiology of S. aureus infections: first, a growing number of health care-associated infections, particularly seen in infective endocarditis and prosthetic device infections, and second, an epidemic of community-associated skin and soft tissue infections driven by strains with certain virulence factors and resistance to β-lactam antibiotics. In reviewing the literature to support management strategies for these clinical manifestations, we also highlight the paucity of high-quality evidence for many key clinical questions.

3,054 citations

Journal ArticleDOI
TL;DR: In this paper, the authors present an overview of the current knowledge of the determinants (both human and bacterial) and risks of S aureus nasal carriage, and summarise the population dynamics of SA.
Abstract: Staphylococcus aureus is a frequent cause of infections in both the community and hospital. Worldwide, the increasing resistance of this pathogen to various antibiotics complicates treatment of S aureus infections. Effective measures to prevent S aureus infections are therefore urgently needed. It has been shown that nasal carriers of S aureus have an increased risk of acquiring an infection with this pathogen. The nose is the main ecological niche where S aureus resides in human beings, but the determinants of the carrier state are incompletely understood. Eradication of S aureus from nasal carriers prevents infection in specific patient categories-eg, haemodialysis and general surgery patients. However, recent randomised clinical trials in orthopaedic and non-surgical patients failed to show the efficacy of eliminating S aureus from the nose to prevent subsequent infection. Thus we must elucidate the mechanisms behind S aureus nasal carriage and infection to be able to develop new preventive strategies. We present an overview of the current knowledge of the determinants (both human and bacterial) and risks of S aureus nasal carriage. Studies on the population dynamics of S aureus are also summarised.

2,280 citations

Journal ArticleDOI
TL;DR: The molecular epidemiology of the epidemic waves of peniillin- and methicillin-resistant strains of S. aureus that have occurred since 1940 are reviewed, with a focus on the clinical and molecular epidemiological of CA-MRSA.
Abstract: Staphylococcus aureus is notorious for its ability to become resistant to antibiotics. Infections that are caused by antibiotic-resistant strains often occur in epidemic waves that are initiated by one or a few successful clones. Methicillin-resistant S. aureus (MRSA) features prominently in these epidemics. Historically associated with hospitals and other health care settings, MRSA has now emerged as a widespread cause of community infections. Community or community-associated MRSA (CA-MRSA) can spread rapidly among healthy individuals. Outbreaks of CA-MRSA infections have been reported worldwide, and CA-MRSA strains are now epidemic in the United States. Here, we review the molecular epidemiology of the epidemic waves of penicillin- and methicillin-resistant strains of S. aureus that have occurred since 1940, with a focus on the clinical and molecular epidemiology of CA-MRSA.

2,222 citations