skip to main content
Explore Scholarly Publications and Datasets in the NSF-PAR

  • Home
  • Search Results
  • Page 1 of 4

Search for: All records

Creators/Authors contains: "Agrawal, Kunal"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; ( , Journal of Parallel and Distributed Computing)
    Free, publicly-accessible full text available April 1, 2023
  2. ; ; ; ; ; ( , 022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX))
    Free, publicly-accessible full text available January 9, 2023
  3. ; ; ( , Symposium on Parallelism in Algorithms and Architectures)
    null (Ed.)
    Free, publicly-accessible full text available July 6, 2022
  4. ; ; ; ; ; ( , Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures)
    Free, publicly-accessible full text available July 6, 2022
  5. ; ; ; ( , 27th IEEE INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING, DATA, & ANALYTICS)
    Accepted Manuscript Full Text Available
  6. ; ; ; ( , HiPC)
    Full Text Available 
  7. ; ; ; ; ; ( , Proceedings of the annual ACMSIAM symposium on discrete algorithms)
    Full Text Available 
  8. ; ; ; ( , ICCAD)
    Accepted Manuscript Full Text Available
  9. ; ; ; ; ; ( , Proceedings of the annual ACMSIAM symposium on discrete algorithms)
    In the parallel paging problem, there are p processors that share a cache of size k. The goal is to partition the cache among the processors over time in order to minimize their average completion time. For this long-standing open problem, we give tight upper and lower bounds of ⇥(log p) on the competitive ratio with O(1) resource augmentation. A key idea in both our algorithms and lower bounds is to relate the problem of parallel paging to the seemingly unrelated problem of green paging. In green paging, there is an energy-optimized processor that can temporarily turn off one ormore »more of its cache banks (thereby reducing power consumption), so that the cache size varies between a maximum size k and a minimum size k/p. The goal is to minimize the total energy consumed by the computation, which is proportional to the integral of the cache size over time. We show that any efficient solution to green paging can be converted into an efficient solution to parallel paging, and that any lower bound for green paging can be converted into a lower bound for parallel paging, in both cases in a black-box fashion. We then show that, with O(1) resource augmentation, the optimal competitive ratio for deterministic online green paging is ⇥(log p), which, in turn, implies the same bounds for deterministic online parallel paging.« less
    Accepted Manuscript Full Text Available
  10. ; ; ; ; ( , RTSS)
    Full Text Available