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

Victor C. Zandy

dblp:24/5057 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2003
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 first-authorComputer networks · 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
Distributed systems · 70% Cloud and datacenter computing · 23% High-performance computing · 7%
Computer networks
1 paper
Transport protocols and congestion control · 50% Internet architecture and protocols · 50%
Software engineering, system software, and programming languages
2 papers
Operating systems · 81% Software maintenance and evolution · 19%

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

TopicWeightPapersLastEvidence papers
Operating systems › fault tolerance
checkpoint and rollback
0.012003
Checkpoints of GUI-based Applications · USENIX ATC, General Track 2003
Transport protocols and congestion control
transport protocols
0.012002
Reliable network connections · MobiCom 2002
Distributed systems › fault tolerance › checkpointing
checkpointing and migration
0.011999
Process Hijacking · HPDC 1999
Distributed systems
distributed resource management
0.011999
Process Hijacking · HPDC 1999
Distributed systems › distributed system architecture › distributed operating systems
process migration
0.011999
Process Hijacking · HPDC 1999
Cloud and datacenter computing
resource management
0.011999
Process Hijacking · HPDC 1999
High-performance computing
high-throughput computing
0.011999
Process Hijacking · HPDC 1999

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

reliable sockets · 0.1reliable packets · 0.1enhancement detection protocol · 0.1dynamic program re-writing · 0.0DynInst API · 0.0
YearPublicationVenuePosition
2003 Checkpoints of GUI-based Applications
Victor C. Zandy, Barton P. Miller
USENIX ATC, General Track1
2002 Reliable network connections
abstract
We present two systems, reliable sockets (rocks) and reliable packets (racks), that provide transparent network connection mobility using only user- level mechanisms. Each system can detect a connection failure within seconds of its occurrence, preserve the endpoint of a failed connection in a suspended state for an arbitrary period of time, and automatically reconnect, even when one end of the connection changes IP address, with correct recovery of in-flight data. To allow rocks and racks to interoperate with ordinary clients and servers, we introduce a general user-level Enhancement Detection Protocol that enables the remote detection of rocks and racks, or any other socket enhancement system, but does not affect applications that use ordinary sockets. Rocks and racks provide the same functionality but have different implementation models: rocks intercept and modify the behavior of the sockets API by using an interposed library, while racks uses a packet filter to intercept and modify the packets exchanged over a connection. Racks and rocks introduce small throughput and latency overheads that we deem acceptable for the level of mobility and reliability they provide.
Victor C. Zandy, Barton P. Miller
MobiCom1
1999 Process Hijacking
abstract
Process checkpointing is a basic mechanism required for providing high throughput computing service on distributively owned resources. We present a new process checkpoint and migration technique, called process hijacking, that uses dynamic program re-writing techniques to add checkpointing capability to a running program. Process hijacking makes it possible to checkpoint and migrate proprietary applications that cannot be re-linked with a checkpoint library, and it makes it possible to dynamically hand off an ordinary running process to a distributed resource management system such as Condor. We discuss the problems of adding checkpointing capability to a program already in execution: loading new code into the running process; and replacing functions of the process with calls to dynamically loaded functions. We use the DynInst API process editing library, augmented with a new call for replacing functions, to solve these problems.
Victor C. Zandy, Barton P. Miller, Miron Livny
HPDC1