BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
low (36)
reduc (21)
memori (12)
time (12)
base (12)

Stem overhead$ (all stems)

110 papers:

DATEDATE-2015-ChenYCK #migration #named
PWL: a progressive wear leveling to minimize data migration overheads for nand flash devices (FHC, MCY, YHC, TWK), pp. 1209–1212.
PLDIPLDI-2015-MarrSD #metaprogramming #performance #protocol
Zero-overhead metaprogramming: reflection and metaobject protocols fast and without compromises (SM, CS, SD), pp. 545–554.
OOPSLAOOPSLA-2015-WangPW
Vectorization of apply to reduce interpretation overhead of R (HW, DAP, PW), pp. 400–415.
SACSAC-2015-YangCHCLK #performance
Reliability-aware striping with minimized performance overheads for flash-based storage devices (MCY, YMC, PCH, YHC, LJL, TWK), pp. 1906–1912.
HPCAHPCA-2015-LoCIS #monitoring #runtime #using
Run-time monitoring with adjustable overhead using dataflow-guided filtering (DL, TC, MI, GES), pp. 662–674.
PPoPPPPoPP-2015-DasSR #communication #concurrent #detection #program analysis #thread
Section based program analysis to reduce overhead of detecting unsynchronized thread communication (MD, GS, JR), pp. 283–284.
PPoPPPPoPP-2015-ZhangHCB #memory management #semantics #transaction
Low-overhead software transactional memory with progress guarantees and strong semantics (MZ, JH, MC, MDB), pp. 97–108.
SEFMSEFM-2014-HusterHERBKR #flexibility #invariant #specification
More Flexible Object Invariants with Less Specification Overhead (SH, PH, HE, JR, SB, TK, WR), pp. 302–316.
HPCAHPCA-2014-HuangHFS #concurrent #data transformation #detection #metadata #runtime
Low-overhead and high coverage run-time race detection through selective meta-data management (RCH, EH, AF, GES), pp. 96–107.
HPCAHPCA-2014-WangDDS #concurrent #memory management #multi #named #predict #source code #thread
DraMon: Predicting memory bandwidth usage of multi-threaded programs with high accuracy and low overhead (WW, TD, JWD, MLS), pp. 380–391.
DATEDATE-2013-LaiCAG #monitoring #named #online
SlackProbe: a low overhead in situ on-line timing slack monitoring methodology (LL, VC, RCA, PG), pp. 282–287.
DATEDATE-2013-SarrazinENBG #concurrent #design #detection #fault #performance
Scan design with shadow flip-flops for low performance overhead and concurrent delay fault detection (SS, SE, LAdBN, YB, VG), pp. 1077–1082.
PLDIPLDI-2013-LifflanderKK
Steal Tree: low-overhead tracing of work stealing schedulers (JL, SK, LVK), pp. 507–518.
SEFMSEFM-2013-WonischSW #monitoring #runtime
Zero Overhead Runtime Monitoring (DW, AS, HW), pp. 244–258.
CHICHI-2013-BrownMR #interactive #multi #named #network
MultiNet: reducing interaction overhead in domestic wireless networks (AB, RM, TR), pp. 1569–1578.
HCIHCI-UC-2013-YangRV #industrial #interactive
Principled Ways of Finding, Analysing and Planning for Communicative Overhead in Interaction Technology for Fashion Industry (JY, SR, SV), pp. 484–491.
SACSAC-2013-GroppeSW #embedded #xml
Eliminating the XML overhead in embedded XML languages (SG, BS, SW), pp. 542–547.
CGOCGO-2013-RodriguesCP #integer #performance #source code
A fast and low-overhead technique to secure programs against integer overflows (RER, VHSC, FMQP), p. 11.
CASECASE-2012-KaneshigeNUMT #algorithm #mobile #online
An algorithm for on-line path planning of autonomous mobile overhead traveling crane based on obstacle information (AK, SN, SU, TM, KT), pp. 914–919.
CASECASE-2012-TuanKL #3d #feedback
Partial Feedback Linearization Control of the three dimensional overhead crane (LAT, GHK, SGL), pp. 1198–1203.
DACDAC-2012-KelleyWSRH #interface
Removing overhead from high-level interfaces (KK, MW, JPS, SR, MH), pp. 783–789.
SEFMSEFM-2012-VorobyovKS #approach #data flow #security
A Low-Overhead, Value-Tracking Approach to Information Flow Security (KV, PK, PS), pp. 367–381.
ICPRICPR-2012-AhmedC #detection #robust
A robust person detector for overhead views (IA, JNC), pp. 1483–1486.
DACDAC-2011-PaulaNNOH #named
TAB-BackSpace: unlimited-length trace buffers with zero additional on-chip overhead (FMdP, AN, ZN, AO, AJH), pp. 411–416.
CIKMCIKM-2011-GaoXHCH #named #transaction
PCMLogging: reducing transaction logging overhead with PCM (SG, JX, BH, BC, HH), pp. 2401–2404.
GPCEGPCE-J-2005-CaretteK11 #abstraction #monad #multi #programming
Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code (JC, OK), pp. 349–375.
POPLPOPL-2011-BenderskyP #bound #memory management
Space overhead bounds for dynamic memory management with partial compaction (AB, EP), pp. 475–486.
ISMMISMM-2011-MajoG #manycore #memory management
Memory management in NUMA multicore systems: trapped between cache contention and interconnect overhead (ZM, TRG), pp. 11–20.
LCTESLCTES-2011-ThomasFK #execution #monitoring
Lowering overhead in sampling-based execution monitoring and tracing (JJT, SF, DK), pp. 101–110.
PPoPPPPoPP-2011-ZhengRQA #detection #gpu #named #source code
GRace: a low-overhead mechanism for detecting data races in GPU programs (MZ, VTR, FQ, GA), pp. 135–146.
ICLPICLP-2011-WangS
Minimizing the overheads of dependent {AND}-parallelism (PW, ZS), pp. 128–138.
DATEDATE-2010-PenolazziSH #energy #operating system #performance #predict #realtime
Predicting energy and performance overhead of Real-Time Operating Systems (SP, IS, AH), pp. 15–20.
SIGMODSIGMOD-2010-JonesAM #concurrent #database #in memory #memory management
Low overhead concurrency control for partitioned main memory databases (EPCJ, DJA, SM), pp. 603–614.
HPCAHPCA-2010-GreskampKT #configuration management #multi #named #performance #thread
LeadOut: Composing low-overhead frequency-enhancing techniques for single-thread performance in configurable multicores (BG, URK, JT), pp. 1–12.
HPCAHPCA-2010-JafriTV #named #transaction
LiteTM: Reducing transactional state overhead (SARJ, MT, TNV), pp. 1–12.
DATEDATE-2009-GhoseGDAW #architecture #detection #memory management
Architectural support for low overhead detection of memory violations (SG, LG, PD, AA, CW), pp. 652–657.
DATEDATE-2009-LoiAB #configuration management #interface #network #synthesis
Synthesis of low-overhead configurable source routing tables for network interfaces (IL, FA, LB), pp. 262–267.
ICEISICEIS-SAIC-2009-Bogelsack #enterprise #performance
Performance Overhead of ERP Systems in Paravirtualized Environments (AB), pp. 200–207.
CGOCGO-2009-SpearMSW #memory management #transaction
Reducing Memory Ordering Overheads in Software Transactional Memory (MFS, MMM, MLS, PW), pp. 13–24.
ICSTICST-2009-LeitnerPMMO #effectiveness #on the
On the Effectiveness of Test Extraction without Overhead (AL, AP, SM, BM, MO), pp. 416–425.
CASECASE-2008-XiaoW #anti #evaluation #simulation
Simulation and effects evaluation of anti-galloping devices for overhead transmission lines (XX, JW), pp. 808–813.
DATEDATE-2008-ChoudhuryM #approximate #concurrent #detection #fault #logic
Approximate logic circuits for low overhead, non-intrusive concurrent error detection (MRC, KM), pp. 903–908.
DATEDATE-2008-GhoshNR #adaptation #fault tolerance #novel #using
A Novel Low Overhead Fault Tolerant Kogge-Stone Adder Using Adaptive Clocking (SG, PN, KR), pp. 366–371.
STOCSTOC-2008-IshaiKOS #constant #encryption
Cryptography with constant computational overhead (YI, EK, RO, AS), pp. 433–442.
SACSAC-2008-ChengC #monitoring #named #programmable #thread
SoftMon: programmable software monitoring with minimum overhead by helper-threading (YPC, HSC), pp. 741–747.
ISMMISMM-2008-PizloPS #execution
Path specialization: reducing phased execution overheads (FP, EP, BS), pp. 81–90.
DATEDATE-2007-GhoshBR #adaptation #scheduling #synthesis #using
Low-overhead circuit synthesis for temperature adaptation using dynamic voltage scheduling (SG, SB, KR), pp. 1532–1537.
ICSMEICSM-2007-PentaHAQ #approach #communication #maintenance #search-based
The Effect of Communication Overhead on Software Maintenance Project Staffing: a Search-Based Approach (MDP, MH, GA, FQ), pp. 315–324.
HPCAHPCA-2007-GaneshJWJ #architecture #comprehension #memory management #scalability
Fully-Buffered DIMM Memory Architectures: Understanding Mechanisms, Overheads and Scaling (BG, AJ, DW, BLJ), pp. 109–120.
HPCAHPCA-2007-PascualGAD #architecture #fault tolerance #protocol
A Low Overhead Fault Tolerant Coherence Protocol for CMP Architectures (RFP, JMG, MEA, JD), pp. 157–168.
PPoPPPPoPP-2007-MohrorK #case study #clustering #linux
A study of tracing overhead on a high-performance linux cluster (KM, KLK), pp. 158–159.
SOSPSOSP-2007-HendricksGR #fault tolerance
Low-overhead byzantine fault-tolerant storage (JH, GRG, MKR), pp. 73–86.
DATEDATE-2006-QuSN #configuration management #parallel #runtime
A parallel configuration model for reducing the run-time reconfiguration overhead (YQ, JPS, JN), pp. 965–969.
KDDKDD-2006-KonigB #categorisation
Reducing the human overhead in text categorization (ACK, EB), pp. 598–603.
SACSAC-2006-HeoCJK #incremental
The overhead model of word-level and page-level incremental checkpointing (JH, YC, GJ, HK), pp. 1493–1494.
ICSEICSE-2006-DhurjatiA #array #bound #c
Backwards-compatible array bounds checking for C with very low overhead (DD, VSA), pp. 162–171.
ASPLOSASPLOS-2006-ReddyRP #comprehension #fault tolerance #predict #thread
Understanding prediction-based partial redundant threading for low-overhead, high- coverage fault tolerance (VKR, ER, SP), pp. 83–94.
CGOCGO-2006-ZhangZP #compilation #optimisation #security
Compiler Optimizations to Reduce Security Overhead (TZ, XZ, SP), pp. 346–357.
HPCAHPCA-2006-Prvulovic #concurrent #detection #effectiveness #named
CORD: cost-effective (and nearly overhead-free) order-recording and data race detection (MP), pp. 232–243.
ISMMISMM-2006-McGacheyH
Reducing generational copy reserve overhead with fallback compaction (PM, ALH), pp. 17–28.
DATEDATE-2005-BhuniaMRR #novel #testing
A Novel Low-overhead Delay Testing Technique for Arbitrary Two-Pattern Test Application (SB, HMM, AR, KR), pp. 1136–1141.
DATEDATE-2005-ResanoMC #configuration management #hardware #heuristic #hybrid #runtime #scheduling
A Hybrid Prefetch Scheduling Heuristic to Minimize at Run-Time the Reconfiguration Overhead of Dynamically Reconfigurable Hardware (JR, DM, FC), pp. 106–111.
PASTEPASTE-2005-KumarCS #monitoring #profiling
Low overhead program monitoring and profiling (NK, BRC, MLS), pp. 28–34.
SEKESEKE-2005-ChanCT #adaptation #random testing #reduction #testing
Adaptive Random Testing with Filtering: An Overhead Reduction Technique (KPC, TYC, DT), pp. 292–299.
GPCEGPCE-2005-CaretteK #abstraction #monad #multi #programming
Multi-stage Programming with Functors and Monads: Eliminating Abstraction Overhead from Generic Code (JC, OK), pp. 256–274.
HPCAHPCA-2005-CorlissLR #debugging #interactive
Low-Overhead Interactive Debugging via Dynamic Instrumentation with DISE (MLC, ECL, AR), pp. 303–314.
DACDAC-2004-ResanoM #configuration management #hardware #scheduling
Specific scheduling support to minimize the reconfiguration overhead of dynamically reconfigurable hardware (JR, DM), pp. 119–124.
DATEDATE-v1-2004-AndreiSEPA #energy #reduction
Overhead-Conscious Voltage Selection for Dynamic and Leakage Energy Reduction of Time-Constrained Systems (AA, MTS, PE, ZP, BMAH), pp. 518–525.
DATEDATE-v2-2004-GoudarziHM #implementation #modelling #morphism #object-oriented #polymorphism
Overhead-Free Polymorphism in Network-on-Chip Implementation of Object-Oriented Models (MG, SH, AM), pp. 1380–1381.
DATEDATE-v2-2004-WangLC #fault #hardware #hybrid #testing
Hybrid Delay Scan: A Low Hardware Overhead Scan-Based Delay Test Technique for High Fault Coverage and Compact Test Sets (SW, XL, STC), pp. 1296–1301.
VLDBVLDB-2004-SardaH #optimisation #query
Green Query Optimization: Taming Query Optimization Overheads through Plan Recycling (PS, JRH), pp. 1333–1336.
STOCSTOC-2004-ChlebusKS #worst-case
Collective asynchronous reading with polylogarithmic worst-case overhead (BSC, DRK, AAS), pp. 321–330.
SACSAC-2004-CugolaFMP #configuration management
Minimizing the reconfiguration overhead in content-based publish-subscribe (GC, DF, ALM, GPP), pp. 1134–1140.
ASPLOSASPLOS-2004-HauswirthC #adaptation #detection #memory management #profiling #statistics #using
Low-overhead memory leak detection using adaptive statistical profiling (MH, TMC), pp. 156–164.
CGOCGO-2004-JoshiBZ #optimisation #profiling #staged
Targeted Path Profiling: Lower Overhead Path Profiling for Staged Dynamic Optimization Systems (RJ, MDB, CBZ), pp. 239–250.
DATEDATE-2003-LvHLW #encoding
Enhancing Signal Integrity through a Low-Overhead Encoding Scheme on Address Buses (TL, JH, HL, WW), pp. 10542–10549.
SIGMODSIGMOD-2003-SengarH #named #optimisation #query
PLASTIC: Reducing Query Optimization Overheads through Plan Recycling (VSS, JRH), p. 676.
DLTDLT-2003-HemaspaandraMT
Computation with Absolutely No Space Overhead (LAH, PM, TT), pp. 325–336.
OOPSLAOOPSLA-2003-SachindranEM #garbage collection #named #performance
Mark-copy: fast copying GC with less space overhead (NS, JEBM), pp. 326–343.
POPLPOPL-2003-BaconCR #consistency #garbage collection #realtime
A real-time garbage collector with low overhead and consistent utilization (DFB, PC, VTR), pp. 285–298.
DATEDATE-2002-GonciariAN #testing
Improving Compression Ratio, Area Overhead, and Test Application Time for System-on-a-Chip Test Data Compression/Decompression (PTG, BMAH, NN), pp. 604–611.
DATEDATE-2001-HuangM #configuration management #design #network #using
Managing dynamic reconfiguration overhead in systems-on-a-chip design using reconfigurable datapaths and optimized interconnection networks (ZH, SM), p. 735.
ICPRICPR-v1-2000-CohenGH #recognition
Vision-Based Overhead View Person Recognition (IC, AG, TSH), pp. 5119–5124.
CCCC-2000-UhWWJBC #effectiveness
Techniques for Effectively Exploiting a Zero Overhead Loop Buffer (GRU, YW, DBW, SJ, CB, VC), pp. 157–172.
CCCC-2000-YuR #parallel #runtime
Techniques for Reducing the Overhead of Run-Time Parallelization (HY, LR), pp. 232–248.
HPCAHPCA-2000-BurnsG #layout #question #smt
Quantifying the SMT Layout Overhead — Does SMT Pull Its Weight? (JB, JLG), pp. 109–120.
OSDIOSDI-2000-KimCKNMCK
A Low-Overhead, High-Performance Unified Buffer Management Scheme That Exploits Sequential and Looping References (JMK, JC, JK, SHN, SLM, YC, CSK), pp. 119–134.
DACDAC-1999-BeniniMMPS #communication #interface #power management #synthesis
Synthesis of Low-Overhead Interfaces for Power-Efficient Communication over Wide Buses (LB, AM, EM, MP, RS), pp. 128–133.
LCTESLCTES-1999-UhWWJBC #effectiveness
Effective Exploitation of a Zero Overhead Loop Buffer (GRU, YW, DBW, SJ, CB, VC), pp. 10–19.
CSCWCSCW-1998-BrandenburgBDLRR #collaboration #framework #named
Artefact: A Framework for Low-Overhead Web-Based Collaborative Systems (JLB, BB, TD, JL, DR, TR), pp. 189–196.
ICPRICPR-1998-PhilominHD #automation #recognition
Appearance-based automatic target recognition in overhead LADAR range imagery (VP, DH, LSD), pp. 1320–1324.
SIGIRSIGIR-1998-VoM
Compressed Inverted Files with Reduced Decoding Overheads (VNA, AM), pp. 290–297.
DACDAC-1997-ChangLMAC #approach #synthesis
A Test Synthesis Approach to Reducing BALLAST DFT Overhead (DC, MTCL, MMS, TA, KTC), pp. 466–471.
DATEEDTC-1997-BhattacharyaDS #testing
An RTL methodology to enable low overhead combinational testing (SB, SD, BS), pp. 146–152.
SACSAC-1997-LiMII #communication
Booking heterogeneous processor resources to reduce communication overhead (DL, AM, YI, NI), pp. 354–360.
HPCAHPCA-1997-DahlgrenL #multi
Reducing the Replacement Overhead in Bus-Based COMA Multiprocessors (FD, AL), pp. 14–23.
HPCAHPCA-1997-DaoYD #architecture #communication #multi #network
Architectural Support for Reducing Communication Overhead in Multiprocessor Interconnection Networks (BVD, SY, JD), pp. 343–352.
HPCAHPCA-1997-Sivasubramaniam #communication #memory management #multi
Reducing the Communication Overhead of Dynamic Applications on Shared Memory Multiprocessors (AS), pp. 194–203.
DACDAC-1996-IyerK #architecture #named #self #synthesis
Introspection: A Low Overhead Binding Technique During Self-Diagnosing Microarchitecture Synthesis (BI, RK), pp. 137–142.
ASPLOSASPLOS-1996-BianchiniKPMAA #communication #latency
Hiding Communication Latency and Coherence Overhead in Software DSMs (RB, LIK, RP, MDM, MA, CLdA), pp. 198–209.
ASPLOSASPLOS-1996-ScalesGT #approach #memory management #named
Shasta: A Low Overhead, Software-Only Approach for Supporting Fine-Grain Shared Memory (DJS, KG, CAT), pp. 174–185.
DACDAC-1995-ParulkarGB #design
Data Path Allocation for Synthesizing RTL Designs with Low BIST Area Overhead (IP, SKG, MAB), pp. 395–401.
HPDCHPDC-1995-SterlingSBFO #communication #parallel
Communication Overhead for Space Science Applications on the Beowulf Parallel Workstation (TLS, DS, DJB, BF, KO), pp. 23–30.
DATEEDAC-1994-MichelLSDC #dependence
Taking Advantage of ASICs to Improve Dependability with Very Low Overheads (TM, RL, GS, RD, PC), pp. 14–18.
VLDBVLDB-1994-JohnsonS #algorithm #named #performance
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm (TJ, DS), pp. 439–450.
OOPSLAOOPSLA-1994-BogleL #using
Reducing Cross Domain Call Overhead using Batched Futures (PB, BL), pp. 341–354.
POPLPOPL-1994-CalderG #c++ #source code
Reducing Indirect Function call Overhead in C++ Programs (BC, DG), pp. 397–408.
ASPLOSASPLOS-1994-KaramchetiC #question
Software Overhead in Messaging Layers: Where Does the Time Go? (VK, AAC), pp. 51–60.
HTHT-1991-Wright
Cognitive Overheads and Prostheses: Some Issues in Evaluating Hypertexts (PW), pp. 1–12.
ICSEICSE-1981-Forman #on the #traversal
On the Time Overhead of Counters and Traversal Markers (IRF), pp. 164–169.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.