Sciweavers

11231 search results - page 1862 / 2247
» Digging for Data Structures
Sort
View
WWW
2001
ACM
16 years 5 months ago
XEBRA: The Design and Implementation of Integrated Programming Environment for XML Processing and Browsing
We present the design and implementation of XEBRA system. XEBRA is an integrated programming environment for XML processing and browsing on which users can build their own XML pro...
Norio Toyama, Yasuyuki Hirakawa, Takashi Hattori, ...
ASPLOS
2009
ACM
16 years 5 months ago
Leak pruning
Managed languages improve programmer productivity with type safety and garbage collection, which eliminate memory errors such as dangling pointers, double frees, and buffer overfl...
Michael D. Bond, Kathryn S. McKinley
PPOPP
2009
ACM
16 years 5 months ago
Comparability graph coloring for optimizing utilization of stream register files in stream processors
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...
Xuejun Yang, Li Wang, Jingling Xue, Yu Deng, Ying ...
PPOPP
2009
ACM
16 years 5 months ago
How much parallelism is there in irregular applications?
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
Milind Kulkarni, Martin Burtscher, Rajeshkar Inkul...
SPAA
2009
ACM
16 years 5 months ago
Inherent limitations on disjoint-access parallel implementations of transactional memory
Transactional memory (TM) is a promising approach for designing concurrent data structures, and it is essential to develop better understanding of the formal properties that can b...
Hagit Attiya, Eshcar Hillel, Alessia Milani
« Prev « First page 1862 / 2247 Last » Next »