586 Abstract Placement Algorithms for Hierarchical Cooperative Caching (2008)
Madhukar R. Korupolu, C. Greg, Plaxton Rajmohan Rajaramant
Consider a hierarchical network of machines in which each machine periodically issues a request for an object drawn from a fixed set of unit-size objects. Suppose further that the following...
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
Consider a hierarchical network in which each node periodically issues a request for an object drawn from a fixed set of unit-size objects. Suppose further that the following conditions are...
Abstract Exact Tree-based FPGA Technology Mapping for Logic Blocks with Independent LUTs (2007)
Madhukar R. Korupolu, K. K. Lee, D. F. Wong
The logic blocks (CLBs) of a lookup table (LUT) based FPGA consist of one or more LUTs, possibly of di erent sizes. In this paper, we focus on technology mapping for CLBs with several independent...
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
Consider a hierarchical network in which each node periodically issues a request for an object drawn from a xed set of unit-size objects. Suppose further that the following conditions are satised:...
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
Consider a hierarchical network in which each node periodically issues a request for an object drawn from a fixed set of unit-size objects. Suppose further that the following conditions are...
Algorithms (design, analysis, and implementation), data management, and distributed systems. Other interests include cryptography and network security.
Placement Algorithms for (2001)
Hierarchical Cooperative Caching, Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
Consider a hierarchical network in which each node periodically issues a request for an object drawn from a xed set of unit-size objects. Suppose further that the following conditions are satis ed:...
Analysis of a Local Search Heuristic for Facility Location Problems (2000)
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
In this paper, we study approximation algorithms for several NP-hard facility location problems.
Coordinated placement and replacement for large-scale distributed caches (1999)
Madhukar R. Korupolu, Michael Dahlin
In a large-scale information system such as a digital library or the web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions. In this paper, we...
Coordinated placement and replacement for large-scale distributed caches (1999)
Madhukar R. Korupolu, Michael Dahlin
In a large-scale information system such as a digital library or the web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions. Using simulation,...
Placement Algorithms for Hierarchical Cooperative Caching (1999)
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
Consider a hierarchical network of machines in which each machine periodically issues a request for an object drawn from a fixed set of unit-size objects. Suppose further that the following...
Placement Algorithms for Hierarchical Cooperative Caching (1999)
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
z
Analysis of a local search heuristic for facility location problems (1998)
Madhukar R. Korupolu, C. Greg, Plaxton Rajmohan Rajaraman
In this paper, we study approximation algorithms for several NP-hard facility location problems. We prove that a simple local search heuristic yields polynomial-time constant-factor approximation...
Analysis of a local search heuristic for facility location problems (1998)
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
In this paper, we study approximation algorithms for several NP-hard facility location problems. We prove that a simple local search heuristic yields polynomialtime constant-factor approximation...
Analysis of a local search heuristic for facility location problems (1998)
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
In this paper, we study approximation algorithms for several NP-hard facility location problems. We prove that a simple local search heuristic yields polynomialtime constant-factor approximation...
Analysis of a Local Search Heuristic for Facility Location Problems (1998)
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
In this paper, we study approximation algorithms for several NP-hard facility location problems. We prove that a simple local search heuristic yields polynomial-time constant-factor approximation...
Coordinated Placement and Replacement for Large-Scale Distributed Caches (1998)
Madhukar R. Korupolu, Michael Dahlin
In a large-scale information system such as a digital library or the web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions. In this paper, we...
Exact tree-based fpga technology mapping for logic blocks with independent luts (1998)
Madhukar R. Korupolu, K. K. Lee, D. F. Wong
The logic blocks (CLBs) of a lookup table (LUT) based FPGA consist of one or more LUTs, possibly of di erent sizes. In this paper, we focus on technology mapping for CLBs with several independent...