Gary S. Ho

dblp:60/5692 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 1982
—ORCID · none

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

Software engineering, systems software and programming languages · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 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
3 papers
Distributed systems · 59% Performance modeling and evaluation · 41%
Databases, data mining, and information retrieval
1 paper
Distributed and cloud data management · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems › concurrency control
deadlock detection
0.011982
Protocols for Deadlock Detection in Distributed Database Systems · IEEE Trans. Software Eng. 1982
Distributed systems
distributed database
0.011982
Protocols for Deadlock Detection in Distributed Database Systems · IEEE Trans. Software Eng. 1982
Performance modeling and evaluation
asynchronous concurrent systems
0.011980
Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets · IEEE Trans. Software Eng. 1980
Performance modeling and evaluation
petri net modeling
0.011980
Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets · IEEE Trans. Software Eng. 1980
Distributed and cloud data management
distributed database architecture
0.011977
Architectural Issues in Distributed Data Base Systems · VLDB 1977
Distributed systems
distributed coordination and fault tolerance
0.011977
Architectural Issues in Distributed Data Base Systems · VLDB 1977

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

two-phase communication protocol · 0.0timed petri nets · 0.0performance prediction · 0.0demand graph analysis · 0.0
YearPublicationVenuePosition
1982 Protocols for Deadlock Detection in Distributed Database Systems
abstract
In distributed databases, deadlocks may occur due to conflicts in data file lockings A system is in a deadlock if and only if there is a directed cycle in its demand graph. However, due to the inherent communication delay in a distributed system, it is not easy to construct a consistent demand graph for a distributed system. In this paper, three deadlock detection protocols are discussed. The first protocol uses two communication phases. The second protocol uses a single communication phase. Based on the second protocol, a one-phase hierarchical deadlock detection protocol is developed.
Gary S. Ho, C. V. Ramamoorthy
IEEE Trans. Software Eng.1
1980 Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
abstract
Some analysis techniques for real-time asynchronous concurrent systems are presented. In order to model clearly the synchronization involved in these systems, an extended timed Petri net model is used. The system to be studied is first modeled by a Petri net. Based on the Petri net model, a system is classified into either: 1) a consistent system; or 2) an inconsistent system. Most real-world systems fall into the first class which is further subclassified into i) decision-free systems; ii) safe persistent systems; and iii) general systems. Procedures for predicting and verifying the system performance of all three types are presented. It is found that the computational complexity involved increases in the same order as they are listed above.
C. V. Ramamoorthy, Gary S. Ho
IEEE Trans. Software Eng.2
1979 Performance evaluation of concurrent asynchronous systems using petri nets
abstract
Some analysis techniques for real time asynchronous concurrent sysLems are presented. In order to model clearly the synchronization involved in these systems, the extended timed Petri net model is used. The system to be studied is first modelled by a Petri net. Based on the Petri net model, the system is classified into either: (1) consistent system; or (2) inconsistent system. Most real-world systems fall into the first class which is further subclassified into; (i) decision-free system; (ii) safe persistent system; (iii) general system. Procedures for predicting and verifying the system performance of all three types are presented. It is found that the computational complexity involved increases in the same order as they are listed above.
C. V. Ramamoorthy, Gary S. Ho
COMPSAC2
1977 Architectural Issues in Distributed Data Base Systems
C. V. Ramamoorthy, Gary S. Ho, T. Kirshnarao, Benjamin W. Wah
VLDB2