Terence Kelly

Inhibikase Therapeutics (United States)

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Stéphane Lafortune

College of Charleston

Scott Mahlke

University of Michigan–Ann Arbor

Gary M. Muschik

Science Applications International Corporation (United States)

Wayne B. Manning

Triangle

Spyros Reveliotis

Georgia Institute of Technology

Hongwei Liao

University of Michigan–Ann Arbor

Janet L. Wiener

Meta (United States)

Christopher Stewart

The Ohio State University

Joseph Izraelevitz

University of Colorado Boulder

Y. Zhou

Liaoning Normal University

Cooperative Institutions

Hewlett-Packard (United States)

University of Michigan–Ann Arbor

IBM (United States)

Johns Hopkins University

University of California, Berkeley

Novartis (Switzerland)

Google (United States)

University of California, San Diego

Stanford University

IBM Research - Thomas J. Watson Research Center

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Capturing, indexing, clustering, and retrieving system history

ACM SIGOPS Operating Systems Review (2005)

Ira L. Cohen Steve Zhang Moisés Goldszmidt Julie Symons Terence Kelly

We present a method for automatically extracting from a running system an indexable signature that distills the essential characteristic from a system state and that can be subjected to automated clustering and similarity-based retrieval to identify when an observed system state is similar to a previously-observed state. This allows operators to identify and quantify the frequency of recurrent problems, to leverage previous diagnostic efforts, and to establish whether problems seen at different installations of the same site are similar or distinct. We show that the naive approach to constructing these signatures based on simply recording the actual ``raw'' values of collected measurements is ineffective, leading us to a more sophisticated approach based on statistical modeling and inference. Our method requires only that the system's metric of merit (such as average transaction response time) as well as a collection of lower-level operational metrics be collected, as is done by existing commercial monitoring tools. Even if the traces have no annotations of prior diagnoses of observed incidents (as is typical), our technique successfully clusters system states corresponding to similar problems, allowing diagnosticians to identify recurring problems and to characterize the ``syndrome'' of a group of problems. We validate our approach on both synthetic traces and several weeks of production traces from a customer-facing geoplexed 24 x 7 system; in the latter case, our approach identified a recurring problem that had required extensive manual diagnosis, and also aided the operators in correcting a previous misdiagnosis of a different problem.

Leverage (statistics)

10.1145/1095809.1095821

Cite

Citations (287)

Developing emergency exercises for hazardous material transportation: Process, documents and templates

Margaret Crichton Terence Kelly

Multi-agency emergency exercises establish and reinforce relationships, and bring people from different areas together to work as a team, realise clear goals, understand roles and responsibilities, and get to know and respect each agency’s strengths and weaknesses. However, despite the long-held belief in and respect for exercises in their provision of benefits to the individual and the organisation, there is little evidence of a consistent and clear process for exercise design, especially identifying the documents that may need to be completed to ensure efficient exercise preparation and performance. This paper reports the results of a project undertaken on behalf of the organisations that form the radioactive material transportation mutual-aid agreement, RADSAFE, to develop a standardised process to design emergency exercises. Three stages, from identifying the requirement for an exercise (Stage I), through to obtaining approval for operational orders (Stage II), then conducting a management review as part of the continuous improvement cycle (Stage III), were developed. Although designed for radioactive material transportation events, it is suggested that many of the factors within these three stages can be generalised for the design of exercises in other high-hazard industries.

Strengths and weaknesses

10.69554/ivsf7826

Cite

Citations (4)

Biased Replacement Policies for Web Caches: Differential Quality-of-Service and Aggregate User Value

Deep Blue (University of Michigan) (1999)

Jeffrey K. MacKie–Mason Terence Kelly Yee Man Chan Sugih Jamin

Value (mathematics)

Source

Cite

Citations (0)

Maximally permissive deadlock avoidance for multithreaded computer programs (Extended abstract)

Yin Wang Hongwei Liao Ahmed Nazeem Spyros Reveliotis Terence Kelly

Multicore architectures in computer hardware bring an unprecedented need for parallel programming. In the work considered in this presentation, we are especially interested in multithreaded programs with shared data. In this widelyused programming paradigm, "lock" primitives are employed to control access to the shared data within the program threads. For example, mutual exclusion locks (mutexes) are used to protect shared data from concurrent inconsistent updates. However, improper use of mutexes can lead to the familiar "deadly embrace" problem, where a set of threads are waiting for one another and no further progress can be made. These situations are called Circular-Mutex-Wait (CMW) deadlocks and the tale of the dining philosophers [4], [3] is an amusing way to illustrate CMW-deadlocks. As parallel programs are becoming more and more complex, reasoning about deadlock is becoming more and more difficult for programmers. Significant effort has to be spent to detect and fix intricate deadlock bugs. Therefore, there is an emerging need for more systematic methodologies that will enable the programmers of these environments to effectively characterize, analyze, and resolve these deadlock problems.

