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

Sitaram C. V. Raju

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

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

Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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
1 paper
Embedded and real-time systems · 72% Distributed systems · 28%

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

TopicWeightPapersLastEvidence papers
Embedded and real-time systems
distributed real-time systems
0.011992
Monitoring Timing Constraints in Distributed Real-Time Systems · RTSS 1992
Distributed systems
fault tolerance
0.011992
Monitoring Timing Constraints in Distributed Real-Time Systems · RTSS 1992
Embedded and real-time systems › runtime monitoring
timing constraint monitoring
0.011992
Monitoring Timing Constraints in Distributed Real-Time Systems · RTSS 1992
Embedded and real-time systems › runtime monitoring
violation detection
0.011992
Monitoring Timing Constraints in Distributed Real-Time Systems · RTSS 1992
Embedded and real-time systems › real-time synchronization
clock drift
0.011992
Monitoring Timing Constraints in Distributed Real-Time Systems · RTSS 1992
Distributed systems
clock synchronization
0.011992
Monitoring Timing Constraints in Distributed Real-Time Systems · RTSS 1992

Methods — techniques the papers use, named apart from their topics

message minimization · 0.0intermediate constraint derivation · 0.0
YearPublicationVenuePosition
1994 Runtime Monitoring of Timing Constraints in Distributed Real-Time Systems
Farnam Jahanian, Ragunathan Rajkumar, Sitaram C. V. Raju
Real Time Syst.3
1994 A Prototyping Environment for Specifying, Executing and Checking Communicating Real-Time State Machines
abstract
Abstract We describe a toolset, consisting of a graphical editor, a simulator, and an assertion checker, for prototyping real‐time systems that are specified as Communicating Real‐Time State machines (CRSMs). CRSMs are timed state machines that communicate synchronously over unidirectional channels. The system behavior of CRSMs is characterized by a time‐stamped trace of communication events. Safety and timing assertions on the trace of communication events are expressed in a notation based on Real‐Time Logic. We illustrate the simulator and assertion checker by specifying a traffic‐light controller and other real‐time systems. There are two main contributions in this work: first, the prototyping environment serves as a validation of the model, the execution algorithm and paper design of example CRSMs, demonstrating that the ideas are realizable and potentially useful. Secondly, the paper presents a novel and useful method of specifying safety and timing properties, and checking them during simulation.
Sitaram C. V. Raju, Alan C. Shaw
Softw. Pract. Exp.1
1992 Monitoring Timing Constraints in Distributed Real-Time Systems
abstract
A run-time environment for monitoring distributed real-time systems is described. In particular, the authors focus on the problem of detecting violations of timing assertions in an environment in which the real-time tasks run on multiple processors, and timing constraints can be either interprocessor or intraprocessor constraints. Constraint violations are detected at the earliest possible time by deriving and checking intermediate constraints. If the violations must be detected as early as possible, then the problem of minimizing the number of messages to be exchanged between the processors becomes intractable. The authors characterize a subclass of timing constraints that occur commonly in distributed real-time systems and whose message requirements can be minimized. They also take into account the drift among the various processor clocks when detecting a violation of a timing assertion. Finally, an implementation of a distributed run-time monitor is described.>
Sitaram C. V. Raju, Ragunathan Rajkumar, Farnam Jahanian
RTSS1