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

Radharamanan Radhakrishnan

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

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

Systems, architecture and hardware · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 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
1 paper
Performance modeling and evaluation · 87% Parallel and multicore computing · 13%
Software engineering, system software, and programming languages
1 paper
Program verification · 100%

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

TopicWeightPapersLastEvidence papers
Program verification
theorem proving
0.012002
A Formal Specification and Verification Framework for Time Warp-Based Parallel Simulation · IEEE Trans. Software Eng. 2002
Performance modeling and evaluation › simulation › discrete-event simulation
parallel discrete event simulation
0.012002
A Formal Specification and Verification Framework for Time Warp-Based Parallel Simulation · IEEE Trans. Software Eng. 2002
Performance modeling and evaluation › simulation › discrete-event simulation › parallel discrete event simulation › optimistic simulation
time warp
0.012002
A Formal Specification and Verification Framework for Time Warp-Based Parallel Simulation · IEEE Trans. Software Eng. 2002
Parallel and multicore computing › synchronization
optimistic synchronization
0.012002
A Formal Specification and Verification Framework for Time Warp-Based Parallel Simulation · IEEE Trans. Software Eng. 2002

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

model checking · 0.1PVS · 0.1LTL · 0.1
YearPublicationVenuePosition
2002 Analysis and Simulation of Mixed-Technology VLSI Systems
Dale E. Martin, Radharamanan Radhakrishnan, Dhananjai Madhava Rao, Malolan Chetlur, Krishnan Subramani, Philip A. Wilsey
J. Parallel Distributed Comput.2
2002 A Formal Specification and Verification Framework for Time Warp-Based Parallel Simulation
abstract
The paper describes a formal framework developed using the Prototype Verification System (PVS) to model and verify distributed simulation kernels based on the Time Warp paradigm. The intent is to provide a common formal base from which domain specific simulators can be modeled, verified, and developed. PVS constructs are developed to represent basic Time Warp constructs. Correctness conditions for Time Warp simulation are identified, describing causal ordering of event processing and correct rollback processing. The PVS theorem prover and type-check condition system are then used to verify all correctness conditions. In addition, the paper discusses the framework's reusability and extensibility properties in support of specification and verification of Time Warp extensions and optimizations.
Peter Frey, Radharamanan Radhakrishnan, Harold W. Carter, Philip A. Wilsey, Perry Alexander
IEEE Trans. Software Eng.2
1998 On-line Configuration of a Time Warp Parallel Discrete Event Simulator
abstract
In time warp simulations, the overheads associated with rollbacks, state-saving and the communication induced by rollbacks are the chief contributors to the cost of the simulation; thus, these aspects of the simulation have been primary targets for optimizations. Unfortunately, the behavior of the time warp simulation is highly dynamic and greatly influenced by the application being simulated. Thus, the suggested optimizations are only effective for certain intervals of the simulation. This paper argues that the performance of time warp simulators benefits from a dynamic on-line decision process that selects and configures the sub-algorithms implementing the different aspects of the simulator to best match the current behavior of the simulation. In particular we study control strategies to dynamically: (i) adjust the checkpointing (or state-saving) interval (ii) select the cancellation strategy (lazy or aggressive), and (iii) determine the policy for aggregating the application messages (an optimization that significantly improves the performance in message passing environments). The strategies have been implemented in the WARPED time warp simulation kernel and the performance obtained via the dynamically controlled optimizations is shown to surpass that of their best performing static counterparts.
Radharamanan Radhakrishnan, Nael B. Abu-Ghazaleh, Malolan Chetlur, Philip A. Wilsey
ICPP1