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.

Jayaram Mudigonda

dblp:53/1490 · DBLP profile ↗
← Back
10ranked-venue papers
6as first author
0since 2021 · last 2013
—ORCID · none

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

Computer networks · 6 · 4 first-authorSystems, architecture and hardware · 3 · 2 first-authorSoftware engineering, systems software and programming languages · 2 · 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 networks
5 papers
Internet architecture and protocols · 36% Datacenter networks · 23% Network optimization and economics · 19%
Computer architecture, parallel and distributed computing, and storage systems
4 papers
Cloud and datacenter computing · 57% Memory systems · 39% Interconnection networks and networks-on-chip · 4%

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

TopicWeightPapersLastEvidence papers
Memory systems
cache
0.122007
Reconciling performance and programmability in networking systems · SIGCOMM 2007
Managing memory access latency in packet processing · SIGMETRICS 2005
Network optimization and economics › network design
network topology design
0.112011
Taming the Flying Cable Monster: A Topology Design and Optimization Framework for Data-Center Networks · USENIX ATC 2011
Internet of things and sensor networks › topology control
topology optimization
0.112011
Taming the Flying Cable Monster: A Topology Design and Optimization Framework for Data-Center Networks · USENIX ATC 2011
Cloud and datacenter computing › datacenter network
datacenter network architecture
0.112011
NetLord: a scalable multi-tenant network architecture for virtualized datacenters · SIGCOMM 2011
Cloud and datacenter computing › multi-tenancy
multi-tenant datacenter network
0.112011
NetLord: a scalable multi-tenant network architecture for virtualized datacenters · SIGCOMM 2011
Internet architecture and protocols › local area network
ethernet
0.122010
High-performance ethernet-based communications for future multi-core processors · SC 2007
SPAIN: COTS Data-Center Ethernet for Multipathing over Arbitrary Topologies · NSDI 2010
Internet architecture and protocols
network interface card
0.112007
High-performance ethernet-based communications for future multi-core processors · SC 2007
Memory systems
memory wall
0.112007
Reconciling performance and programmability in networking systems · SIGCOMM 2007
Internet architecture and protocols
packet processing
0.112005
Managing memory access latency in packet processing · SIGMETRICS 2005
Datacenter networks
data center network topology
0.012011
Taming the Flying Cable Monster: A Topology Design and Optimization Framework for Data-Center Networks · USENIX ATC 2011
Cloud and datacenter computing › datacenter architecture
virtualized datacenter
0.012011
NetLord: a scalable multi-tenant network architecture for virtualized datacenters · SIGCOMM 2011
Interconnection networks and networks-on-chip
cluster interconnect
0.012007
High-performance ethernet-based communications for future multi-core processors · SC 2007

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

