Sciweavers

49 search results - page 5 / 10
» Reengineering a Complex Application Using a Scalable Data St...
Sort
View
SIROCCO
2008
13 years 8 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
13 years 5 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima
SAMOS
2010
Springer
13 years 5 months ago
OpenCL-based design methodology for application-specific processors
OpenCL is a programming language standard which enables the programmer to express the application by structuring its computation as kernels. The OpenCL compiler is given the explic...
Pekka O. Jaskelainen, Carlos S. de La Lama, Pablo ...
CORR
2012
Springer
281views Education» more  CORR 2012»
12 years 3 months ago
Belief Propagation by Message Passing in Junction Trees: Computing Each Message Faster Using GPU Parallelization
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
Lu Zheng, Ole J. Mengshoel, Jike Chong
MICRO
2006
IEEE
191views Hardware» more  MICRO 2006»
13 years 7 months ago
CAPSULE: Hardware-Assisted Parallel Execution of Component-Based Programs
Since processor performance scalability will now mostly be achieved through thread-level parallelism, there is a strong incentive to parallelize a broad range of applications, inc...
Pierre Palatin, Yves Lhuillier, Olivier Temam