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

Kishore Atreya

dblp:198/2525 · DBLP profile ↗
← Back
2ranked-venue papers
0as 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 · 1Computer networks · 1Software engineering, systems software and programming languages · 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 networks
2 papers
Software-defined and programmable networks · 56% Internet architecture and protocols · 38% Routing and switching · 6%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › packet scheduling
fair queueing
0.312018
Approximating Fair Queueing on Reconfigurable Switches · NSDI 2018
Software-defined and programmable networks › programmable data plane
programmable switch
0.312018
Approximating Fair Queueing on Reconfigurable Switches · NSDI 2018
Internet architecture and protocols › information-centric networking
in-network caching
0.312017
IncBricks: Toward In-Network Computation with an In-Network Cache · ASPLOS 2017
Software-defined and programmable networks › programmable data plane
in-network computation
0.312017
IncBricks: Toward In-Network Computation with an In-Network Cache · ASPLOS 2017
Software-defined and programmable networks
programmable data plane
0.312017
IncBricks: Toward In-Network Computation with an In-Network Cache · ASPLOS 2017
Routing and switching
switch scheduling
0.112018
Approximating Fair Queueing on Reconfigurable Switches · NSDI 2018

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

in-network computation · 0.6in-network caching · 0.6
YearPublicationVenuePosition
2018 Approximating Fair Queueing on Reconfigurable Switches
Naveen Kr. Sharma, Ming Liu 0027, Kishore Atreya, Arvind Krishnamurthy
NSDI3
2017 IncBricks: Toward In-Network Computation with an In-Network Cache
abstract
The emergence of programmable network devices and the increasing data traffic of datacenters motivate the idea of in-network computation. By offloading compute operations onto intermediate networking devices (e.g., switches, network accelerators, middleboxes), one can (1) serve network requests on the fly with low latency; (2) reduce datacenter traffic and mitigate network congestion; and (3) save energy by running servers in a low-power mode. However, since (1) existing switch technology doesn't provide general computing capabilities, and (2) commodity datacenter networks are complex (e.g., hierarchical fat-tree topologies, multipath communication), enabling in-network computation inside a datacenter is challenging.
Ming Liu 0027, Jacob Nelson 0001, Luis Ceze, Arvind Krishnamurthy, Kishore Atreya
ASPLOS6