hardware-software co-design · 0.1architectural simulation · 0.1optimization · 0.1measurement · 0.1cache performance analysis · 0.1
YearPublicationVenuePosition
2013 Corybantic: towards the modular composition of SDN control programs
abstract
Software-Defined Networking (SDN) promises to enable vigorous innovation, through separation of the control plane from the data plane, and to enable novel forms of network management, through a controller that uses a global view to make globally-valid decisions. The design of SDN controllers creates novel challenges; much previous work has focused on making them scalable, reliable, and efficient.
Jeffrey C. Mogul, Alvin AuYoung, Sujata Banerjee, Lucian Popa 0002, Jeongkeun Lee, Jayaram Mudigonda, Puneet Sharma 0001, Yoshio Turner
HotNets6
2013 The NIC Is the Hypervisor: Bare-Metal Guests in IaaS Clouds
Jeffrey C. Mogul, Jayaram Mudigonda, Jose Renato Santos, Yoshio Turner
HotOS2
2011 NetLord: a scalable multi-tenant network architecture for virtualized datacenters
abstract
Providers of "Infrastructure-as-a-Service" need datacenter networks that support multi-tenancy, scale, and ease of operation, at low cost. Most existing network architectures cannot meet all of these needs simultaneously.
Jayaram Mudigonda, Praveen Yalagandula, Jeffrey C. Mogul, Bryan Stiekes, Yanick Pouffary
SIGCOMM1
2011 Taming the Flying Cable Monster: A Topology Design and Optimization Framework for Data-Center Networks
Jayaram Mudigonda, Praveen Yalagandula, Jeffrey C. Mogul
USENIX ATC1
2010 sNICh: efficient last hop networking in the data center
abstract
Virtualization has fundamentally changed the data center network. The last hop of the network is no longer handled by a physical network switch, but rather is typically performed in software inside the server to switch among virtual machines hosted by that server.
Kaushik Kumar Ram, Jayaram Mudigonda, Alan L. Cox, Scott Rixner, Parthasarathy Ranganathan, Jose Renato Santos
ANCS2
2010 SPAIN: COTS Data-Center Ethernet for Multipathing over Arbitrary Topologies
Jayaram Mudigonda, Praveen Yalagandula, Mohammad Al-Fares, Jeffrey C. Mogul
NSDI1
2007 High-performance ethernet-based communications for future multi-core processors
abstract
Data centers and HPC clusters often incorporate specialized networking fabrics to satisfy system requirements. However, Ethernet's low cost and high performance are causing a shift from specialized fabrics toward standard Ethernet. Although Ethernet's low-level performance approaches that of specialized fabrics, the features that these fabrics provide such as reliable in-order delivery and flow control are implemented, in the case of Ethernet, by endpoint hardware and software. Unfortunately, current Ethernet endpoints are either slow (commodity NICs with generic TCP/IP stacks) or costly (offload engines). To address these issues, the JNIC project developed a novel Ethernet endpoint. JNIC's hardware and software were specifically designed for the requirements of high-performance communications within future data-centers and compute clusters. The architecture combines capabilities already seen in advanced network architectures with new innovations to create a comprehensive solution for scalable and high-performance Ethernet. We envision a JNIC architecture that is suitable for most in-data-center communication needs.
Mike Schlansker, Bhushan Chitlur, Erwin Oertli, Paul M. Stillwell Jr., Linda Rankin, Dennis Bradford, Richard J. Carter, Jayaram Mudigonda, Nathan L. Binkert, Norman P. Jouppi
SC8
2007 Reconciling performance and programmability in networking systems
abstract
Challenges in addressing the memory bottleneck have made it difficult to design a packet processing platform that simultaneously achieves both ease-of-programming and high performance. Today's commercial processors support two architectural mechanisms - namely, hardware multithreading and caching - to overcome the memory bottleneck. The configurations of these mechanisms (e.g., cache capacity, number of threads per processor core) are fixed at processor-design time. The relative effectiveness of these mechanisms, however, varies significantly with application, traffic, and system characteristics. Thus, programmers often struggle to achieve high performance from a processor that is not well-suited to a particular deployment.
Jayaram Mudigonda, Harrick M. Vin, Stephen W. Keckler
SIGCOMM1
2005 Overcoming the memory wall in packet processing: hammers or ladders?
abstract
Overhead of memory accesses limits the performance of packet processing applications. To overcome this bottleneck, today's network processors can utilize a wide-range of mechanisms-such as multi-level memory hierarchy, wide-word accesses, special-purpose result-caches, asynchronous memory, and hardware multi-threading. However, supporting all of these mechanisms complicates programmability and hardware design, and wastes systemresources. In this paper, we address the following fundamental question: what minimal set of hardware mechanisms must a network processor support to achieve the twin goals of simplified programmability and high packet throughput? We show that no single mechanism sufficies; the minimal set must include data-caches and multi-threading. Data-caches and multi-threading are complementary; whereas data-caches exploit locality to reduce the number of context-switches and the off-chip memory bandwidth requirement, multi-threading exploits parallelism to hide long cache-miss latencies.
Jayaram Mudigonda, Harrick M. Vin, Raj Yavatkar
ANCS1
2005 Managing memory access latency in packet processing
abstract
In this study, we refute the popular belief [1,2] that packet processing does not benefit from data-caching. We show that a small data-cache of 8KB can bring down the packet processing time by much as 50-90%, while reducing the off-chip memory bandwidth usage by about 60-95%. We also show that, unlike general-purpose computing, packet processing, due to its memory-intensive nature, cannot rely exclusively on data-caching to eliminate the memory bottleneck completely.
Jayaram Mudigonda, Harrick M. Vin, Raj Yavatkar
SIGMETRICS1