Gideon Glass

dblp:44/4142 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2018
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 first-authorComputer networks · 1Software engineering, systems software and programming languages · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 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
2 papers
Distributed systems · 64% Storage systems · 32% Memory systems · 4%
Computer networks
1 paper
Content delivery and video streaming · 62% Network performance modeling · 19% Internet architecture and protocols · 19%

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

TopicWeightPapersLastEvidence papers
Storage systems
file systems
0.312018
Logical Synchronous Replication in the Tintri VMstore File System · FAST 2018
Distributed systems
replication
0.312018
Logical Synchronous Replication in the Tintri VMstore File System · FAST 2018
Distributed systems › replication › update propagation
synchronous replication
0.312018
Logical Synchronous Replication in the Tintri VMstore File System · FAST 2018
Content delivery and video streaming › caching
web caching
0.011999
Performance of Web Proxy Caching in Heterogeneous Bandwidth Environments · INFOCOM 1999
Memory systems › memory management › virtual memory
page replacement
0.011997
Adaptive Page Replacement Based on Memory Reference Behavior · SIGMETRICS 1997
Memory systems
virtual memory management
0.011997
Adaptive Page Replacement Based on Memory Reference Behavior · SIGMETRICS 1997
Internet architecture and protocols › world wide web
HTTP performance
0.011999
Performance of Web Proxy Caching in Heterogeneous Bandwidth Environments · INFOCOM 1999
Memory systems
memory referencing behavior
0.011997
Adaptive Page Replacement Based on Memory Reference Behavior · SIGMETRICS 1997

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

packet trace simulation · 0.0simulation · 0.0
YearPublicationVenuePosition
2018 Logical Synchronous Replication in the Tintri VMstore File System
Gideon Glass, Arjun Gopalan, Dattatraya Koujalagi, Abhinand Palicherla, Sumedh Sakdeo
FAST1
1999 Performance of Web Proxy Caching in Heterogeneous Bandwidth Environments
abstract
Much work on the performance of Web proxy caching has focused on high-level metrics such as hit rates, but has ignored low level details such as "cookies", aborted connections, and persistent connections between clients and proxies as well as between proxies and servers. These details have a strong impact on performance, particularly in heterogeneous bandwidth environments where network speeds between clients and proxies are significantly different than speeds between proxies and servers. We evaluate through detailed simulations the latency and bandwidth effects of Web proxy caching in such environments. We drive our simulations with packet traces from two scenarios: clients connected through slow dialup modems to a commercial ISP, and clients on a fast LAN in an industrial research lab. We present three main results. First, caching persistent connections at the proxy can improve latency much more than simply caching Web data. Second, aborted connections can waste more bandwidth than that saved by caching data. Third, cookies can dramatically reduce hit rates by making many documents effectively uncacheable.
Anja Feldmann, Ramón Cáceres, Fred Douglis, Gideon Glass, Michael Rabinovich
INFOCOM4
1997 Adaptive Page Replacement Based on Memory Reference Behavior
abstract
As disk performance continues to lag behind that of memory systems and processors, virtual memory management becomes increasingly important for overall system performance. In this paper we study the page reference behavior of a collection of memory-intensive applications, and propose a new virtual memory page replacement algorithm, SEQ. SEQ detects long sequences of page faults and applies most-recently-used replacement to those sequences. Simulations show that for a large class of applications, SEQ performs close to the optimal replacement algorithm, and significantly better than Least-Recently-Used (LRU). In addition, SEQ performs similarly to LRU for applications that do not exhibit sequential faulting.
Gideon Glass
SIGMETRICS1