2609 search results - page 344 / 522 » Optimizing for parallelism and data locality |
142
click to vote
ASPLOS
1992
ACM
15 years 9 months ago
1992
ACM
: In scalable parallel machines, processors can make local memory accesses much faster than they can make remote memory accesses. In addition, when a number of remote accesses must...
161
click to vote
NIPS
2008
15 years 6 months ago
2008
Distributed learning is a problem of fundamental interest in machine learning and cognitive science. In this paper, we present asynchronous distributed learning algorithms for two...
165
click to vote
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
145
click to vote
SPAA
1997
ACM
15 years 9 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
152
Voted
CLOUD
2010
ACM
15 years 10 months ago
2010
ACM
Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while differe...