Sciweavers

611 search results - page 62 / 123
» Highly scalable parallel sorting
Sort
View
PKDD
2004
Springer
131views Data Mining» more  PKDD 2004»
14 years 2 months ago
Asynchronous and Anticipatory Filter-Stream Based Parallel Algorithm for Frequent Itemset Mining
Abstract In this paper we propose a novel parallel algorithm for frequent itemset mining. The algorithm is based on the filter-stream programming model, in which the frequent item...
Adriano Veloso, Wagner Meira Jr., Renato Ferreira,...
DATE
2008
IEEE
133views Hardware» more  DATE 2008»
14 years 3 months ago
Memory Organization with Multi-Pattern Parallel Accesses
We propose an interleaved memory organization supporting multi-pattern parallel accesses in twodimensional (2D) addressing space. Our proposal targets computing systems with high ...
Arseni Vitkovski, Georgi Kuzmanov, Georgi Gaydadji...
GLOBECOM
2007
IEEE
14 years 3 months ago
Parallel Search Trie-Based Scheme for Fast IP Lookup
—As data rates in the Internet increase, the Internet Protocol (IP) address lookup is required to be resolved in shorter resolution times. IP address lookup involves finding the...
Roberto Rojas-Cessa, Lakshmi Ramesh, Ziqian Dong, ...
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
14 years 8 months ago
Relational joins on graphics processors
We present a novel design and implementation of relational join algorithms for new-generation graphics processing units (GPUs). The most recent GPU features include support for wr...
Bingsheng He, Ke Yang, Rui Fang, Mian Lu, Naga K. ...
CCGRID
2005
IEEE
14 years 2 months ago
Efficient resource description and high quality selection for virtual grids
Simple resource specification, resource selection, and effective binding are critical capabilities for Grid middleware. We the Virtual Grid, an abstraction for dynamic grid applic...
Yang-Suk Kee, D. Logothetis, Richard Y. Huang, Hen...