6105 search results - page 1048 / 1221 » A Parallel Algorithm for Bound-Smoothing |
172
click to vote
CCGRID
2010
IEEE
15 years 7 months ago
2010
IEEE
Markets of computing resources typically consist of a cluster (or a multi-cluster) and jobs that arrive over time and request computing resources in exchange for payment. In this p...
171
click to vote
HPDC
2010
IEEE
15 years 7 months ago
2010
IEEE
Clusters are mostly used through Resources Management Systems (RMS) with a static allocation of resources for a bounded amount of time. Those approaches are known to be insufficie...
205
click to vote
JNW
2008
15 years 6 months ago
2008
Recently overlay networks have emerged as an efficient and flexible method for content distribution. An overlay network is a network running on top of another network, usually the ...
172
click to vote
TVLSI
2008
15 years 6 months ago
2008
Applications in computer networks often require high throughput access to large data structures for lookup and classification. While advanced algorithms exist to speed these search...
319
click to vote
MAM
2011
15 years 1 months ago
2011
The paper presents a new multiplier enabling achievement of an arbitrary accuracy. It follows the same idea of number representation as the Mitchell’s algorithm, but does not use...