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

Deepak Gupta 0001

dblp:65/2751-1 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2004
—ORCID · conflict

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 · 2 · 2 first-authorComputer networks · 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.

Software engineering, system software, and programming languages
1 paper
Software maintenance and evolution · 56% Programming languages and type systems · 44%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems › language semantics
formal semantics
0.011996
A Formal Framework for On-line Software Version Change · IEEE Trans. Software Eng. 1996
Software maintenance and evolution
dynamic software updating
0.011996
A Formal Framework for On-line Software Version Change · IEEE Trans. Software Eng. 1996

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

undecidability analysis · 0.0formal framework · 0.0
YearPublicationVenuePosition
2004 A Server Side Caching Scheme for CORBA
abstract
We propose a caching scheme for saving the results of invocations of read methods at server side. Server side caching helps in reducing load on frequently accessed servers when computing the result is relatively costly. Our model provides strong consistency by using a dependency graph that specifies dependence information among method invocations of an object. We have implemented this scheme as a service in CORBA.
Pankaj Jalote, Deepak Gupta 0001
ICDCS3
2001 A Protocol for Load Sharing among a Cluster of Heterogeneous Unix Workstations
abstract
In this paper we propose a protocol for load sharing among a cluster of heterogeneous Unix workstations. Our protocol called the distributed process management protocol (DPMP), not only enables load sharing using nonpreemptive process migration but also seamlessly integrates the processes running on a network of machines. Remote processes can be accessed (for signalling, for example), in the same way as local processes making process migration highly transparent to the users and the applications. DPMP also has built in mechanisms to detect and recover from node and network failures. DPMP can be implemented at either the kernel or the user level. We also describe an implementation of DPMP within the Linux kernel. Preliminary performance studies show that the performance gains obtained by using DPMP are substantial.
Deepak Gupta 0001, Ashish Gupta 0009, Sushil K. Agrawal, Vikas Agarwal, Pradip Bepari
CCGRID1
2001 WebCaL - a domain specific language for web caching
Sumit Gulwani, A. Tarachandani, Deepak Gupta 0001, Dheeraj Sanghi, Luciano Porto Barreto, Gilles Muller, Charles Consel
Comput. Commun.3
1996 A Formal Framework for On-line Software Version Change
abstract
The usual way of installing a new version of a software system is to shut down the running program and then install the new version. This necessitates a sometimes unacceptable delay during which service is denied to the users of the software. An online software replacement system replaces parts of the software while it is in execution, thus eliminating the shutdown. While a number of implementations of online version change systems have been described in the literature, little investigation has been done on its theoretical aspects. We describe a formal framework for studying online software version change. We give a general definition of validity of an online change, show that it is in general undecidable and then develop sufficient conditions for ensuring validity for a procedural language.
Deepak Gupta 0001, Pankaj Jalote, Gautam Barua
IEEE Trans. Software Eng.1
1993 On-line Software Version Change Using State Transfer Between Processes
abstract
Abstract The usual way of installing a new version of a piece of software is to shut down the running program and then install the new version. This necessitates a sometimes unacceptable delay during which service is denied to the users of the software. An on‐line software replacement system replaces parts of the software while it is in execution, thus eliminating the shutdown. In this paper, we describe a system for on‐line software version change for software written in the C language. When the change is initiated by the user, the system instantiates a new process with the new version of the software, transfers state from the old process to the new one at an appropriate time, and transfers the control to the new process. The user sees a minimal delay in this switchover.
Deepak Gupta 0001, Pankaj Jalote
Softw. Pract. Exp.1