skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: PageCmp: Bandwidth Efficient Page Deduplication through In-memory Page Comparison
Award ID(s):
1725657 1910413 1718080
PAR ID:
10158381
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
2019 IEEE Computer Society Annual Symposium on VLSI
Page Range / eLocation ID:
82 to 87
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We study the black hole information problem within a semiclassicallygravitating AdS _d d black hole coupled to and in equilibrium with a d d -dimensionalthermal conformal bath. We deform the bath state by a relevant scalardeformation, triggering a holographic RG flow whose "trans-IR"region deforms from a Schwarzschild geometry to a Kasner universe. Thesetup manifests two independent scales which control both the extent ofcoarse-graining and the entanglement dynamics when counting Hawkingdegrees of freedom in the bath. In tuning either, we find nontrivialchanges to the Page time and Page curve. We consequently view the Pagecurve as a probe of the holographic RG flow, with a higher Page timemanifesting as a result of increased coarse-graining of the bath degreesof freedom. 
    more » « less
  2. Regionalization techniques group spatial areas into a set of homogeneous regions to analyze and draw conclusions about spatial phenomena. A recent regionalization problem, called MP-regions, groups spatial areas to produce a maximum number of regions by enforcing a user-defined constraint at the regional level. The MP-regions problem is NP-hard. Existing approximate algorithms for MP-regions do not scale for large datasets due to their high computational cost and inherently centralized approaches to process data. This article introduces a parallel scalable regionalization framework (PAGE) to support MP-regions on large datasets. The proposed framework works in two stages. The first stage finds an initial solution through randomized search, and the second stage improves this solution through efficient heuristic search. To build an initial solution efficiently, we extend traditional spatial partitioning techniques to enable parallelized region building without violating the spatial constraints. Furthermore, we optimize the region building efficiency and quality by tuning the randomized area selection to trade off runtime with region homogeneity. The experimental evaluation shows the superiority of our framework to support an order of magnitude larger datasets efficiently compared to the state-of-the-art techniques while producing high-quality solutions. 
    more » « less
  3. null (Ed.)