Sciweavers

11784 search results - page 93 / 2357
» Interpolation for data structures
Sort
View
SPAA
2010
ACM
14 years 11 months ago
A universal construction for wait-free transaction friendly data structures
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
Phong Chuong, Faith Ellen, Vijaya Ramachandran
MICRO
2009
IEEE
326views Hardware» more  MICRO 2009»
15 years 5 months ago
DDT: design and evaluation of a dynamic program analysis for optimizing data structure usage
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...
Changhee Jung, Nathan Clark
DATE
2005
IEEE
105views Hardware» more  DATE 2005»
15 years 4 months ago
Mutation Sampling Technique for the Generation of Structural Test Data
Our goal is to produce validation data that can be used as an efficient (pre) test set for structural stuck-at faults. In this paper, we detail an original test-oriented mutation ...
Mathieu Scholivé, Vincent Beroulle, Chantal...
ICCNMC
2005
Springer
15 years 4 months ago
Data Structure Optimization of AS_PATH in BGP
With the fast growing size and complexity of core network, the hash based data structure of current AS_PATH implementation in BGP is facing challenges in performance, mainly caused...
Weirong Jiang
AADEBUG
1997
Springer
15 years 3 months ago
Assertions for Dynamic Shape Analysis of List Data Structures
We introduce an assertion language for run-time checking of linked list data structure shapes. The assertion language is expressive enough to define characteristic predicates for ...
Mikhail Auguston, Miu Har Hon