462 search results - page 59 / 93 » Is Data Distribution Necessary in OpenMP |
IRREGULAR
1995
Springer
13 years 11 months ago
1995
Springer
Dependencies between iterations of loop structures cannot always be determined at compile-time because they may depend on input data which is known only at run-time. A prime examp...
COLCOM
2008
IEEE
13 years 9 months ago
2008
IEEE
Community computing is an agent-based development paradigm for ubiquitous computing systems. In a community computing system, ubiquitous services are provided by cooperation among ...
ICDCS
1991
IEEE
13 years 11 months ago
1991
IEEE
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
ICML
2009
IEEE
14 years 2 months ago
2009
IEEE
The most commonly used learning algorithm for restricted Boltzmann machines is contrastive divergence which starts a Markov chain at a data point and runs the chain for only a few...
LCPC
2007
Springer
14 years 1 months ago
2007
Springer
This paper describes the implementation of a runtime library for asynchronous communication in the Cell BE processor. The runtime library implementation provides with several servi...