Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Curtis E. Hrischuk

dblp:86/6594 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2002
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 2 first-authorSystems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Performance modeling and evaluation · 75% Distributed systems · 25%
Theoretical computer science
1 paper
Distributed computing theory · 50% Logic in computer science · 50%
Software engineering, system software, and programming languages
2 papers
Software maintenance and evolution · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems
distributed debugging
0.012002
Logical Clock Requirements for Reverse Engineering Scenarios from a Distributed System · IEEE Trans. Software Eng. 2002
Performance modeling and evaluation
trace analysis
0.012002
Logical Clock Requirements for Reverse Engineering Scenarios from a Distributed System · IEEE Trans. Software Eng. 2002
Logic in computer science
causality
0.012002
Logical Clock Requirements for Reverse Engineering Scenarios from a Distributed System · IEEE Trans. Software Eng. 2002
Distributed computing theory
logical clocks
0.012002
Logical Clock Requirements for Reverse Engineering Scenarios from a Distributed System · IEEE Trans. Software Eng. 2002
Performance modeling and evaluation › queueing models › queueing network model
layered queueing networks
0.011999
Trace-Based Load Characterization for Gernerating Performance Software Models · IEEE Trans. Software Eng. 1999
Performance modeling and evaluation
queueing models
0.011999
Trace-Based Load Characterization for Gernerating Performance Software Models · IEEE Trans. Software Eng. 1999
Performance modeling and evaluation
workload characterization
0.011999
Trace-Based Load Characterization for Gernerating Performance Software Models · IEEE Trans. Software Eng. 1999
Software maintenance and evolution
reverse engineering
0.012002
Logical Clock Requirements for Reverse Engineering Scenarios from a Distributed System · IEEE Trans. Software Eng. 2002
Software maintenance and evolution
software performance engineering
0.011999
Trace-Based Load Characterization for Gernerating Performance Software Models · IEEE Trans. Software Eng. 1999
YearPublicationVenuePosition
2002 Logical Clock Requirements for Reverse Engineering Scenarios from a Distributed System
abstract
To reverse engineer scenarios from event traces, one must infer causal relationships between events. The inferences are usually based on a trace with sequence numbers or timestamps corresponding to some kind of logical clock. In practice, there is an explosion of potentially causal relationships in the trace, which limits one's ability to extract scenarios. This work defines a more parsimonious form of causality called scenario causality that concentrates on certain major causal relationships and ignores more subtle, potentially causal links. The influence of an event is restricted to the particular scenario it is part of. An event which is not a message reception is defined to be caused by the previous event in the same software object, while a message reception is caused by a sending event in another object. The events are ordered to form a scenario event graph where typed nodes are events and the typed edges are certain causal relationships. Intuitively, we might say that most logical clocks, which identify events which "happened before" a given event and, thus, are potentially causal, give an upper bound on the set of causal events; scenario causality identifies a lower bound. The much smaller lower bound set makes it possible to reverse engineer and automate the analysis of scenarios.
Curtis E. Hrischuk, C. Murray Woodside
IEEE Trans. Software Eng.1
2001 Automated performance modeling of software generated by a design environment
C. Murray Woodside, Curtis E. Hrischuk, Bran Selic, Stefan Bayarov
Perform. Evaluation2
1999 Trace-Based Load Characterization for Gernerating Performance Software Models
abstract
Performance models of software designs can give early warnings of problems such as resource saturation or excessive delays. However models are seldom used because of the considerable effort needed to construct them. The ANGIOTRACE/sup TM/ was developed to gather the necessary information from an executable design and develop a model in an automated fashion. It applies to distributed and concurrent software with synchronous (send-reply or RPC) communications, developing a layered queuing network model. The trace-based load characterization (TLC) technique presented here extends the ANGIOTRACE/sup TM/ to handle software with both synchronous and asynchronous interactions. TLC also detects interactions which are effectively synchronous or partly-synchronous (forwarding) but are built up from asynchronous messages. These patterns occur in telephony software and in other systems. The TLC technique can be applied throughout the software life-cycle, even after deployment.
Curtis E. Hrischuk, C. Murray Woodside, Jerome A. Rolia, Rod Iversen
IEEE Trans. Software Eng.1