Optimistic recovery in distributed systems
ACM Transactions on Computer Systems (TOCS)
Partial orders for parallel debugging
PADD '88 Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging
Concerning the size of logical clocks in distributed systems
Information Processing Letters
Consistent detection of global predicates
PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
Monitoring and debugging distributed real-time programs
Software—Practice & Experience
Program understanding and the concept assignment problem
Communications of the ACM
Fundamental issues in testing distributed real-time systems
Real-Time Systems - Special issue: dependability of real-time software
Software reconnaissance: mapping program features to code
Journal of Software Maintenance: Research and Practice
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Tracking immediate predecessors in distributed computations
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Logical Clock Requirements for Reverse Engineering Scenarios from a Distributed System
IEEE Transactions on Software Engineering
A Temporal Approach for Testing Distributed Systems
IEEE Transactions on Software Engineering
Distributed Deadlock Detection and Resolution with Probes
Proceedings of the 3rd International Workshop on Distributed Algorithms
A Formalism to Automate Mapping from Program Features to Code
IWPC '00 Proceedings of the 8th International Workshop on Program Comprehension
Case Study of Feature Location Using Dependence Graph
IWPC '00 Proceedings of the 8th International Workshop on Program Comprehension
Distributed algorithms for detecting conjunctive predicates
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Efficient algorithms for optimistic crash recovery
Distributed Computing
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Optimal Detection and Resolution of Distributed Deadlocks in the Generalized Model
PDP '06 Proceedings of the 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing
Performance Features of Global States Based Application Control
PDP '06 Proceedings of the 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing
An approach to feature location in distributed systems
Journal of Systems and Software
| Hi-index | 0.00 |
Events generated by the execution of a distributed system are related by causality and concurrency. While providing a means of reasoning about the relative occurrence of events, this partial order fails to represent the timeliness of occurrence. In this paper, we develop a novel means of assigning weights to events where the weights are reduced as the temporal proximity to an anchor event decreases. This weight quantifies the strength of the causal or concurrent relationship with respect to an anchor event. Those events that causally succeed the anchor are the focus of this paper with concurrency and causally preceding being part of future work plans. Three methods of computing event weights for causally succeeding events are defined. Each contains a tunable parameter to determine the rate of weight decrease. The methods are piece-wise linear, exponential, and relevant vector difference decay. A case study has been performed that applied quantitative causality to the well-known software engineering problem of feature location. A summary of the case study results is provided to illustrate the utility of quantitative causality for succeeding events.