An object-oriented 3D graphics toolkit
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Three dimensional visualization of proteins in cellular interactions
Proceedings of the 7th conference on Visualization '96
VisAD: connecting people to computations and people to people
ACM SIGGRAPH Computer Graphics
Information visualization: perception for design
Information visualization: perception for design
Visualization of time dependent confocal microscopy data
Proceedings of the conference on Visualization '00
VRPN: a device-independent, network-transparent VR peripheral system
VRST '01 Proceedings of the ACM symposium on Virtual reality software and technology
Proceedings of the conference on Visualization '01
Case study: cellar scaffold extraction using crest point for volume rendering
VISSYM '03 Proceedings of the symposium on Data visualisation 2003
VisBio: a biological tool for visualization and analysis
ACM SIGGRAPH Computer Graphics
On Properties of RDT Communication-Induced Checkpointing Protocols
IEEE Transactions on Parallel and Distributed Systems
Using Consistent Global Checkpoints to Synchronize Processes in Distributed Simulation
DS-RT '05 Proceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications
Multifield-Graphs: An Approach to Visualizing Correlations in Multifield Scalar Data
IEEE Transactions on Visualization and Computer Graphics
Lessons about virtual environment software systems from 20 years of ve building
Presence: Teleoperators and Virtual Environments
A tri-space visualization interface for analyzing time-varying multivariate volume data
EUROVIS'07 Proceedings of the 9th Joint Eurographics / IEEE VGTC conference on Visualization
Hi-index | 0.00 |
A checkpointing protocol that enforces rollback-dependency trackability (RDT) during the progress of a distributed computation must induce processes to take forced checkpoints to avoid the formation of non-trackable rollback dependencies. A protocol based on the minimal characterization of RDT tests only the smallest set of non-trackable dependencies. The literature indicated that this approach would require the processes to maintain and propagate O(n^2) control information, where n is the number of processes in the computation. In this paper, we present a protocol that implements this approach using only O(n) control information.