Sciweavers

140 search results - page 24 / 28
» PaDDMAS: Parallel and Distributed Data Mining Application Su...
Sort
View
PPOPP
2012
ACM
12 years 3 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
CLOUD
2010
ACM
14 years 17 days ago
Stateful bulk processing for incremental analytics
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
Dionysios Logothetis, Christopher Olston, Benjamin...
ICDCSW
2007
IEEE
14 years 1 months ago
Object-Swapping for Resource-Constrained Devices
Mobile devices are still memory-constrained when compared to desktop and laptop computers. Thus, in some circumstances, even while occupied by useful objects, some memory must be ...
Luís Veiga, Paulo Ferreira
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
14 years 8 months ago
A multinomial clustering model for fast simulation of computer architecture designs
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
Kaushal Sanghai, Ting Su, Jennifer G. Dy, David R....
HPCC
2009
Springer
14 years 3 days ago
On Instruction-Level Method for Reducing Cache Penalties in Embedded VLIW Processors
Usual cache optimisation techniques for high performance computing are difficult to apply in embedded VLIW applications. First, embedded applications are not always well structur...
Samir Ammenouche, Sid Ahmed Ali Touati, William Ja...