Sciweavers

2642 search results - page 76 / 529
» Merge-by-Wire: Algorithms and System Support
Sort
View
PPOPP
2009
ACM
16 years 2 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
COOPIS
2004
IEEE
15 years 5 months ago
A Framework for Prototyping J2EE Replication Algorithms
In application server systems, such as J2EE, replication is an essential strategy for reliability and efficiency. Many J2EE implementations, both commercial and open-source, provid...
Özalp Babaoglu, Alberto Bartoli, Vance Maveri...
COMPGEOM
2009
ACM
15 years 8 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir
XSYM
2009
Springer
139views Database» more  XSYM 2009»
15 years 8 months ago
A Data Parallel Algorithm for XML DOM Parsing
Abstract. The extensible markup language XML has become the de facto standard for information representation and interchange on the Internet. XML parsing is a core operation perfor...
Bhavik Shah, Praveen Rao, Bongki Moon, Mohan Rajag...
ACMMSP
2006
ACM
260views Hardware» more  ACMMSP 2006»
15 years 7 months ago
Seven at one stroke: results from a cache-oblivious paradigm for scalable matrix algorithms
A blossoming paradigm for block-recursive matrix algorithms is presented that, at once, attains excellent performance measured by • time, • TLB misses, • L1 misses, • L2 m...
Michael D. Adams, David S. Wise