Semaphore

Deadlock prevention algorithms

Lock (firearm)

Concurrent computing

Multi-core processor

10.1109/coase.2009.5234118

Cite

Citations (8)

Review of the evidence to support oral hygiene in stroke patients

Nursing Standard (2010)

Terence Kelly Steven Timmis Timothy Twelvetree

Maintaining good oral hygiene in patients who have had a stroke is an essential part of care. This literature review highlights the poor provision of such care in acute medical and rehabilitation settings. It reveals a lack of evidence for current practices and suggests that research may be helpful in defining which nursing interventions are most effective.

Stroke

Nursing Interventions Classification

10.7748/ns2010.05.24.37.35.c7778

Cite

Citations (13)

ChemInform Abstract: PREPARATION OF DERIVATIVES OF 5‐, 6‐, AND 8‐HYDROXY‐2‐AMINOANTHRACENE

Chemischer Informationsdienst (1980)

Wayne B. Manning Terence Kelly Gary M. Muschik

Abstract Anthra‐ flavinsäure (I) wird in bekannter Weise zum Anthracendiol‐diacetat (II) reduziert und acetyliert und dann nach Bucherer zum acetylierten Monoaminoderivat (III) ausgetauscht.

10.1002/chin.198040204

Cite

Citations (0)

Estimating Cache Hit Rates from the Miss Sequence

Timothy Y. Chow Terence Kelly Daniel M. Reeves

cache, hit rate, estimation, LRU stack distance, success function This paper considers the problem of inferring cache hit rates from observationsof references that miss in the cache. In the Web context, this is the problem ofinferring a browser's cache hit rate by examining the requests that it issues toorigin servers. We show that a case of this problem can be solved.

Cache invalidation

Smart Cache

Cache pollution

Page cache

Source

Cite

Citations (0)

Eliminating Concurrency Bugs in Multithreaded Software: A New Approach Based on Discrete-Event Control

IEEE Transactions on Control Systems Technology (2013)

Hongwei Liao Yin Wang Jason Stanley Stéphane Lafortune Spyros Reveliotis

Computer hardware is moving from uniprocessor to multicore architectures. One problem arising in this evolution is that only parallel software can exploit the full performance potential of multicore architectures, and parallel software is far harder to write than conventional serial software. One important class of failures arising in parallel software is circular-wait deadlock in multithreaded programs. In our ongoing Gadara project, we use a special class of Petri nets, called Gadara nets, to systematically model multithreaded programs with lock allocation and release operations. In this paper, we propose an efficient optimal control synthesis methodology for ordinary Gadara nets that exploits the structural properties of Gadara nets via siphon analysis. Optimality in this context refers to the elimination of deadlocks in the program with minimally restrictive control logic. We formally establish a set of important properties of the proposed control synthesis methodology, and show that our algorithms never synthesize redundant control logic. We conduct experiments to evaluate the efficiency and scalability of the proposed methodology, and discuss the application of our results to real-world concurrent software.

Uniprocessor system

Multi-core processor

10.1109/tcst.2012.2226034

Cite

Citations (33)

Failure-Atomic Persistent Memory Updates via JUSTDO Logging

ACM SIGPLAN Notices (2016)

Joseph Izraelevitz Terence Kelly Aasheesh Kolli

Persistent memory invites applications to manipulate persistent data via load and store instructions. Because failures during updates may destroy transient data (e.g., in CPU registers), preserving data integrity in the presence of failures requires failure-atomic bundles of updates. Prior failure atomicity approaches for persistent memory entail overheads due to logging and CPU cache flushing. Persistent caches can eliminate the need for flushing, but conventional logging remains complex and memory intensive. We present the design and implementation of JUSTDO logging, a new failure atomicity mechanism that greatly reduces the memory footprint of logs, simplifies log management, and enables fast parallel recovery following failure. Crash-injection tests confirm that JUSTDO logging preserves application data integrity and performance evaluations show that it improves throughput 3x or more compared with a state-of-the-art alternative for a spectrum of data-intensive algorithms.

Atomicity

Memory footprint

10.1145/2954679.2872410

Cite

Citations (9)

Optimization inWeb Caching: Cache Management, Capacity Planning, and Content Naming

Deep Blue (University of Michigan) (2002)

Terence Kelly

Capacity planning

Content (measure theory)

Source

Cite

Citations (2)