2609 search results - page 92 / 522 » Optimizing for parallelism and data locality |
115
Voted
INFOCOM
1995
IEEE
15 years 4 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
CORR
2010
Springer
15 years 21 days ago
2010
Springer
In this paper we present an optimal Bangla Keyboard Layout, which distributes the load equally on both hands so that maximizing the ease and minimizing the effort. Bangla alphabet...
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
We propose general purposes natural heuristics for static block and block-cyclic heterogeneous data decomposition over processes of parallel program mapped into multidimensional g...
186
click to vote
ICDE
2000
IEEE
16 years 1 months ago
2000
IEEE
For an enterprise to take advantage of the opportunities afforded by electronic commerce it must be able to make decisions about business transactions in near-realtime. In the com...
116
Voted
EUROPAR
2007
Springer
15 years 4 months ago
2007
Springer
Skeletal parallel programming enables us to develop parallel programs easily by composing ready-made components called skeletons. However, a simplycomposed skeleton program often l...