21 papers:
- DAC-2015-IsmailLS #performance #worst-case
- Improving worst-case cache performance through selective bypassing and register-indexed cache (MI, DL, GES), p. 6.
- STOC-2015-CousinsV #algorithm
- Bypassing KLS: Gaussian Cooling and an O^*(n3) Volume Algorithm (BC, SV), pp. 539–548.
- HPCA-2015-XieLWSW #coordination
- Coordinated static and dynamic cache bypassing for GPUs (XX, YL, YW, GS, TW), pp. 76–88.
- ICALP-v2-2014-Parter #hybrid
- Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners (MP), pp. 608–619.
- SEKE-2014-ZhuangZL #fine-grained #framework #layout #reuse #runtime
- Runtime Code Reuse Attacks: A Dynamic Framework Bypassing Fine-Grained Address Space Layout Randomization (YZ, TZ, ZL), pp. 609–614.
- ICST-2011-MouelhiTABG #testing #web
- Tailored Shielding and Bypass Testing of Web Applications (TM, YLT, EA, BB, SG), pp. 210–219.
- OSDI-2010-WuCY #execution
- Bypassing Races in Live Applications with Execution Filters (JW, HC, JY), pp. 135–149.
- KDD-2008-SarmaGI #query #using
- Bypass rates: reducing query abandonment using negative inferences (ADS, SG, SI), pp. 177–185.
- ICST-2008-OffuttWO #case study #industrial #testing #web
- An Industrial Case Study of Bypass Testing on Web Applications (JO, QW, JJO), pp. 465–474.
- DATE-2007-ZhuSD #functional #interactive #pipes and filters #validation
- Interactive presentation: Functional and timing validation of partially bypassed processor pipelines (QZ, AS, ND), pp. 1164–1169.
- DATE-2006-ParkESNDP #automation #embedded #generative #performance
- Automatic generation of operation tables for fast exploration of bypasses in embedded processors (SP, EE, AS, AN, ND, YP), pp. 1197–1202.
- LCTES-2006-ParkSDNPE #reduction #scheduling
- Bypass aware instruction scheduling for register file power reduction (SP, AS, NDD, AN, YP, EE), pp. 173–181.
- DATE-2005-ShrivastavaDNE #embedded #framework #named
- PBExplore: A Framework for Compiler-in-the-Loop Exploration of Partial Bypassing in Embedded Processors (AS, NDD, AN, EE), pp. 1264–1269.
- STOC-2004-Talwar #algorithm #metric
- Bypassing the embedding: algorithms for low dimensional metrics (KT), pp. 281–290.
- HPCA-2002-BrownP #pipes and filters #using
- Using Internal Redundant Representations and Limited Bypass to Support Pipelined Adders and Register Files (MDB, YNP), pp. 289–298.
- VLDB-2001-WaasCB #approach #interactive #named #query #similarity
- FeedbackBypass: A New Approach to Interactive Similarity Query Processing (IB, PC, FW), pp. 201–210.
- HPDC-2000-ThainL #execution #named
- Bypass: A Tool for Building Split Execution Systems (DT, ML), pp. 79–86.
- DATE-1998-NouraniP #fault #testing
- A Bypass Scheme for Core-Based System Fault Testing (MN, CAP), pp. 979–980.
- VLDB-1995-SteinbrunnPMK #query
- Bypassing Joins in Disjunctive Queries (MS, KP, GM, AK), pp. 228–238.
- PLDI-1989-ChiD #liveness #using
- Unified Management of Registers and Cache Using Liveness and Cache Bypass (CHC, HGD), pp. 344–355.
- POPL-1986-Hoover #attribute grammar
- Dynamically Bypassing Copy Rule Chains in Attribute Grammars (RH), pp. 14–25.