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

Sitaram Iyer

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

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

Software engineering, systems software and programming languages · 2 · 1 first-authorSystems, architecture and hardware · 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
3 papers
Cloud and datacenter computing · 39% Storage systems · 30% Distributed systems · 21%
Software engineering, system software, and programming languages
2 papers
Operating systems · 100%
Computer networks
1 paper
Content delivery and video streaming · 100%

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

TopicWeightPapersLastEvidence papers
Content delivery and video streaming › caching
web caching
0.012002
Squirrel: a decentralized peer-to-peer web cache · PODC 2002
Operating systems › resource management
memory management
0.012002
Practical, Transparent Operating System Support for Superpages · OSDI 2002
Operating systems › i/o › i/o subsystem
i/o scheduling
0.012001
Anticipatory scheduling: A disk scheduling framework to overcome deceptive idleness in synchronous I/O · SOSP 2001
Storage systems › i/o scheduling
disk scheduling
0.012001
Anticipatory scheduling: A disk scheduling framework to overcome deceptive idleness in synchronous I/O · SOSP 2001
Cloud and datacenter computing › job scheduling
predictive scheduling
0.012001
Anticipatory scheduling: A disk scheduling framework to overcome deceptive idleness in synchronous I/O · SOSP 2001
Content delivery and video streaming › caching
distributed caching
0.012002
Squirrel: a decentralized peer-to-peer web cache · PODC 2002
Distributed systems › peer-to-peer systems
overlay networks
0.012002
Squirrel: a decentralized peer-to-peer web cache · PODC 2002
Distributed systems
peer-to-peer systems
0.012002
Squirrel: a decentralized peer-to-peer web cache · PODC 2002
Memory systems › memory management
virtual memory
0.012002
Practical, Transparent Operating System Support for Superpages · OSDI 2002
Cloud and datacenter computing
quality of service
0.012001
Anticipatory scheduling: A disk scheduling framework to overcome deceptive idleness in synchronous I/O · SOSP 2001

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

transparent superpage support · 0.1decentralized caching algorithm · 0.1anticipatory scheduling framework · 0.1
YearPublicationVenuePosition
2002 Practical, Transparent Operating System Support for Superpages
Juan Navarro, Sitaram Iyer, Peter Druschel, Alan L. Cox
OSDI2
2002 Squirrel: a decentralized peer-to-peer web cache
abstract
This paper presents a decentralized, peer-to-peer web cache called Squirrel. The key idea is to enable web browsers on desktop machines to share their local caches, to form an efficient and scalable web cache, without the need for dedicated hardware and the associated administrative cost. We propose and evaluate decentralized web caching algorithms for Squirrel, and discover that it exhibits performance comparable to a centralized web cache in terms of hit ratio, bandwidth usage and latency. It also achieves the benefits of decentralization, such as being scalable, self-organizing and resilient to node failures, while imposing low overhead on the participating nodes.
Sitaram Iyer, Antony I. T. Rowstron, Peter Druschel
PODC1
2001 Anticipatory scheduling: A disk scheduling framework to overcome deceptive idleness in synchronous I/O
abstract
Disk schedulers in current operating systems are generally work-conserving, i.e., they schedule a request as soon as the previous request has finished. Such schedulers often require multiple outstanding requests from each process to meet system-level goals of performance and quality of service. Unfortunately, many common applications issue disk read requests in a synchronous manner, interspersing successive requests with short periods of computation. The scheduler chooses the next request too early; this induces deceptive idleness, a condition where the scheduler incorrectly assumes that the last request issuing process has no further requests, and becomes forced to switch to a request from another process.We propose the anticipatory disk scheduling framework to solve this problem in a simple, general and transparent way, based on the non-work-conserving scheduling discipline. Our FreeBSD implementation is observed to yield large benefits on a range of microbenchmarks and real workloads. The Apache webserver delivers between 29% and 71% more throughput on a disk-intensive workload. The Andrew filesystem benchmark runs faster by 8%, due to a speedup of 54% in its read-intensive phase. Variants of the TPC-B database benchmark exhibit improvements between 2% and 60%. Proportional-share schedulers are seen to achieve their contracts accurately and efficiently.
Sitaram Iyer, Peter Druschel
SOSP1