5448 search results - page 444 / 1090 » Breakpoints and Time in Distributed Computations |
190
click to vote
CLOUDCOM
2009
Springer
15 years 10 months ago
2009
Springer
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...
169
click to vote
EUROPAR
2000
Springer
15 years 10 months ago
2000
Springer
With the increasing processing power, the latency of the memory hierarchy becomes the stumbling block of many modern computer architectures. In order to speed-up the calculations, ...
236
click to vote
CLUSTER
2011
IEEE
14 years 6 months ago
2011
IEEE
—Much of dense linear algebra has been successfully blocked to concentrate the majority of its time in the Level 3 BLAS, which are not only efficient for serial computation, but...
175
click to vote
ISPDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
190
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Optical Multistage Interconnection Networks (MINs) suffer from optical-loss during switching and crosstalk problem in the switches. The crosstalk problem is solved by routing mess...